English

Memorize to Generalize: on the Necessity of Interpolation in High Dimensional Linear Regression

Machine Learning 2022-06-17 v2 Machine Learning Statistics Theory Statistics Theory

Abstract

We examine the necessity of interpolation in overparameterized models, that is, when achieving optimal predictive risk in machine learning problems requires (nearly) interpolating the training data. In particular, we consider simple overparameterized linear regression y=Xθ+wy = X \theta + w with random design XRn×dX \in \mathbb{R}^{n \times d} under the proportional asymptotics d/nγ(1,)d/n \to \gamma \in (1, \infty). We precisely characterize how prediction (test) error necessarily scales with training error in this setting. An implication of this characterization is that as the label noise variance σ20\sigma^2 \to 0, any estimator that incurs at least cσ4\mathsf{c}\sigma^4 training error for some constant c\mathsf{c} is necessarily suboptimal and will suffer growth in excess prediction error at least linear in the training error. Thus, optimal performance requires fitting training data to substantially higher accuracy than the inherent noise floor of the problem.

Keywords

Cite

@article{arxiv.2202.09889,
  title  = {Memorize to Generalize: on the Necessity of Interpolation in High Dimensional Linear Regression},
  author = {Chen Cheng and John Duchi and Rohith Kuditipudi},
  journal= {arXiv preprint arXiv:2202.09889},
  year   = {2022}
}

Comments

32 pages; accepted to the 35th Annual Conference on Learning Theory (COLT) 2022