Pith. sign in

REVIEW 4 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.11118 v2 pith:Z7E5VFB6 submitted 2018-12-28 stat.ML cs.LG

classification stat.MLcs.LG
keywords learningmachinepracticebias-variancemodelsmoderntrade-offcurve
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Breakthroughs in machine learning are rapidly changing science and society, yet our fundamental understanding of this technology has lagged far behind. Indeed, one of the central tenets of the field, the bias-variance trade-off, appears to be at odds with the observed behavior of methods used in the modern machine learning practice. The bias-variance trade-off implies that a model should balance under-fitting and over-fitting: rich enough to express underlying structure in data, simple enough to avoid fitting spurious patterns. However, in the modern practice, very rich models such as neural networks are trained to exactly fit (i.e., interpolate) the data. Classically, such models would be considered over-fit, and yet they often obtain high accuracy on test data. This apparent contradiction has raised questions about the mathematical foundations of machine learning and their relevance to practitioners. In this paper, we reconcile the classical understanding and the modern practice within a unified performance curve. This "double descent" curve subsumes the textbook U-shaped bias-variance trade-off curve by showing how increasing model capacity beyond the point of interpolation results in improved performance. We provide evidence for the existence and ubiquity of double descent for a wide spectrum of models and datasets, and we posit a mechanism for its emergence. This connection between the performance and the structure of machine learning models delineates the limits of classical analyses, and has implications for both the theory and practice of machine learning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 83 citations worldwide. Full citation record

  1. Benign Overfitting Does Not Occur in Diffusion Models

    stat.ML 2026-07 conditional novelty 7.0 of 10

    Benign overfitting and double descent do not occur in diffusion models: population and empirical score-matching losses cannot both be small without exponentially many samples.

  2. Semantic Space Search Trajectory Networks

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Semantic-space STNs, built by Hamming clustering of prediction vectors, recover algorithm differences and show denser, more centralized graphs under real labels than under shuffled labels.

  3. Asymptotic Behavior of Multi--Task Learning: Implicit Regularization and Double Descent Effects

    cs.LG 2026-03 conditional novelty 6.0 of 10

    Multi-task learning of related perceptrons is asymptotically a single-task problem plus explicit regularizers that improve generalization and postpone double descent.

  4. PhishingHook: Catching Phishing Ethereum Smart Contracts leveraging EVM Opcodes

    cs.CR 2025-06 conditional novelty 6.0 of 10

    PhishingHook benchmarks 16 machine learning models that classify Ethereum smart contracts as phishing or benign from their bytecode opcodes, reporting about 90% average accuracy with Random Forest best at 93.6%.

Pith tools