about
Reconciling modern machine learning practice and the bias-variance trade-off (arxiv.org)
3 points by Anon84 on Apr 23, 2022 | hide | past | pdf | discuss on HN

In plain words: They charted how test error changes as models grow, finding a double-descent curve: error peaks when a model fits the training data exactly, then falls as models get bigger. It held across many models and data, showing oversized networks can beat the usual best-sized one.

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.

Mikhail Belkin, Daniel Hsu, Siyuan Ma, Soumik Mandal
arXiv:1812.11118 · stat.ML, cs.LG · submitted Dec 28, 2018 · updated Sep 10, 2019
abstract · pdf · html

add comment on HN
Also discussed: Feb 2020 (2 points, 0 comments) · Aug 2019 (1 point, 0 comments)