Pith. sign in

REVIEW 1 cited by

Generalization for Least Squares Regression With Simple Spiked Covariances

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

arxiv 2410.13991 v1 pith:6Z5FQK3B submitted 2024-10-17 math.ST cs.LGstat.MLstat.TH

classification math.STcs.LGstat.MLstat.TH
keywords generalizationspikedcovarianceserrormodelsgradientlinearmatrix
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the Mechanisms of Weak-to-Strong Generalization: A Theoretical Perspective

    stat.ML 2025-05 conditional novelty 6.0 of 10

    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.

Pith tools