Asymptotically optimal agents
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.
|Collections||ANU Research Publications|
|Book Title:||Algorithmic learning theory : 22nd international conference, ALT 2011, Espoo, Finland, October 5-7, 2011 : proceedings|
|Lattimore and Hutter Asymptotically Optimal Agents 2011.pdf||332.7 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.