mlsanityData to 7 Oct 2026

Statistical learning theory and Occam's razor: The core argument

arXiv 2312.13842 ↗First posted 21 Dec 2023cs.LG math.ST stat.THcited by 5

Not on the map. Why?

Abstract (arXiv)

Statistical learning theory is often associated with the principle of Occam's razor, which recommends a simplicity preference in inductive inference. This paper distills the core argument for simplicity obtainable from statistical learning theory, built on the theory's central learning guarantee for the method of empirical risk minimization. This core "means-ends" argument is that a simpler hypothesis class or inductive model is better because it has better learning guarantees; however, these guarantees are model-relative and so the theoretical push towards simplicity is checked by our prior knowledge.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 8 of its 81 references that are in the map. First posted on arXiv 21 Dec 2023.

Builds on

8 of 81 references.

References · 8

  1. 2021Deep learning: a statistical viewpointcited by 239
  2. 2021A Fine-Grained Analysis on Distribution Shiftcited by 171
  3. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 130
  4. 2021The Modern Mathematics of Deep Learningcited by 63
  5. 2020A Theory of Universal Learningcited by 59
  6. 2015Fast rates in statistical and online learningcited by 47
  7. 2022The no-free-lunch theorems of supervised learningcited by 16
  8. 2022On characterizations of learnability with computable learnerscited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 2.

5 papers.