Context. Deep networks fit noisy data exactly, still predict well, and show "double descent" in model size (Belkin et al. 2018). The authors compute the exact risk of the minimum-ℓ2-norm interpolator and of ridge with p/n→γ, for general Σ and β, misspecified models, and random nonlinear features. The analysis shows that, as p/n→γ, the min-norm interpolator acts like ridge regression on the population covariance with an implicit penalty τ fixed by TrΣ(Σ+τ)−1=n (this effective-ridge form is a rewriting of the paper's c0 formulas, with τ=1/(γc0)). Directions with eigenvalue well above τ are learned and weaker ones are lost to bias, and a factor 1/(1−ν), ν=n1TrΣ2(Σ+τ)−2, inflates both bias and variance; it diverges at p=n and shrinks as p grows. Overparametrization can lower the risk when β sits in a few strong directions and many weak directions supply the implicit penalty.
Setting.yi=xiTβ+εi with Varεi=σ2 and xi=Σ1/2zi, zi with independent coordinates of mean 0 and variance 1. The estimators are the min-norm interpolator β^=(XTX)+XTy=limλ→0+β^λ (also the limit of gradient descent from 0) and ridge β^λ=(XTX+nλI)−1XTy. With SX=XTX/n and Π the projection onto the null space of X, the conditional risk E[∥β^−β∥Σ2∣X] splits as
BX(β^)=βTΠΣΠβ,VX(β^)=nσ2Tr(SX+Σ),BX(β^λ)=λ2βT(SX+λ)−1Σ(SX+λ)−1β,VX(β^λ)=nσ2TrΣSX(SX+λ)−2.
The geometry enters through the eigenvalue distribution H^n of Σ and its β-weighted version G^n. Assumption 1: all moments of zij bounded, ∥Σ∥≤M and ∫s−1dH^n<M, and p/n in [1/M,M] with ∣1−p/n∣≥1/M.
Proposition 2 and Theorem 1 (isotropic). If γ<1, λmin(Σ)≥c>0 and z has four moments, RX→σ2γ/(1−γ) almost surely for every Σ and β, so the risk is all variance. If Σ=I, 4+η moments and ∥β∥2=r2, then for γ>1BX→r2(1−γ1),VX→γ−1σ2.
With SNR=r2/σ2>1, on γ>1 the risk is below the null risk r2 exactly when γ>SNR/(SNR−1), with a local minimum at γ=SNR/(SNR−1), but the global minimum is always at γ→0.
Theorem 2 (general Σ, min-norm). Let τ solve n1TrΣ(Σ+τ)−1=1, ν=n1TrΣ2(Σ+τ)−2, and
B=1−ντ2βTΣ(Σ+τ)−2β,V=σ21−νν.
This rewrites the paper's (11) and (12) via τ=1/(γc0), with c0 the paper's fixed point (checked algebraically and numerically). Under Assumption 1 and λmin(Σ)>1/M, with probability at least 1−Cn−D, ∣BX(β^)−B∣≤C∥β∥2n−1/7 and ∣VX(β^)−V∣≤Cn−1/7. Theorem 3 gives almost-sure limits under 4+δ moments. If G=H (e.g. β uniform on a sphere), B=r2τ/γ; for Σ=I, τ=γ−1.
Theorem 5 (general Σ, ridge). Let τ(λ)>0 solve τ=λ+nτTrΣ(Σ+τ)−1, so τ(0+) is the τ of Theorem 2, with ν(λ), B(λ), V(λ) as before at τ(λ) (a rewriting of the paper's (38) and (39) via τ(λ)=1/rn(−λ)). If Assumption 1 holds, λ∨λmin(Σ)>1/M and n−2/3+1/M<λ<M, then with probability 1−Cn−D∣BX(β^λ)−B(λ)∣≤λn(1−ε)/2C∥β∥2,∣VX(β^λ)−V(λ)∣≤λ2n(1−ε)/2C.
For Σ=I the optimal penalty is λ∗=σ2γ/r2, tuned ridge beats min-norm at every γ, and leave-one-out CV and GCV find it.
Theorem 4 (misspecified, isotropic). If y=xTβ+wTθ+ε but only x is observed, with i.i.d. entries of (x,w) (8+η moments), r2=∥β∥2+∥θ∥2 and κ=∥β∥2/r2, then for γ>1RX→r2(1−κ)+r2κ(1−γ1)+(r2(1−κ)+σ2)γ−11,
and for γ<1 the first and last terms with 1−γγ: irreducible bias, null-space bias, and variance in which the omitted signal acts as extra noise. If 1−κ(γ)=(1+γ)−a with SNR>1 and a≤1+1/SNR, the global minimum is at some γ>1.
Corollary 4 (latent space model).yi=θTzi+ξi and xij=wjTzi+uij, with zi∼N(0,Id), noise u, and WTW=(p/d)Id. Matching second moments gives a linear model with
Σ=Ip+WWT,β=W(I+WTW)−1θ,σ2=σξ2+θT(I+WTW)−1θ,
so β lies in the top eigenspace 1+1/ψ, ψ=d/p∈(0,1), and Theorem 2 gives the risk in closed form. At fixed n/d the paper's plots show the risk smallest as γ→∞ and the optimal ridge λ tending to 0 even with σξ>0 (observed, not proved).
Theorem 8 (nonlinear random features). Let xi=φ(Wzi), zi∼N(0,Id), Wij∼N(0,1/d), with Eφ(G)=0, Eφ(G)2=1 and E[Gφ(G)]=0 (a "purely nonlinear" activation), p/n→γ, d/p→ψ∈(0,1). Then
λ→0+limn,p,dlimVX(β^λ)=γ−1σ2(γ>1),λ→0+limn,p,dlimEβBX(β^λ)=r2(1−γ1)+,
with the bias averaged over an isotropic prior. These are exactly the isotropic linear answers, although each xi is a function of only d≪p Gaussians.
Step 1
Bias and variance are derivatives of single resolvents. Local laws control one resolvent, so rewrite both terms that way:
BX(β^λ)=−∂ηFˉn(0,λ),Fˉn(η,λ)=λ⟨β,(SX+λI+ληΣ)−1β⟩,VX(β^λ)=σ2γ∂λ[pλTrΣ(SX+λ)−1].
The bias has two resolvents but is the η-derivative of a one-resolvent quadratic form; the variance is the λ-derivative of a normalized trace.
Step 2
For γ<1 there is no bias and Σ cancels (Proposition 2). Bai-Yin keeps λmin(ZTZ/n) away from 0, so Π=0, and with X=ZΣ1/2, VX=nσ2Tr(ZTZ/n)−1→σ2γ/(1−γ), the mean inverse eigenvalue of the Marchenko-Pastur law. The peak at γ→1 is the lower edge (1−γ)2 reaching 0.
Step 3
Isotropic γ>1: the variance by duality, the bias as the Marchenko-Pastur atom at zero (Theorem 1). On the n×n side the aspect ratio is 1/γ<1, and Step 2 gives VX→σ2/(γ−1). For the bias, BX=limz→0+zβT(Σ^+z)−1β; at fixed z the Rubio-Mestre generalized Marchenko-Pastur law gives r2zm(−z), and Bai-Yin on the smallest nonzero eigenvalue makes the convergence uniform, so the limits commute and BX→r2(1−1/γ), the mass of the atom at 0. This self-contained proof assumes 8+δ moments; the 4+η statement follows from Theorem 3.
Step 4
The effective penalty is well defined and smooth uniformly in n (Lemma 6). Steps 7 and 8 need bounded derivatives of τ in λ and in a deformation η. A substitution reduces the deformed fixed point u(λ,η) to the η=0 equation with si↦si/(1+ηsi), whose right side is monotone, so the root is unique; the implicit function theorem gives ∂λx=[1−n1∑si2/(si+x)2]−1, and the main estimate is a uniform lower bound on that bracket, which for p>n comes from convexity and the p/M eigenvalues above 1/M.
Step 5
Deforming Σ by η turns the two-resolvent bias into one resolvent of another sample covariance. Since Σ and I+ηΣ commute,
SX+λ(I+ηΣ)=(I+ηΣ)1/2[Ση1/2SZΣη1/2+λ](I+ηΣ)1/2,Ση=Σ(I+ηΣ)−1,
so Fˉn is a resolvent matrix element, at −λ, of a sample covariance with population eigenvalues si/(1+ηsi), against βη=(I+ηΣ)−1/2β.
Step 6
The anisotropic local law puts Fˉn within n−(1−ε)/2/λ of a deterministic Fn. The Knowles-Yin law (all moments of z) puts matrix elements of λ(Ση1/2SZΣη1/2+λ)−1 close to those of (I+rnΣη)−1, rn the companion fixed point, to within n−1+εImrn/Im(−λ); since rn is a Stieltjes transform, Imrn(−λ)≤∣Imλ∣/(Reλ)2, so letting Imλ→0 leaves an error n−(1−ε)/2/λ. On the real axis
Fn(η,λ)=u⟨β,(uI+Σ)−1β⟩,
with u the root of Step 4.
Step 7
Close values give close η-derivatives, and the derivative of Fn is the predicted bias. Complex η makes Ση non-Hermitian, so the law holds only for real η and Cauchy estimates are unavailable; instead, a central-difference stencil (Lemma 5) gives
∣f′−g′∣≤δC1,k∥f−g∥∞+C2,k∥f(2k+1)−g(2k+1)∥∞δ2k.
Both functions have bounded derivatives (Fˉn through R=(SX+λ+ληΣ)−1, with ∥R∥≤2/λ for η>−1/(2M); Fn through Step 4), so a suitable δ and k make the derivatives agree to C/(λn(1−2ε)/2). Differentiating Step 4's equation gives u′(1−ν)=−τ2, so −∂ηFn=B(λ), and this is the source of the factor 1/(1−ν) in the bias.
Step 8
The variance needs only a normalized trace, so the bound holds for complex λ and Cauchy's formula gives its derivatives (completing Theorem 5). The averaged local law gives pλTrΣ(SX+λ)−1−p1TrΣτ(τ+Σ)−1≤1/(∣Reλ∣n(1−ε)/2) uniformly over complex λ. Both sides are analytic, so Cauchy's formula on a disk of radius comparable to Reλ transfers the bound to λ-derivatives with one more factor 1/Reλ, and τ′=1/(1−ν) turns the derivative into V(λ).
Step 9
Min-norm is ridge at λ=n−1/7 (Theorem 2). The ridgeless gap is O(λ), balanced against local-law errors that grow as λ→0: the gap in BX1/2 is at most Mλ over the smallest nonzero eigenvalue of SX, which is at least sp times that of SZ, and Bai-Yin (needing ∣γ−1∣≥1/M) bounds the latter; this is the step that uses λmin(Σ)>1/M. The variance gap is similar, and on the deterministic side the fixed point is Lipschitz in λ by the implicit function theorem. The total error C(λ+λ−2n−(1−ε)/2) is O(n−1/7) at λ=n−1/7; the rate is not optimized, and a CLT heuristic suggests n−1/2.
Step 10
Four moments suffice asymptotically, by truncation (Theorems 3 and 6). At fixed λ>0 the risk is Lipschitz in (SX,Σ), so truncating the entries and rescaling changes it little (Bai-Yin bounds the remainder); the truncated design has all moments, Theorem 5 and Borel-Cantelli apply, and the truncation level goes to infinity by continuity of the formulas.
Step 11
The misspecified and latent models reduce to linear models (Corollaries 2, 4, Theorem 4). For misspecification, the tower property splits off the irreducible r2(1−κ), and with independent isotropic (x,w) the omitted wTθ is pure noise, so Theorem 1 with r2↦r2κ and σ2↦σ2+r2(1−κ) gives Theorem 4. For the latent model, Cov(x,y)=Wθ, and push-through and Woodbury give β and σ2.
Step 12 (idea only)
Purely nonlinear random features have the Marchenko-Pastur resolvent, and their covariance is within polylog of the identity in Frobenius norm (Theorem 8). Leave-one-out on a linearized block matrix gives fixed-point equations for its block traces: a Schur complement on the last row, with φ split into its linear part (coefficient →c1=(EGφ(G))2) and the rest, leaves a matrix independent of the new row up to a rank-2 perturbation and a (logn)C/n error, and Woodbury gives equations that at c1=0 are the i.i.d. ones. On the population side, the Hermite expansion E[φ(G1)φ(G2)]=∑kλk2ρk with λ0=λ1=0 gives ∥E[xxT∣W]−I∥F≤(logn)C, which suffices because the variance changes by at most γ/nλ−1∥Σ−I∥F. The limits are then read off the atom of Σ^ at zero, of mass (γ−1)+.
Consequences and limits. The limits are exact and two-sided, so the risk curves are determined exactly: the peak at γ=1 is the divergence of 1/(1−ν), and the second descent is the variance falling as τ grows with p. With isotropic or equidistributed β in a well-specified model, overparametrization never beats γ→0, and tuned ridge dominates min-norm. Interpolation is near-optimal when the spectrum is spiked plus bulk with β in the spikes: the weak directions add roughly γIn to XXT/n, an implicit ridge, while the spike 1+p/d grows as fast as τ, so in the paper's plots the risk keeps falling in γ and the best λ tends to 0 (compare the effective ranks of Bartlett et al.). Misspecification is a second route past γ=1. Limits: p/n stays bounded away from 0, 1 and ∞, so nothing here is about consistency; the min-norm bounds need λmin(Σ)>1/M, ruling out the decaying spectra of benign overfitting; the nonlinear result covers only c1=0, takes n→∞ before λ→0, and averages the bias over a prior; and fixed features link to neural networks only in the lazy regime.
Terms
Min-norm interpolator
β^=(XTX)+XTy=limλ→0+β^λ; also the limit of gradient descent from 0
BX,VX
βTΠΣΠβ and nσ2TrΣ^+Σ; Π projects onto the null space of X
H^n,G^n
spectrum of Σ, and the same spectrum weighted by ⟨β,vi⟩2/∥β∥2
c0 and τ=1/(γc0)
implicit penalty of min-norm: TrΣ(Σ+τ)−1=n; isotropic τ=γ−1
ν=n1TrΣ2(Σ+τ)−2; variance =σ2ν/(1−ν), and 1/(1−ν) also inflates the bias
Null risk
r2=∥β∥2, the risk of predicting 0; isotropic min-norm tends to it as γ→∞
κ (misspecified)
fraction ∥β∥2/r2 of the signal carried by observed features; the rest is bias r2(1−κ) plus extra noise
Anisotropic local law
Knowles-Yin: λ⟨u,(Σ^+λ)−1v⟩≈⟨u,(I+rnΣ)−1v⟩ with error n−1/2+ε/λ
Purely nonlinear φ
Eφ(G)=EGφ(G)=0, so c1=0 and φ(Wz) features behave like i.i.d. isotropic ones
Quiz
The variance derivative in λ is handled by analyticity, but the bias derivative in η needs the finite-difference Lemma 5 with bounds on 2k+1 derivatives. Why the difference?
Local laws allow a complex spectral parameter but need a Hermitian population matrix, so in λ Cauchy's formula gives derivatives. In η closeness holds only on the real line, so derivatives come from a polynomial-exact stencil plus higher-derivative bounds.
In the latent model x=Wz+u, y=θTz+ξ, the min-norm risk keeps falling as γ→∞ at fixed n/d, and the optimal ridge penalty tends to 0. Which explanation matches the formulas?
At fixed n/d=δ, τ≈aγ and the spike carrying β is about δγ, so the signal is shrunk by a fixed factor a/(δ+a) while the bulk's share of ν decays like 1/γ. The noisy features supply the implicit ridge; the risk does not go to zero, so this is not low-dimensional consistency.
In Theorem 8 (features φ(Wz) with d<p), what does the condition E[Gφ(G)]=0 do?
By the Hermite expansion E[xixj∣W]=∑kλk2⟨wi,wj⟩k, and λ1=0 removes the term that carries the rank-d structure of W. The coordinates stay dependent, but the Schur-complement fixed point loses its ψ terms and becomes the Marchenko-Pastur system.
By Theorem 2 in ridge form, which quantity decides whether the min-norm interpolator learns the component of β along an eigenvector vi of Σ?
The bias τ2βTΣ(Σ+τ)−2β/(1−ν) leaves a fraction τ/(si+τ) of the component along vi, so directions with si≫τ are learned and those with si≪τ are lost. The random row space gives a smooth constraint (effective degrees of freedom equal n) in place of a cutoff at index n.