All labs

Overparameterized and Still Improving

Push past the interpolation threshold and watch test error fall a second time.

Ch 14 14.8
Misconception
Deep Learning
22 mindifficulty 5/5

Controls

25
0.300
200

Sweep runs from p=2 up to this many random features.

0

λ = 0 is ridgeless (minimum-norm interpolation).

6
Feature type
25

interpolation threshold (p = n)

Random seed

Every result on this page is a deterministic function of the seed and the controls.

Train and test risk vs. p / n

log₁₀(MSE). The dashed vertical line marks the interpolation threshold p = n.

-2-1.50-1-0.50002468p = nnoise floorp / nlog₁₀(MSE)
train risktest riskp = n thresholdirreducible noise floor

Minimum-norm coefficient size

||β|| spikes exactly where the fit first interpolates.

-101202468p = np / nlog₁₀(‖β‖)

Fitted function at p = 25

interpolation threshold (p = n)

-2-101-2-1012xy
true f(x)fitted functiontraining points
Peak location
p/n = 0.08
p = 2
Test risk at p = n
0.4826
the interpolation spike
Test risk at p = p_max
0.3723
second descent
‖β‖ at p = n
164.624
vs. ‖β‖ at p_max = 339.297
Two descents, one curve

Test risk falls as p grows from far below n (classical regime), spikes to its worst value near p = n where the fit exactly interpolates n noisy points with the least possible slack, then falls a second time as p keeps growing past n — because among the infinitely many interpolating solutions, the minimum-norm one gets smoother as there is more room to spread the fit thinly.