Abstract
This encyclopedic article gives a mini-introduction into the theory of universal learning, founded by Ray Solomonoff in the 1960s and significantly developed and extended in the last decade. It explains the spirit of universal learning, but necessarily glosses over technical subtleties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Recommended Reading
Cilibrasi R, Vitányi PMB (2005) Clustering by compression. IEEE Trans Inf Theory 51(4):1523–1545
Gaglio M (2007) Universal search. Scholarpedia 2(11):2575
Hutter M (2005) Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability. Springer, Berlin
Hutter M (2006) Human knowledge compression prize. Open ended, http://prize.hutter1.net/
Hutter M (2007) On universal prediction and Bayesian confirmation. Theor Comput Sci 384(1):33–48
Hutter M (2012) One decade of universal artificial intelligence. In: Wang P, Goertzel B (eds) Theoretical Foundations of Artificial General Intelligence. Atlantis Press, Amsterdam, pp 67–88
Lattimore T, Hutter M (2011) No free lunch versus Occam’s razor in supervised learning. In: Proceedings of the Solomonoff 85th memorial conference, Melbourne. Volume 7070 of LNAI. Springer, pp 223–235
Li M, Vitányi PMB (2008) An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Berlin
Orseau L, Lattimore T, Hutter M (2013) Universal knowledge-seeking agents for stochastic environments. In: Proceedings of the 24th international conference on algorithmic learning theory (ALT’13), Singapore. Volume 8139 of LNAI. Springer, pp 158–172
Rathmanner S, Hutter M (2011) A philosophical treatise of universal induction. Entropy 13(6):1076–1136
Schmidhuber J (2002) Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. Int J Found Comput Sci 13(4):587–612
Solomonoff RJ (1964) A formal theory of inductive inference: Parts 1 and 2. Inf Control 7:1–22 and 224–254
Solomonoff RJ (1978) Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans Inf Theory IT-24:422–432
Veness J, Ng KS, Hutter M, Uther W, Silver D (2011) A Monte-Carlo AIXI approximation. J Artif Intell Res 40:95–142
Wood I, Sunehag P, Hutter M (2011) (Non-)equivalence of universal priors. In: Proceedings of the Solomonoff 85th memorial conference, Melbourne. Volume 7070 of LNAI. Springer, pp 417–425
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media New York
About this entry
Cite this entry
Hutter, M. (2017). Universal Learning Theory. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_867
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7687-1_867
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7685-7
Online ISBN: 978-1-4899-7687-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering