In high-dimensional linear and one-step feature-learning models, a regularized student can outperform its teacher by fixing under-regularization, using better regularization structure, or retaining pretrained hard features.
Generalization for Least Squares Regression With Simple Spiked Covariances
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Random matrix theory has proven to be a valuable tool in analyzing the generalization of linear models. However, the generalization properties of even two-layer neural networks trained by gradient descent remain poorly understood. To understand the generalization performance of such networks, it is crucial to characterize the spectrum of the feature matrix at the hidden layer. Recent work has made progress in this direction by describing the spectrum after a single gradient step, revealing a spiked covariance structure. Yet, the generalization error for linear models with spiked covariances has not been previously determined. This paper addresses this gap by examining two simple models exhibiting spiked covariances. We derive their generalization error in the asymptotic proportional regime. Our analysis demonstrates that the eigenvector and eigenvalue corresponding to the spike significantly influence the generalization error.
citation-role summary
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On the Mechanisms of Weak-to-Strong Generalization: A Theoretical Perspective
In high-dimensional linear and one-step feature-learning models, a regularized student can outperform its teacher by fixing under-regularization, using better regularization structure, or retaining pretrained hard features.