Cited by 1,595Stochastic Gradient Optimization TechniquesMachine Learning and AlgorithmsMachine Learning and Data Classification

Reconciling modern machine-learning practice and the classical bias–variance trade-off

Open access
Belkin, Mikhail, Hsu, Daniel, Ma, Siyuan, Mandal, Soumik·2019·Proceedings of the National Academy of Sciences

Abstract

Significance: While breakthroughs in machine learning and artificial intelligence are changing society, our fundamental understanding has lagged behind. It is traditionally believed that fitting models to the training data exactly is to be avoided as it leads to poor performance on unseen data. However, powerful modern classifiers frequently have near-perfect fit in training, a disconnect that spurred recent intensive research and controversy on whether theory provides practical insights. In this work, we show how classical theory and modern practice can be reconciled within a single unified performance curve and propose a mechanism underlying its emergence. We believe this previously unknown pattern connecting the structure and performance of learning architectures will help shape design and understanding of learning algorithms.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.1903070116

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. [19][19] Xavier Glorot and Yoshua Bengio. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics , pages 249-256, 2010. -
  2. [22][22] Alex Krizhevsky and Geoffrey Hinton. Learning multiple layers of features from tiny images. Master's thesis, University of Toronto, 2009. -
  3. [23][23] Ken Lang. Newsweeder: Learning to filter netnews. In Machine Learning Proceedings , pages 331-339. Elsevier, 1995. -
  4. [24][24] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. In Proceedings of the IEEE , volume 86, pages 2278-2324, 1998. -
  5. [28][28] Y. Netzer, T. Wang, A. Coates, A. Bissacco, B. Wu, and A. Ng. Reading digits in natural images with unsupervised feature learning. In NIPS workshop , volume 2011, page 4, 2011. -
  6. [29][29] Jeffrey Pennington, Richard Socher, and Christopher Manning. Glove: Global vectors for word representation. In Proceedings of the 2014 conference on empirical methods in natural language processing , pages 1532-1543, 2014. -
  7. [37][37] Stefano Spigler, Mario Geiger, St´ ephane d'Ascoli, Levent Sagun, Giulio Biroli, and Matthieu Wyart. A jamming transition from under-to over-parametrization affects loss landscape and generalization. arXiv preprint arXiv:1810.09665 , 2018. - · arXiv
  8. [40][40] Holger Wendland. Scattered Data Approximation . Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2004. doi: 10.1017/ CBO9780511617539. -

Cited by

Sorted by citations

Authors
Belkin, M., Hsu, D., Ma, S., & Mandal, S.
Affiliations
  • The Ohio State University (US)
  • Columbia University (US)
Venue
Proceedings of the National Academy of Sciences
Published
2019-07-24
Volume
116
Issue
32
Pages
15849-15854
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2963518130
Cited by
1,595
References
35
Citations by year
2026: 190 · 2025: 268 · 2024: 219 · 2023: 226 · 2022: 230 · 2021: 239 · 2020: 191 · 2019: 25 · 2018: 7
FWCI
78.14
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the National Academy of Sciences (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (RI-1815697, CCF-1740833)
  • Alfred P. Sloan Foundation (FG-2016-6295)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
double descent, bias-variance trade-off, overfitting, underfitting, artificial neural networks, interpolation, model capacity, generalization, performance curves, overparameterized models

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review