New website coming soon
Please note that over the next month our website will be changing. Go to cecs.anu.edu.au/newsite for more information.
Asymptotically Optimal Agents
Tor Lattimore (ANU)CS HDR MONITORING AI Group
TIME: 11:30:00 - 12:00:00
LOCATION: RSISE Seminar Room, A105 with Turkish Pide
Artificial general intelligence aims to create agents capable of learning to solve arbitrary interesting problems. Unfortunately, what it means to be optimal as a general reinforcement learning agent has no clear definitions. I will present two versions of asymptotic optimality, one stronger than the other. I show that no agent can be strong asymptotically optimal and that there exist agents that are weak asymptotically optimal. I also demonstrate that such agents are necessarily incomputable.