From a point of view of Artificial General Intelligence, RL learners like Hutter's universal, Pareto optimal, incomputable AIXI heavily rely on the definition of the rewards, which are necessarily given by some "teacher" to define the tasks to solve. AIXI, as is, cannot therefore be said to be a fully autonomous agent. Furthermore, it has recently been shown that AIXI can converge to a suboptimal behavior in certain situations, hence showing the intrinsic difficulty of RL, with its non-obvious pitfalls. We propose a new model of intelligence, the Knowledge-Seeking Agent (KSA), halfway between Solomonoff Induction and AIXI, that defines a completely autonomous agent that does not require a teacher. The goal of this agent is not to maximize arbitrary rewards, but "simply" to entirely explore its world in an optimal way. A proof of strong asymptotic optimality for a class of horizon functions shows that this agent, unlike AIXI in its domain, behaves according to expectation. Some implications of such an unusual agent are proposed. © 2011 Springer-Verlag.
CITATION STYLE
Orseau, L. (2011). Universal knowledge-seeking agents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6925 LNAI, pp. 353–367). https://doi.org/10.1007/978-3-642-24412-4_28
Mendeley helps you to discover research relevant for your work.