{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T04:47:29Z","timestamp":1777783649121,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642449574","type":"print"},{"value":"9783642449581","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44958-1_17","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T10:54:01Z","timestamp":1382439241000},"page":"223-235","source":"Crossref","is-referenced-by-count":12,"title":["No Free Lunch versus Occam\u2019s Razor in Supervised Learning"],"prefix":"10.1007","author":[{"given":"Tor","family":"Lattimore","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Hutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Carroll, J., Seppi, K.: No-free-lunch and Bayesian optimality. In: IJCNN Workshop on Meta-Learning (2007)"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vitanyi, P.: Clustering by compression. IEEE Transactions on Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR3","unstructured":"Derbeko, P., El-yaniv, R., Meir, R.: Error bounds for transductive learning via compression and clustering. In: NIPS, vol.\u00a016 (2004)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Dowe, D.: MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Handbook of Philosophy of Statistics, vol.\u00a07, pp. 901\u2013982. Elsevier (2011)","DOI":"10.1016\/B978-0-444-51862-0.50030-7"},{"issue":"1-2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(83)90139-1","volume":"22","author":"P. G\u00e1cs","year":"1983","unstructured":"G\u00e1cs, P.: On the relation between descriptional complexity and algorithmic probability. Theoretical Computer Science\u00a022(1-2), 71\u201393 (1983)","journal-title":"Theoretical Computer Science"},{"key":"17_CR6","unstructured":"G\u00e1cs, P.: Expanded and improved proof of the relation between description complexity and algorithmic probability (2008) (unpublished)"},{"key":"17_CR7","unstructured":"Giraud-Carrier, C., Provost, F.: Toward a justification of meta-learning: Is the no free lunch theorem a show-stopper. In: ICML Workshop on Meta-Learning, pp. 9\u201316 (2005)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P.: The Minimum Description Length Principle. MIT Press Books, vol.\u00a01. The MIT Press (2007)","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"17_CR9","volume-title":"Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability","author":"M. Hutter","year":"2004","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin (2004)"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3390\/a3040329","volume":"3","author":"M. Hutter","year":"2010","unstructured":"Hutter, M.: A complete theory of everything (will be subjective). Algorithms\u00a03(4), 329\u2013350 (2010)","journal-title":"Algorithms"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.tcs.2007.03.040","volume":"382","author":"M. Hutter","year":"2007","unstructured":"Hutter, M., Muchnik, A.: On semimeasures predicting Martin-L\u00f6f random sequences. Theoretical Computer Science\u00a0382(3), 247\u2013261 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF03024407","volume":"19","author":"W. Kirchherr","year":"1997","unstructured":"Kirchherr, W., Li, M., Vitanyi, P.: The miraculous universal distribution. The Mathematical Intelligencer\u00a019(4), 7\u201315 (1997)","journal-title":"The Mathematical Intelligencer"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09(6), 602\u2013619 (1966)","journal-title":"Information and Control"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.3390\/e13061076","volume":"13","author":"S. Rathmanner","year":"2011","unstructured":"Rathmanner, S., Hutter, M.: A philosophical treatise of universal induction. Entropy\u00a013(6), 1076\u20131136 (2011)","journal-title":"Entropy"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Schaffer, C.: A conservation law for generalization performance. In: Proceedings of the Eleventh International Conference on Machine Learning, pp. 259\u2013265. Morgan Kaufmann (1994)","DOI":"10.1016\/B978-1-55860-335-6.50039-8"},{"key":"17_CR17","first-page":"565","volume-title":"GECCO 2001: Proc. of the Genetic and Evolutionary Computation Conf.","author":"C. Schumacher","year":"2001","unstructured":"Schumacher, C., Vose, M., Whitley, L.: The no free lunch and problem description length. In: Spector, L., Goodman, E.D. (eds.) GECCO 2001: Proc. of the Genetic and Evolutionary Computation Conf., pp. 565\u2013570. Morgan Kaufmann, San Francisco (2001)"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference, Part I. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference, Part II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"key":"17_CR20","volume-title":"Estimation of Dependences Based on Empirical Data","author":"V. Vapnik","year":"1982","unstructured":"Vapnik, V.: Estimation of Dependences Based on Empirical Data. Springer, New York (1982)"},{"key":"17_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1","volume-title":"The Nature of Statistical Learning Theory","author":"V. Vapnik","year":"2000","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"17_CR22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1613\/jair.3125","volume":"40","author":"J. Veness","year":"2011","unstructured":"Veness, J., Ng, K.S., Hutter, M., Uther, W., Silver, D.: A Monte Carlo AIXI approximation. Journal of Artificial Intelligence Research\u00a040, 95\u2013142 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C. Wallace","year":"1968","unstructured":"Wallace, C., Boulton, D.: An information measure for classification. The Computer Journal\u00a011(2), 185\u2013194 (1968)","journal-title":"The Computer Journal"},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C. Wallace","year":"1999","unstructured":"Wallace, C., Dowe, D.: Minimum message length and Kolmogorov complexity. The Computer Journal\u00a042(4), 270\u2013283 (1999)","journal-title":"The Computer Journal"},{"key":"17_CR25","volume-title":"Knowing and guessing; a quantitative study of inference and information","author":"S. Watanabe","year":"1969","unstructured":"Watanabe, S., Donovan, S.: Knowing and guessing; a quantitative study of inference and information. Wiley, New York (1969)"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Wolpert, D.: The supervised learning no-free-lunch theorems. In: Proc. 6th Online World Conference on Soft Computing in Industrial Applications, pp. 25\u201342 (2001)","DOI":"10.1007\/978-1-4471-0123-9_3"},{"issue":"1","key":"17_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44958-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:35:00Z","timestamp":1558636500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}