Abstract
We identify principles characterizing Solomonoff Induction by demands on an agent’s external behaviour. Key concepts are rationality, computability, indifference and time consistency. Furthermore, we discuss extensions to the full AI case to derive AIXI.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
de Finetti, B.: La prévision: Ses lois logiques, ses sources subjectives. In: Annales de l’Institut Henri Poincar, Paris, vol. 7, pp. 1–68 (1937)
Diestel, J.: Sequences and series in Banach spaces. Springer (1984)
Dowe, D.L.: MML, hybrid bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Handbook of the Philosophy of Science, HPS. Philosophy of Statistics, vol. 7, pp. 901–982 (2011)
Grünwald, P.: The Minimum Description Length Principle. MIT Press Books, The MIT Press (2007)
Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin (2005)
Hutter, M.: On universal prediction and Bayesian confirmation. Theoretical Computer Science 384, 33–48 (2007)
Kreyszig, E.: Introductory Functional Analysis With Applications. Wiley (1989)
Li, M., Vitányi, P.: Kolmogorov Complexity and its Applications. Springer (2008)
Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press (1944)
Ramsey, F.: Truth and probability. In: Braithwaite, R.B. (ed.) The Foundations of Mathematics and other Logical Essays, ch. 7, pp. 156–198. Brace & Co. (1931)
Rathmanner, S., Hutter, M.: A philosophical treatise of universal induction. Entropy 13(6), 1076–1136 (2011)
Rissanen, J.: Modeling By Shortest Data Description. Automatica 14, 465–471 (1978)
Rissanen, J.: Minimum description length principle. In: Sammut, C., Webb, G. (eds.) Encyclopedia of Machine Learning, pp. 666–668. Springer (2010)
Savage, L.: The Foundations of Statistics. Wiley, New York (1954)
Sutton, R., Barto, A.: Reinforcement Learning: An Introduction (Adaptive Computation and Machine Learning). The MIT Press (March 1998)
Sunehag, P., Hutter, M.: Axioms for rational reinforcement learning. In: Kivinen, J., Szepesvári, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 338–352. Springer, Heidelberg (2011)
Solomonoff, R.: A Preliminary Report on a General Theory of Inductive Inference. Report V-131, Zator Co., Cambridge, Ma. (1960)
Solomonoff, R.J.: Complexity-based induction systems: comparisons and convergence theorems. IEEE Transactions on Information Theory 24, 422–432 (1978)
Solomonoff, R.J.: Does algorithmic probability solve the problem of induction? In: Proceedings of the Information, Statistics and Induction in Science Conferece (1996)
Sugden, R.: Rational choice: A survey of contributions from economics and philosophy. Economic Journal 101(407), 751–785 (1991)
Turing, A.M.: On Computable Numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 2(42), 230–265 (1936)
Wallace, C.S.: Statistical and Inductive Inference by Minimum Message Length. Information Science and Statistics. Springer (2005)
Wallace, C.S., Boulton, D.M.: An information measure for classification. Computer Journal 11, 185–194 (1968)
Wallace, C.S., Dowe, D.L.: Minimum message length and Kolmogorov complexity. Computer Journal 42, 270–283 (1999)
Wood, I., Sunehag, P., Hutter, M. (Non-) Equivalence of universal priors. In: Proc. of Solomonoff Memorial Conference, Melbourne, Australia (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sunehag, P., Hutter, M. (2013). Principles of Solomonoff Induction and AIXI. In: Dowe, D.L. (eds) Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. Lecture Notes in Computer Science, vol 7070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44958-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-44958-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44957-4
Online ISBN: 978-3-642-44958-1
eBook Packages: Computer ScienceComputer Science (R0)