Pith. sign in

REVIEW 1 cited by

Understanding the Double Descent Phenomenon in Deep Learning

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 2403.10459 v1 pith:Q6DSLZUZ submitted 2024-03-15 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords descentdoublelearningsectioncapacityclassicalcontroldeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Combining empirical risk minimization with capacity control is a classical strategy in machine learning when trying to control the generalization gap and avoid overfitting, as the model class capacity gets larger. Yet, in modern deep learning practice, very large over-parameterized models (e.g. neural networks) are optimized to fit perfectly the training data and still obtain great generalization performance. Past the interpolation point, increasing model complexity seems to actually lower the test error. In this tutorial, we explain the concept of double descent and its mechanisms. The first section sets the classical statistical learning framework and introduces the double descent phenomenon. By looking at a number of examples, section 2 introduces inductive biases that appear to have a key role in double descent by selecting, among the multiple interpolating solutions, a smooth empirical risk minimizer. Finally, section 3 explores the double descent with two linear models, and gives other points of view from recent related works.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learned iterative networks: An operator learning perspective

    eess.IV 2025-12 conditional novelty 3.0 of 10

    Learned iterative reconstruction networks can be uniformly described as operator learning: the unrolled architecture fixes how to compute while the loss and data fix what to compute; for nonlinear inverse problems the...

Pith tools