mlsanityData to 7 Oct 2026

Classical Statistical (In-Sample) Intuitions Don't Generalize Well: A Note on Bias-Variance Tradeoffs, Overfitting and Moving from Fixed to Random Designs

arXiv 2409.18842 ↗First posted 27 Sep 2024stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

The sudden appearance of modern machine learning (ML) phenomena like double descent and benign overfitting may leave many classically trained statisticians feeling uneasy -- these phenomena appear to go against the very core of statistical intuitions conveyed in any introductory class on learning from data. The historical lack of earlier observation of such phenomena is usually attributed to today's reliance on more complex ML methods, overparameterization, interpolation and/or higher data dimensionality. In this note, we show that there is another reason why we observe behaviors today that appear at odds with intuitions taught in classical statistics textbooks, which is much simpler to understand yet rarely discussed explicitly. In particular, many intuitions originate in fixed design settings, in which in-sample prediction error (under resampling of noisy outcomes) is of interest, while modern ML evaluates its predictions in terms of generalization error, i.e. out-of-sample prediction error in random designs. Here, we highlight that this simple move from fixed to random designs has (perhaps surprisingly) far-reaching consequences on textbook intuitions relating to the bias-variance tradeoff, and comment on the resulting (im)possibility of observing double descent and benign overfitting in fixed versus random designs.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 18 of its 32 references that are in the map. First posted on arXiv 27 Sep 2024.

Builds on

18 of 32 references.

References · 18

  1. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  2. 2019Benign Overfitting in Linear Regressioncited by 544
  3. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  4. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  5. 2018To understand deep learning we need to understand kernel learningcited by 186
  6. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 130
  7. 2019Harmless interpolation of noisy data in regressioncited by 121
  8. 2018Overfitting or perfect fitting? Risk bounds for classification and regression rules that interpolatecited by 99
  9. 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
  10. 2018A Modern Take on the Bias-Variance Tradeoff in Neural Networkscited by 64
  11. 2020Rethinking Parameter Counting in Deep Models: Effective Dimensionality Revisitedcited by 50
  12. 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
6 more
  1. 2020A Brief Prehistory of Double Descentcited by 44
  2. 2023A U-turn on Double Descent: Rethinking Parameter Counting in Statistical Learningcited by 32
  3. 2017Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lassocited by 16
  4. 2024Why do Random Forests Work? Understanding Tree Ensembles as Self-Regularizing Adaptive Smootherscited by 13
  5. 2017From Fixed-X to Random-X Regression: Bias-Variance Decompositions, Covariance Penalties, and Prediction Error Estimationcited by 12
  6. 2019On the Bias-Variance Tradeoff: Textbooks Need an Updatecited by 8

Built on by

Cited by year (2026 to 7 Oct)

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

5 papers.