mlsanityData to 7 Oct 2026

Benign interpolation and Occam's razor

arXiv 2608.03386 ↗First posted 4 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Contemporary deep learning methods generalize well even when they fit their training data perfectly, a phenomenon known as benign interpolation. This phenomenon cannot be accounted for by classical statistical learning theory and has prompted a range of attempted new explanations in the statistics and machine learning literature. A common feature of these new proposals is an appeal to a simplicity preference among interpolating models, often presented as a form of Occam's razor. We clarify this debate for a philosophical audience and argue that this new appeal to simplicity creates an explanatory gap. The classical theory offers theorems which connect the simplicity of model classes to good generalization, thus underwriting methodological simplicity norms. The new accounts instead appeal to properties of individual models, which they interpret as a kind of simplicity. Lacking a provable connection to generalization, it is the name "simplicity" that does the work a theorem used to do, making a substantive and unargued assumption look like the application of a familiar methodological principle.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 69 references that are in the map. First posted on arXiv 4 Aug 2026.

Builds on

28 of 69 references.

References · 28

  1. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  2. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  3. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  4. 2019Benign Overfitting in Linear Regressioncited by 544
  5. 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
  6. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  7. 2021Deep learning: a statistical viewpointcited by 239
  8. 2019Uniform convergence may be unable to explain generalization in deep learningcited by 223
  9. 2018To understand deep learning we need to understand kernel learningcited by 186
  10. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 130
  11. 2019Harmless interpolation of noisy data in regressioncited by 121
  12. 2016Why does deep and cheap learning work so well?cited by 100
16 more
  1. 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 75
  2. 2021The Modern Mathematics of Deep Learningcited by 63
  3. 2023The No Free Lunch Theorem, Kolmogorov Complexity, and the Role of Inductive Biases in Machine Learningcited by 63
  4. 2025Deep Learning is Not So Mysterious or Differentcited by 55
  5. 2020A Brief Prehistory of Double Descentcited by 44
  6. 2024Neural Redshift: Random Networks are not Random Functionscited by 43
  7. 2022The Implicit Bias of Benign Overfittingcited by 38
  8. 2023A U-turn on Double Descent: Rethinking Parameter Counting in Statistical Learningcited by 32
  9. 2023Deep neural networks have an inbuilt Occam's razorcited by 28
  10. 2022The no-free-lunch theorems of supervised learningcited by 16
  11. 2025Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wildcited by 13
  12. 2023Statistical learning theory and Occam's razor: The core argumentcited by 5
  13. 2024Classical Statistical (In-Sample) Intuitions Don't Generalize Well: A Note on Bias-Variance Tradeoffs, Overfitting and Moving from Fixed to Random Designscited by 5
  14. 2022A Falsificationist Account of Artificial Neural Networkscited by 4
  15. 2026Solomonoff inductioncited by 2
  16. 2025DNNs, Dataset Statistics, and Correlation Functionscited by 1

Built on by

Not cited yet.