Universality of Kernel Random Matrices and Kernel Regression in the Quadratic Regime
Parthe Pandit, Zhichao Wang, Yizhe Zhu

TL;DR
This paper extends the analysis of kernel ridge regression to the quadratic asymptotic regime, revealing that many kernels behave like quadratic kernels and providing precise spectral and error characterizations.
Contribution
It introduces a new operator norm approximation for kernel matrices in the quadratic regime and characterizes their spectral distribution and generalization errors.
Findings
Kernel matrices approximate quadratic kernels with correction terms.
Spectral distribution of kernel matrices converges in the quadratic regime.
GCV estimator reliably estimates generalization error in this setting.
Abstract
Kernel ridge regression (KRR) is a popular class of machine learning models that has become an important tool for understanding deep learning. Much of the focus thus far has been on studying the proportional asymptotic regime, , where is the number of training samples and is the dimension of the dataset. In the proportional regime, under certain conditions on the data distribution, the kernel random matrix involved in KRR exhibits behavior akin to that of a linear kernel. In this work, we extend the study of kernel regression to the quadratic asymptotic regime, where . In this regime, we demonstrate that a broad class of inner-product kernels exhibits behavior similar to a quadratic kernel. Specifically, we establish an operator norm approximation bound for the difference between the original kernel random matrix and a quadratic kernel random matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsadvanced mathematical theories
MethodsFocus
