Optimality Issues of Universal Greedy Agents with Static Priors

  • Laurent Orseau
Conference paper

DOI: 10.1007/978-3-642-16108-7_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6331)
Cite this paper as:
Orseau L. (2010) Optimality Issues of Universal Greedy Agents with Static Priors. In: Hutter M., Stephan F., Vovk V., Zeugmann T. (eds) Algorithmic Learning Theory. ALT 2010. Lecture Notes in Computer Science, vol 6331. Springer, Berlin, Heidelberg

Abstract

Finding the universal artificial intelligent agent is the old dream of AI scientists. Solomonoff Induction was one big step towards this, giving a universal solution to the general problem of Sequence Prediction, by defining a universal prior distribution. Hutter defined AIXI, which extends the latter to the Reinforcement Learning framework, where almost all if not all AI problems can be formulated. However, new difficulties arise, because the agent is now active, whereas it is only passive in the Sequence Prediction case. This makes proving AIXI’s optimality difficult. In fact, we prove that the current definition of AIXI can sometimes be only suboptimal in a certain sense, and we generalize this result to infinite horizon agents and to any static prior distribution.

Keywords

AIXI Universal Artificial Intelligence Solomonoff Induction Reinforcement Learning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Laurent Orseau
    • 1
  1. 1.UMR AgroParisTech 518 / INRAParisFrance

Personalised recommendations