FlashPapers
Empirical Deep Learning Theory

Deep Double Descent:
Where Bigger Models and More Data Hurt

By Preetum Nakkiran*, Gal Kaplun†, Yamini Bansal†, Tristan Yang, Boaz Barak, Ilya Sutskever (2019)

"We show that a variety of modern deep learning tasks exhibit a 'double-descent' phenomenon where, as we increase model size, performance first gets worse and then gets better. Moreover, this occurs not just as a function of model size, but also as a function of training epochs and sample size."

Model Complexity Epoch-wise Overfitting Sample Non-monotonicity

Why This Matters

In classical statistical learning theory, the bias-variance trade-off dictates that simple models suffer from high bias (underfitting), while highly complex models suffer from high variance (overfitting). This produces a familiar U-shaped test error curve: as model capacity increases, test error falls to a sweet spot and then rises indefinitely.

Yet, modern deep learning practice defies this rule. Practitioners routinely train massive neural networks with millions of parameters that can easily fit random noise, yet these models generalize exceptionally well. This discrepancy led to two conflicting paradigms: classical statistics saying "larger models are worse," and modern deep learning saying "bigger models are always better."

This paper reconciles both views by showing they are two halves of a larger curve: the Double Descent Curve.

The Big Idea: Effective Model Complexity

To unify these behaviors, the authors introduce a new concept: Effective Model Complexity (EMC). The EMC is not just a count of parameters; it is a property of the entire training procedure (including the architecture, optimizer, and training duration).

Definition: Effective Model Complexity

The Effective Model Complexity of a training procedure $\mathcal{T}$ (with respect to data distribution $\mathcal{D}$ and parameter $\epsilon > 0$) is the maximum number of samples $n$ on which $\mathcal{T}$ can achieve an average training error of at most $\epsilon$:

$$\text{EMC}_{\mathcal{D}, \epsilon}(\mathcal{T}) := \max \{ n \mid \mathbb{E}_{S \sim \mathcal{D}^n} [\text{Error}_S(\mathcal{T}(S))] \le \epsilon \}$$

Using this framework, the authors formulate the Generalized Double Descent Hypothesis:

  • Under-parameterized Regime ($\text{EMC} \ll n$): Increasing complexity decreases test error.
  • Critically Parameterized Regime ($\text{EMC} \approx n$): The model is barely able to interpolate the training set. Any noise or mis-specification causes extreme sensitivity, leading to a massive peak in test error.
  • Over-parameterized Regime ($\text{EMC} \gg n$): The model easily interpolates the training set. Increasing complexity further actually *improves* generalization by finding smoother interpolating functions.

Interactive Widget 1: Model-wise Double Descent

Adjust the label noise and model width to see how the double descent curve shifts. Notice how the test error peaks exactly at the interpolation threshold (where training error hits zero).

Current Regime

Critically Parameterized

Interpolation Threshold Model Capacity (Width $k$) Error Rate Train Error Test Error

Epoch-wise Double Descent

Intriguingly, the double descent phenomenon is not restricted to model size. It also manifests over the course of training time (epochs). For a fixed, sufficiently large model, training longer can exhibit a U-like curve of test error, followed by a second descent.

In the early stages of training, the model behaves like an under-parameterized model. As epochs increase, its effective complexity grows until it matches the sample size $n$. At this point, the model overfits to any noise in the dataset, causing a peak in test error. However, if you continue training past this critical threshold, the test error begins to decline again.

Interactive Widget 2: Training Progress & Model Size

Select a model size and scrub through the epochs to see how test error behaves differently across regimes.

Choose Model Size:
Epochs (Log Scale) Test Error

Sample Non-Monotonicity: When More Data Hurts

Perhaps the most counter-intuitive finding in the paper is that increasing training data can actually degrade test performance. This occurs because adding more data shifts the interpolation threshold to the right.

If a model is safely in the over-parameterized regime for a small dataset, increasing the dataset size might shift the "critical regime" directly onto that model's capacity, causing its performance to plummet.

Interactive Widget 3: The Shifting Peak

Use the slider to see how changing the sample size ($n$) shifts the test error peak. Select a fixed model size and observe how increasing data from $10\text{k}$ to $40\text{k}$ can actually increase test error.

Key Takeaway

Notice how the peak of the curve (the critical regime) moves to the right as you add more samples. A model of size 30 performs better with 10k samples than with 30k samples!

Model Size Test Error 10k samples (baseline) Current sample size

Headline Results

The authors demonstrated these phenomena across multiple architectures, datasets, and optimization algorithms. Below are the key empirical findings:

CIFAR-10 (ResNet18)
15% Label Noise

Produces a highly pronounced test error peak at width $k \approx 10$ before falling continuously to standard ResNet18 performance.

IWSLT'14 (Transformer)
4.5x Sample Gap

Language translation models trained on 18k samples performed worse than those trained on 4k samples in the critical size regime.

Noiseless Settings
Plateau to Peak

Even without explicit label noise, model mis-specification acts as a proxy, creating visible plateaus or peaks in test error.

Limitations & Open Questions

While the paper presents robust empirical evidence, several theoretical and practical questions remain open:

  • Early Stopping Nuances: Optimal early stopping can mitigate or entirely eliminate the double-descent peak. However, early stopping requires a validation set and careful tuning, and in some highly noisy regimes, training to completion still yields the best overall performance.
  • Defining "Natural" Distributions: The Generalized Hypothesis relies on "natural data distributions" and "natural training procedures." A formal, mathematical definition of what makes a distribution or algorithm "natural" is still lacking.
  • Exact Width of the Critical Regime: The width and shape of the critical interval depend on the data distribution, label noise, and architecture in ways that are not yet fully understood or analytically predictable.

Glossary

Effective Model Complexity (EMC)

A measure of the capacity of a training procedure to fit a dataset. Specifically, the maximum number of samples on which the training procedure can achieve near-zero training error.

Interpolation Threshold

The point where the Effective Model Complexity exactly equals the number of training samples ($n$). At this threshold, the model is barely able to fit the training data, often leading to a spike in test error.

Model Mis-specification

A discrepancy between the true data-generating process and the family of models being trained. The authors argue that label noise is simply a proxy for increasing model mis-specification.

Cite This Work

@article{nakkiran2019deep,
  title={Deep Double Descent: Where Bigger Models and More Data Hurt},
  author={Nakkiran, Preetum and Kaplun, Gal and Bansal, Yamini and Yang, Tristan and Barak, Boaz and Sutskever, Ilya},
  journal={arXiv preprint arXiv:1912.02292},
  year={2019}
}
Made with Flash Papers — make your own