No Free Lunch versus Occam’s Razor in Supervised Learning

DOI10.1007/978-3-642-44958-1_17zbMath1403.68195arXiv1111.3846OpenAlexW2963403189WikidataQ58012289 ScholiaQ58012289MaRDI QIDQ2868414

Tor Lattimore, Marcus Hutter

Publication date: 17 December 2013

Published in: Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3846

zbMATH Keywords

supervised learningKolmogorov complexityOccam's razorno free lunch

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (4)

The no-free-lunch theorems of supervised learning ⋮ On the computability of Solomonoff induction and AIXI ⋮ Making sense of raw input ⋮ What Is Important About the No Free Lunch Theorems?

This page was built for publication: No Free Lunch versus Occam’s Razor in Supervised Learning