Sam Babichenko

Reading notes / Benign overfitting

Surprises in High-Dimensional Ridgeless Least Squares Interpolation

Hastie, Montanari, Rosset and Tibshirani, 2022

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\ell_2-norm interpolator and of ridge with p/n→γp/n\to\gamma, for general Σ\Sigma and β\beta, misspecified models, and random nonlinear features. The analysis shows that, as p/n→γp/n\to\gamma, the min-norm interpolator acts like ridge regression on the population covariance with an implicit penalty τ\tau fixed by Tr⁡Σ(Σ+τ)−1=n\operatorname{Tr}\Sigma(\Sigma+\tau)^{-1}=n (this effective-ridge form is a rewriting of the paper's c0c_0 formulas, with τ=1/(γc0)\tau=1/(\gamma c_0)). Directions with eigenvalue well above τ\tau are learned and weaker ones are lost to bias, and a factor 1/(1−ν)1/(1-\nu), ν=1nTr⁡Σ2(Σ+τ)−2\nu=\tfrac1n\operatorname{Tr}\Sigma^2(\Sigma+\tau)^{-2}, inflates both bias and variance; it diverges at p=np=n and shrinks as pp grows. Overparametrization can lower the risk when β\beta sits in a few strong directions and many weak directions supply the implicit penalty.

Setting. yi=xiTβ+εiy_i=x_i^T\beta+\varepsilon_i with Var⁡εi=σ2\operatorname{Var}\varepsilon_i=\sigma^2 and xi=Σ1/2zix_i=\Sigma^{1/2}z_i, ziz_i with independent coordinates of mean 0 and variance 1. The estimators are the min-norm interpolator β^=(XTX)+XTy=lim⁡λ→0+β^λ\hat\beta=(X^TX)^+X^Ty=\lim_{\lambda\to0^+}\hat\beta_\lambda (also the limit of gradient descent from 0) and ridge β^λ=(XTX+nλI)−1XTy\hat\beta_\lambda=(X^TX+n\lambda I)^{-1}X^Ty. With SX=XTX/nS_X=X^TX/n and Π\Pi the projection onto the null space of XX, the conditional risk E[∥β^−β∥Σ2∣X]\mathbb E[\|\hat\beta-\beta\|_\Sigma^2\mid X] splits as BX(β^)=βTΠΣΠβ,VX(β^)=σ2nTr⁡(SX+Σ),BX(β^λ)=λ2βT(SX+λ)−1Σ(SX+λ)−1β,VX(β^λ)=σ2nTr⁡ΣSX(SX+λ)−2.B_X(\hat\beta)=\beta^T\Pi\Sigma\Pi\beta,\quad V_X(\hat\beta)=\tfrac{\sigma^2}{n}\operatorname{Tr}(S_X^+\Sigma),\quad B_X(\hat\beta_\lambda)=\lambda^2\beta^T(S_X+\lambda)^{-1}\Sigma(S_X+\lambda)^{-1}\beta,\quad V_X(\hat\beta_\lambda)=\tfrac{\sigma^2}{n}\operatorname{Tr}\Sigma S_X(S_X+\lambda)^{-2}. The geometry enters through the eigenvalue distribution H^n\hat H_n of Σ\Sigma and its β\beta-weighted version G^n\hat G_n. Assumption 1: all moments of zijz_{ij} bounded, ∥Σ∥≤M\|\Sigma\|\le M and ∫s−1dH^n<M\int s^{-1}d\hat H_n<M, and p/np/n in [1/M,M][1/M,M] with ∣1−p/n∣≥1/M|1-p/n|\ge1/M.

Proposition 2 and Theorem 1 (isotropic). If γ<1\gamma<1, λmin⁡(Σ)≥c>0\lambda_{\min}(\Sigma)\ge c>0 and zz has four moments, RX→σ2γ/(1−γ)R_X\to\sigma^2\gamma/(1-\gamma) almost surely for every Σ\Sigma and β\beta, so the risk is all variance. If Σ=I\Sigma=I, 4+η4+\eta moments and ∥β∥2=r2\|\beta\|^2=r^2, then for γ>1\gamma>1 BX→r2(1−1γ),VX→σ2γ−1.B_X\to r^2\Big(1-\frac1\gamma\Big),\qquad V_X\to\frac{\sigma^2}{\gamma-1}. With SNR=r2/σ2>1\mathrm{SNR}=r^2/\sigma^2\gt1, on γ>1\gamma>1 the risk is below the null risk r2r^2 exactly when γ>SNR/(SNR−1)\gamma>\mathrm{SNR}/(\mathrm{SNR}-1), with a local minimum at γ=SNR/(SNR−1)\gamma=\sqrt{\mathrm{SNR}}/(\sqrt{\mathrm{SNR}}-1), but the global minimum is always at γ→0\gamma\to0.

Theorem 2 (general Σ\Sigma, min-norm). Let τ\tau solve 1nTr⁡Σ(Σ+τ)−1=1\frac1n\operatorname{Tr}\Sigma(\Sigma+\tau)^{-1}=1, ν=1nTr⁡Σ2(Σ+τ)−2\nu=\frac1n\operatorname{Tr}\Sigma^2(\Sigma+\tau)^{-2}, and B=τ2 βTΣ(Σ+τ)−2β1−ν,V=σ2ν1−ν.\mathcal B=\frac{\tau^2\,\beta^T\Sigma(\Sigma+\tau)^{-2}\beta}{1-\nu},\qquad \mathcal V=\sigma^2\frac{\nu}{1-\nu}. This rewrites the paper's (11) and (12) via τ=1/(γc0)\tau=1/(\gamma c_0), with c0c_0 the paper's fixed point (checked algebraically and numerically). Under Assumption 1 and λmin⁡(Σ)>1/M\lambda_{\min}(\Sigma)>1/M, with probability at least 1−Cn−D1-Cn^{-D}, ∣BX(β^)−B∣≤C∥β∥2n−1/7|B_X(\hat\beta)-\mathcal B|\le C\|\beta\|^2n^{-1/7} and ∣VX(β^)−V∣≤Cn−1/7|V_X(\hat\beta)-\mathcal V|\le Cn^{-1/7}. Theorem 3 gives almost-sure limits under 4+δ4+\delta moments. If G=HG=H (e.g. β\beta uniform on a sphere), B=r2τ/γ\mathcal B=r^2\tau/\gamma; for Σ=I\Sigma=I, τ=γ−1\tau=\gamma-1.

Theorem 5 (general Σ\Sigma, ridge). Let τ(λ)>0\tau(\lambda)>0 solve τ=λ+τnTr⁡Σ(Σ+τ)−1\tau=\lambda+\frac{\tau}{n}\operatorname{Tr}\Sigma(\Sigma+\tau)^{-1}, so τ(0+)\tau(0^+) is the τ\tau of Theorem 2, with ν(λ)\nu(\lambda), B(λ)\mathcal B(\lambda), V(λ)\mathcal V(\lambda) as before at τ(λ)\tau(\lambda) (a rewriting of the paper's (38) and (39) via τ(λ)=1/rn(−λ)\tau(\lambda)=1/r_n(-\lambda)). If Assumption 1 holds, λ∨λmin⁡(Σ)>1/M\lambda\vee\lambda_{\min}(\Sigma)>1/M and n−2/3+1/M<λ<Mn^{-2/3+1/M}<\lambda<M, then with probability 1−Cn−D1-Cn^{-D} ∣BX(β^λ)−B(λ)∣≤C∥β∥2λn(1−ε)/2,∣VX(β^λ)−V(λ)∣≤Cλ2n(1−ε)/2.|B_X(\hat\beta_\lambda)-\mathcal B(\lambda)|\le\frac{C\|\beta\|^2}{\lambda n^{(1-\varepsilon)/2}},\qquad |V_X(\hat\beta_\lambda)-\mathcal V(\lambda)|\le\frac{C}{\lambda^2n^{(1-\varepsilon)/2}}. For Σ=I\Sigma=I the optimal penalty is λ∗=σ2γ/r2\lambda^*=\sigma^2\gamma/r^2, tuned ridge beats min-norm at every γ\gamma, and leave-one-out CV and GCV find it.

Theorem 4 (misspecified, isotropic). If y=xTβ+wTθ+εy=x^T\beta+w^T\theta+\varepsilon but only xx is observed, with i.i.d. entries of (x,w)(x,w) (8+η8+\eta moments), r2=∥β∥2+∥θ∥2r^2=\|\beta\|^2+\|\theta\|^2 and κ=∥β∥2/r2\kappa=\|\beta\|^2/r^2, then for γ>1\gamma>1 RX→r2(1−κ)+r2κ(1−1γ)+(r2(1−κ)+σ2)1γ−1,R_X\to r^2(1-\kappa)+r^2\kappa\Big(1-\frac1\gamma\Big)+\big(r^2(1-\kappa)+\sigma^2\big)\frac{1}{\gamma-1}, and for γ<1\gamma<1 the first and last terms with γ1−γ\frac{\gamma}{1-\gamma}: irreducible bias, null-space bias, and variance in which the omitted signal acts as extra noise. If 1−κ(γ)=(1+γ)−a1-\kappa(\gamma)=(1+\gamma)^{-a} with SNR>1\mathrm{SNR}>1 and a≤1+1/SNRa\le1+1/\mathrm{SNR}, the global minimum is at some γ>1\gamma>1.

Corollary 4 (latent space model). yi=θTzi+ξiy_i=\theta^Tz_i+\xi_i and xij=wjTzi+uijx_{ij}=w_j^Tz_i+u_{ij}, with zi∼N(0,Id)z_i\sim N(0,I_d), noise uu, and WTW=(p/d)IdW^TW=(p/d)I_d. Matching second moments gives a linear model with Σ=Ip+WWT,β=W(I+WTW)−1θ,σ2=σξ2+θT(I+WTW)−1θ,\Sigma=I_p+WW^T,\quad\beta=W(I+W^TW)^{-1}\theta,\quad\sigma^2=\sigma_\xi^2+\theta^T(I+W^TW)^{-1}\theta, so β\beta lies in the top eigenspace 1+1/ψ1+1/\psi, ψ=d/p∈(0,1)\psi=d/p\in(0,1), and Theorem 2 gives the risk in closed form. At fixed n/dn/d the paper's plots show the risk smallest as γ→∞\gamma\to\infty and the optimal ridge λ\lambda tending to 0 even with σξ>0\sigma_\xi>0 (observed, not proved).

Theorem 8 (nonlinear random features). Let xi=φ(Wzi)x_i=\varphi(Wz_i), zi∼N(0,Id)z_i\sim N(0,I_d), Wij∼N(0,1/d)W_{ij}\sim N(0,1/d), with Eφ(G)=0\mathbb E\varphi(G)=0, Eφ(G)2=1\mathbb E\varphi(G)^2=1 and E[Gφ(G)]=0\mathbb E[G\varphi(G)]=0 (a "purely nonlinear" activation), p/n→γp/n\to\gamma, d/p→ψ∈(0,1)d/p\to\psi\in(0,1). Then lim⁡λ→0+lim⁡n,p,dVX(β^λ)=σ2γ−1 (γ>1),lim⁡λ→0+lim⁡n,p,dEβBX(β^λ)=r2(1−1γ)+,\lim_{\lambda\to0^+}\lim_{n,p,d}V_X(\hat\beta_\lambda)=\frac{\sigma^2}{\gamma-1}\ (\gamma>1),\qquad \lim_{\lambda\to0^+}\lim_{n,p,d}\mathbb E_\beta B_X(\hat\beta_\lambda)=r^2\Big(1-\frac1\gamma\Big)_+, with the bias averaged over an isotropic prior. These are exactly the isotropic linear answers, although each xix_i is a function of only d≪pd\ll 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γ ∂λ[λpTr⁡Σ(SX+λ)−1].B_X(\hat\beta_\lambda)=-\partial_\eta\bar F_n(0,\lambda),\quad \bar F_n(\eta,\lambda)=\lambda\langle\beta,(S_X+\lambda I+\lambda\eta\Sigma)^{-1}\beta\rangle,\qquad V_X(\hat\beta_\lambda)=\sigma^2\gamma\,\partial_\lambda\Big[\tfrac{\lambda}{p}\operatorname{Tr}\Sigma(S_X+\lambda)^{-1}\Big]. The bias has two resolvents but is the η\eta-derivative of a one-resolvent quadratic form; the variance is the λ\lambda-derivative of a normalized trace.

Step 2

For γ<1\gamma<1 there is no bias and Σ\Sigma cancels (Proposition 2). Bai-Yin keeps λmin⁡(ZTZ/n)\lambda_{\min}(Z^TZ/n) away from 0, so Π=0\Pi=0, and with X=ZΣ1/2X=Z\Sigma^{1/2}, VX=σ2nTr⁡(ZTZ/n)−1→σ2γ/(1−γ)V_X=\tfrac{\sigma^2}{n}\operatorname{Tr}(Z^TZ/n)^{-1}\to\sigma^2\gamma/(1-\gamma), the mean inverse eigenvalue of the Marchenko-Pastur law. The peak at γ→1\gamma\to1 is the lower edge (1−γ)2(1-\sqrt\gamma)^2 reaching 0.

Step 3

Isotropic γ>1\gamma>1: the variance by duality, the bias as the Marchenko-Pastur atom at zero (Theorem 1). On the n×nn\times n side the aspect ratio is 1/γ<11/\gamma<1, and Step 2 gives VX→σ2/(γ−1)V_X\to\sigma^2/(\gamma-1). For the bias, BX=lim⁡z→0+zβT(Σ^+z)−1βB_X=\lim_{z\to0^+}z\beta^T(\hat\Sigma+z)^{-1}\beta; at fixed zz the Rubio-Mestre generalized Marchenko-Pastur law gives r2zm(−z)r^2zm(-z), and Bai-Yin on the smallest nonzero eigenvalue makes the convergence uniform, so the limits commute and BX→r2(1−1/γ)B_X\to r^2(1-1/\gamma), the mass of the atom at 0. This self-contained proof assumes 8+δ8+\delta moments; the 4+η4+\eta statement follows from Theorem 3.

Step 4

The effective penalty is well defined and smooth uniformly in nn (Lemma 6). Steps 7 and 8 need bounded derivatives of τ\tau in λ\lambda and in a deformation η\eta. A substitution reduces the deformed fixed point u(λ,η)u(\lambda,\eta) to the η=0\eta=0 equation with si↦si/(1+ηsi)s_i\mapsto s_i/(1+\eta s_i), whose right side is monotone, so the root is unique; the implicit function theorem gives ∂λx=[1−1n∑si2/(si+x)2]−1\partial_\lambda x=[1-\frac1n\sum s_i^2/(s_i+x)^2]^{-1}, and the main estimate is a uniform lower bound on that bracket, which for p>np>n comes from convexity and the p/Mp/M eigenvalues above 1/M1/M.

Step 5

Deforming Σ\Sigma by η\eta turns the two-resolvent bias into one resolvent of another sample covariance. Since Σ\Sigma and I+ηΣI+\eta\Sigma commute, SX+λ(I+ηΣ)=(I+ηΣ)1/2[Ση1/2SZΣη1/2+λ](I+ηΣ)1/2,Ση=Σ(I+ηΣ)−1,S_X+\lambda(I+\eta\Sigma)=(I+\eta\Sigma)^{1/2}\big[\Sigma_\eta^{1/2}S_Z\Sigma_\eta^{1/2}+\lambda\big](I+\eta\Sigma)^{1/2},\qquad\Sigma_\eta=\Sigma(I+\eta\Sigma)^{-1}, so Fˉn\bar F_n is a resolvent matrix element, at −λ-\lambda, of a sample covariance with population eigenvalues si/(1+ηsi)s_i/(1+\eta s_i), against βη=(I+ηΣ)−1/2β\beta_\eta=(I+\eta\Sigma)^{-1/2}\beta.

Step 6

The anisotropic local law puts Fˉn\bar F_n within n−(1−ε)/2/λn^{-(1-\varepsilon)/2}/\lambda of a deterministic FnF_n. The Knowles-Yin law (all moments of zz) puts matrix elements of λ(Ση1/2SZΣη1/2+λ)−1\lambda(\Sigma_\eta^{1/2}S_Z\Sigma_\eta^{1/2}+\lambda)^{-1} close to those of (I+rnΣη)−1(I+r_n\Sigma_\eta)^{-1}, rnr_n the companion fixed point, to within n−1+εIm⁡rn/Im⁡(−λ)\sqrt{n^{-1+\varepsilon}\operatorname{Im}r_n/\operatorname{Im}(-\lambda)}; since rnr_n is a Stieltjes transform, Im⁡rn(−λ)≤∣Im⁡λ∣/(Re⁡λ)2\operatorname{Im}r_n(-\lambda)\le|\operatorname{Im}\lambda|/(\operatorname{Re}\lambda)^2, so letting Im⁡λ→0\operatorname{Im}\lambda\to0 leaves an error n−(1−ε)/2/λn^{-(1-\varepsilon)/2}/\lambda. On the real axis Fn(η,λ)=u ⟨β,(uI+Σ)−1β⟩,F_n(\eta,\lambda)=u\,\langle\beta,(uI+\Sigma)^{-1}\beta\rangle, with uu the root of Step 4.

Step 7

Close values give close η\eta-derivatives, and the derivative of FnF_n is the predicted bias. Complex η\eta makes Ση\Sigma_\eta non-Hermitian, so the law holds only for real η\eta 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.|f'-g'|\le\frac{C_{1,k}}{\delta}\|f-g\|_\infty+C_{2,k}\|f^{(2k+1)}-g^{(2k+1)}\|_\infty\delta^{2k}. Both functions have bounded derivatives (Fˉn\bar F_n through R=(SX+λ+ληΣ)−1R=(S_X+\lambda+\lambda\eta\Sigma)^{-1}, with ∥R∥≤2/λ\|R\|\le2/\lambda for η>−1/(2M)\eta>-1/(2M); FnF_n through Step 4), so a suitable δ\delta and kk make the derivatives agree to C/(λn(1−2ε)/2)C/(\lambda n^{(1-2\varepsilon)/2}). Differentiating Step 4's equation gives u′(1−ν)=−τ2u'(1-\nu)=-\tau^2, so −∂ηFn=B(λ)-\partial_\eta F_n=\mathcal B(\lambda), and this is the source of the factor 1/(1−ν)1/(1-\nu) in the bias.

Step 8

The variance needs only a normalized trace, so the bound holds for complex λ\lambda and Cauchy's formula gives its derivatives (completing Theorem 5). The averaged local law gives ∣λpTr⁡Σ(SX+λ)−1−1pTr⁡Σ τ(τ+Σ)−1∣≤1/(∣Re⁡λ∣n(1−ε)/2)\big|\tfrac{\lambda}{p}\operatorname{Tr}\Sigma(S_X+\lambda)^{-1}-\tfrac1p\operatorname{Tr}\Sigma\,\tau(\tau+\Sigma)^{-1}\big|\le1/(|\operatorname{Re}\lambda|n^{(1-\varepsilon)/2}) uniformly over complex λ\lambda. Both sides are analytic, so Cauchy's formula on a disk of radius comparable to Re⁡λ\operatorname{Re}\lambda transfers the bound to λ\lambda-derivatives with one more factor 1/Re⁡λ1/\operatorname{Re}\lambda, and τ′=1/(1−ν)\tau'=1/(1-\nu) turns the derivative into V(λ)\mathcal V(\lambda).

Step 9

Min-norm is ridge at λ=n−1/7\lambda=n^{-1/7} (Theorem 2). The ridgeless gap is O(λ)O(\lambda), balanced against local-law errors that grow as λ→0\lambda\to0: the gap in BX1/2B_X^{1/2} is at most MλM\lambda over the smallest nonzero eigenvalue of SXS_X, which is at least sps_p times that of SZS_Z, and Bai-Yin (needing ∣γ−1∣≥1/M|\gamma-1|\ge1/M) bounds the latter; this is the step that uses λmin⁡(Σ)>1/M\lambda_{\min}(\Sigma)>1/M. The variance gap is similar, and on the deterministic side the fixed point is Lipschitz in λ\lambda by the implicit function theorem. The total error C(λ+λ−2n−(1−ε)/2)C(\lambda+\lambda^{-2}n^{-(1-\varepsilon)/2}) is O(n−1/7)O(n^{-1/7}) at λ=n−1/7\lambda=n^{-1/7}; the rate is not optimized, and a CLT heuristic suggests n−1/2n^{-1/2}.

Step 10

Four moments suffice asymptotically, by truncation (Theorems 3 and 6). At fixed λ>0\lambda>0 the risk is Lipschitz in (SX,Σ)(S_X,\Sigma), 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−κ)r^2(1-\kappa), and with independent isotropic (x,w)(x,w) the omitted wTθw^T\theta is pure noise, so Theorem 1 with r2↦r2κr^2\mapsto r^2\kappa and σ2↦σ2+r2(1−κ)\sigma^2\mapsto\sigma^2+r^2(1-\kappa) gives Theorem 4. For the latent model, Cov⁡(x,y)=Wθ\operatorname{Cov}(x,y)=W\theta, and push-through and Woodbury give β\beta and σ2\sigma^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 φ\varphi split into its linear part (coefficient →c1=(EGφ(G))2\to c_1=(\mathbb E G\varphi(G))^2) and the rest, leaves a matrix independent of the new row up to a rank-2 perturbation and a (log⁡n)C/n(\log n)^C/\sqrt n error, and Woodbury gives equations that at c1=0c_1=0 are the i.i.d. ones. On the population side, the Hermite expansion E[φ(G1)φ(G2)]=∑kλk2ρk\mathbb E[\varphi(G_1)\varphi(G_2)]=\sum_k\lambda_k^2\rho^k with λ0=λ1=0\lambda_0=\lambda_1=0 gives ∥E[xxT∣W]−I∥F≤(log⁡n)C\|\mathbb E[xx^T|W]-I\|_F\le(\log n)^C, which suffices because the variance changes by at most γ/n λ−1∥Σ−I∥F\sqrt{\gamma/n}\,\lambda^{-1}\|\Sigma-I\|_F. The limits are then read off the atom of Σ^\hat\Sigma at zero, of mass (γ−1)+(\gamma-1)_+.

Consequences and limits. The limits are exact and two-sided, so the risk curves are determined exactly: the peak at γ=1\gamma=1 is the divergence of 1/(1−ν)1/(1-\nu), and the second descent is the variance falling as τ\tau grows with pp. With isotropic or equidistributed β\beta in a well-specified model, overparametrization never beats γ→0\gamma\to0, and tuned ridge dominates min-norm. Interpolation is near-optimal when the spectrum is spiked plus bulk with β\beta in the spikes: the weak directions add roughly γIn\gamma I_n to XXT/nXX^T/n, an implicit ridge, while the spike 1+p/d1+p/d grows as fast as τ\tau, so in the paper's plots the risk keeps falling in γ\gamma and the best λ\lambda tends to 0 (compare the effective ranks of Bartlett et al.). Misspecification is a second route past γ=1\gamma=1. Limits: p/np/n stays bounded away from 0, 1 and ∞\infty, so nothing here is about consistency; the min-norm bounds need λmin⁡(Σ)>1/M\lambda_{\min}(\Sigma)>1/M, ruling out the decaying spectra of benign overfitting; the nonlinear result covers only c1=0c_1=0, takes n→∞n\to\infty before λ→0\lambda\to0, 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+β^λ\hat\beta=(X^TX)^+X^Ty=\lim_{\lambda\to0^+}\hat\beta_\lambda; also the limit of gradient descent from 0
BX, VXB_X,\ V_X
βTΠΣΠβ\beta^T\Pi\Sigma\Pi\beta and σ2nTr⁡Σ^+Σ\frac{\sigma^2}{n}\operatorname{Tr}\hat\Sigma^+\Sigma; Π\Pi projects onto the null space of XX
H^n, G^n\hat H_n,\ \hat G_n
spectrum of Σ\Sigma, and the same spectrum weighted by ⟨β,vi⟩2/∥β∥2\langle\beta,v_i\rangle^2/\|\beta\|^2
c0c_0 and τ=1/(γc0)\tau=1/(\gamma c_0)
implicit penalty of min-norm: Tr⁡Σ(Σ+τ)−1=n\operatorname{Tr}\Sigma(\Sigma+\tau)^{-1}=n; isotropic τ=γ−1\tau=\gamma-1
τ(λ)\tau(\lambda)
ridge's effective penalty: τ=λ+τnTr⁡Σ(Σ+τ)−1\tau=\lambda+\frac{\tau}{n}\operatorname{Tr}\Sigma(\Sigma+\tau)^{-1}; equals 1/rn(−λ)1/r_n(-\lambda)
ν\nu, 1/(1−ν)1/(1-\nu)
ν=1nTr⁡Σ2(Σ+τ)−2\nu=\frac1n\operatorname{Tr}\Sigma^2(\Sigma+\tau)^{-2}; variance =σ2ν/(1−ν)=\sigma^2\nu/(1-\nu), and 1/(1−ν)1/(1-\nu) also inflates the bias
Null risk
r2=∥β∥2r^2=\|\beta\|^2, the risk of predicting 0; isotropic min-norm tends to it as γ→∞\gamma\to\infty
κ\kappa (misspecified)
fraction ∥β∥2/r2\|\beta\|^2/r^2 of the signal carried by observed features; the rest is bias r2(1−κ)r^2(1-\kappa) plus extra noise
Anisotropic local law
Knowles-Yin: λ⟨u,(Σ^+λ)−1v⟩≈⟨u,(I+rnΣ)−1v⟩\lambda\langle u,(\hat\Sigma+\lambda)^{-1}v\rangle\approx\langle u,(I+r_n\Sigma)^{-1}v\rangle with error n−1/2+ε/λn^{-1/2+\varepsilon}/\lambda
Purely nonlinear φ\varphi
Eφ(G)=EGφ(G)=0\mathbb E\varphi(G)=\mathbb E G\varphi(G)=0, so c1=0c_1=0 and φ(Wz)\varphi(Wz) features behave like i.i.d. isotropic ones

Quiz

  1. The variance derivative in λ\lambda is handled by analyticity, but the bias derivative in η\eta needs the finite-difference Lemma 5 with bounds on 2k+12k+1 derivatives. Why the difference?
  2. In the latent model x=Wz+ux=Wz+u, y=θTz+ξy=\theta^Tz+\xi, the min-norm risk keeps falling as γ→∞\gamma\to\infty at fixed n/dn/d, and the optimal ridge penalty tends to 0. Which explanation matches the formulas?
  3. In Theorem 8 (features φ(Wz)\varphi(Wz) with d<pd<p), what does the condition E[Gφ(G)]=0\mathbb E[G\varphi(G)]=0 do?
  4. By Theorem 2 in ridge form, which quantity decides whether the min-norm interpolator learns the component of β\beta along an eigenvector viv_i of Σ\Sigma?

Sources