REVIEW 2 cited by
Fast Rates for Noisy Interpolation Require Rethinking the Effects of Inductive Bias
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
Fast Rates for Noisy Interpolation Require Rethinking the Effects of Inductive Bias
read the original abstract
Good generalization performance on high-dimensional data crucially hinges on a simple structure of the ground truth and a corresponding strong inductive bias of the estimator. Even though this intuition is valid for regularized models, in this paper we caution against a strong inductive bias for interpolation in the presence of noise: While a stronger inductive bias encourages a simpler structure that is more aligned with the ground truth, it also increases the detrimental effect of noise. Specifically, for both linear regression and classification with a sparse ground truth, we prove that minimum $\ell_p$-norm and maximum $\ell_p$-margin interpolators achieve fast polynomial rates close to order $1/n$ for $p > 1$ compared to a logarithmic rate for $p = 1$. Finally, we provide preliminary experimental evidence that this trade-off may also play a crucial role in understanding non-linear interpolating models used in practice.
Forward citations
Cited by 2 Pith papers
-
Minimum Norm Interpolation via the Local Theory of Banach Spaces: The Role of $2$-Uniform Convexity
Sharp bias and noise-error bounds for minimum-norm interpolators in 2-uniformly convex Banach spaces, with the first ℓ_p-MNI rates for non-Gaussian sub-Gaussian covariates.
-
Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity
The sharp MSE bound for the ℓ1-minimum-norm interpolator under isotropic Gaussian covariates is recovered via the geometry of symmetric Gaussian polytopes, without the convex Gaussian min-max theorem.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.