mlsanityData to 7 Oct 2026

Interpolation Learning With Minimum Description Length

arXiv 2302.07263 ↗First posted 14 Feb 2023cs.LG cs.DS cs.ITcited by 5

Not on the map. Why?

Abstract (arXiv)

We prove that the Minimum Description Length learning rule exhibits tempered overfitting. We obtain tempered agnostic finite sample learning guarantees and characterize the asymptotic behavior in the presence of random label noise.

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

Builds on

12 of 21 references.

References · 12

  1. 2019Benign Overfitting in Linear Regressioncited by 544
  2. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  3. 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
  4. 2018Overfitting or perfect fitting? Risk bounds for classification and regression rules that interpolatecited by 99
  5. 2020Classification vs regression in overparameterized regimes: Does the loss function matter?cited by 97
  6. 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
  7. 2018Does data interpolation contradict statistical optimality?cited by 95
  8. 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
  9. 2021Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfittingcited by 54
  10. 2019In Defense of Uniform Convergence: Generalization via derandomization with an application to interpolating predictorscited by 44
  11. 2022Spectrum of inner-product kernel matrices in the polynomial regime and multiple descent phenomenon in kernel ridge regressioncited by 42
  12. 2020Distributional Generalization: A New Kind of Generalizationcited by 41

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 2; 2025: 1.

5 papers.