Asymptotically Optimal Agents
- Cite this paper as:
- Lattimore T., Hutter M. (2011) Asymptotically Optimal Agents. In: Kivinen J., Szepesvári C., Ukkonen E., Zeugmann T. (eds) Algorithmic Learning Theory. ALT 2011. Lecture Notes in Computer Science, vol 6925. Springer, Berlin, Heidelberg
Artificial general intelligence aims to create agents capable of learning to solve arbitrary interesting problems. We define two versions of asymptotic optimality and prove that no agent can satisfy the strong version while in some cases, depending on discounting, there does exist a non-computable weak asymptotically optimal agent.
KeywordsRational agents sequential decision theory artificial general intelligence reinforcement learning asymptotic optimality general discounting
Unable to display preview. Download preview PDF.