Bad Universal Priors and Notions of Optimality

By Jan Leike, Jan Leike, Marcus Hutter. 2015

45 citations recorded by the source corpus.

A big open question of algorithmic information theory is the choice of the universal Turing machine (UTM). For Kolmogorov complexity and Solomonoff induction we have invariance theorems: the choice of the UTM changes bounds only by a constant. For the universally intelligent agent AIXI (Hutter, 2005) no invariance theorem is known. Our results are entirely negative: we discuss cases in which unlucky or adversarial choices of the UTM cause AIXI to misbehave drastically. We show that Legg-Hutter intelligence and thus balanced Pareto optimality is entirely subjective, and that every policy is Pareto optimal in the class of all computable environments. This undermines all existing optimality properties for AIXI. While it may still serve as a gold standard for AI, our results imply that AIXI is a relative theory, dependent on the choice of the UTM.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Theory

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Tom Everitt
  2. Shane Legg
  3. Jan Leike
  4. Marcus Hutter
  5. David Krueger
  6. Miljan Martic
  7. Laurent Orseau
  8. Vishal Maini

In Computational Theory and Mathematics

  1. Tom Everitt
  2. Shane Legg
  3. Marcus Hutter
  4. Jan Leike
  5. Benya Fallenstein
  6. Jessica Taylor
  7. Miljan Martic
  8. Mayank Daswani

In Information Theory

  1. Laurent Orseau
  2. Shane Legg
  3. Jan Leike
  4. Stuart Armstrong
  5. Tom Everitt
  6. Jessica Taylor
  7. Marcus Hutter
  8. Benya Fallenstein

Citations in the corpus