Target alignment in truncated kernel ridge regression
Not on the map. Why?
Abstract (arXiv)
Kernel ridge regression (KRR) has recently attracted renewed interest due to its potential for explaining the transient effects, such as double descent, that emerge during neural network training. In this work, we study how the alignment between the target function and the kernel affects the performance of the KRR. We focus on the truncated KRR (TKRR) which utilizes an additional parameter that controls the spectral truncation of the kernel matrix. We show that for polynomial alignment, there is an over-aligned regime, in which TKRR can achieve a faster rate than what is achievable by full KRR. The rate of TKRR can improve all the way to the parametric rate, while that of full KRR is capped at a sub-optimal value. This shows that target alignemnt can be better leveraged by utilizing spectral truncation in kernel methods. We also consider the bandlimited alignment setting and show that the regularization surface of TKRR can exhibit transient effects including multiple descent and non-monotonic behavior. Our results show that there is a strong and quantifable relation between the shape of the alignment spectrum and the generalization performance of kernel methods, both in terms of rates and in finite samples.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 45 references that are in the map. First posted on arXiv 28 Jun 2022.
Builds on
14 of 45 references.
References · 14
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
- 2020Benign overfitting in ridge regressioncited by 152
- 2021Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regimecited by 95
- 2015Less is More: Nystr"om Computational Regularizationcited by 89
- 2018Optimal ridge penalty for real-world high-dimensional data can be zero or negative due to the implicit ridge regularizationcited by 52
- 2020A Brief Prehistory of Double Descentcited by 44
- 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
2 more
- 2014Matrix Coherence and the Nystrom Methodcited by 8
- 2019Spectrally-truncated kernel ridge regression and its free lunchcited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1.
4 papers.
- 2023A Theoretical Analysis of the Test Error of Finite-Rank Kernel Ridge Regressioncited by 8
- 2024Many Perception Tasks are Highly Redundant Functions of their Input Datacited by 4
- 2023Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricingcited by 2
- 2025Spectral Analysis of Molecular Features: When Richer Features Do Not Guarantee Better Generalizationcited by 0
- 2025Spectral Analysis of Molecular Features: When Richer Features Do Not Guarantee Better Generalization16 Oct 2025
- 2024Many Perception Tasks are Highly Redundant Functions of their Input Data18 Jul 2024
- 2023A Theoretical Analysis of the Test Error of Finite-Rank Kernel Ridge Regression2 Oct 2023
- 2023Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricing8 Sep 2023