A Theoretical Analysis of the Test Error of Finite-Rank Kernel Ridge Regression
Not on the map. Why?
Abstract (arXiv)
Existing statistical learning guarantees for general kernel regressors often yield loose bounds when used with finite-rank kernels. Yet, finite-rank kernels naturally appear in several machine learning problems, e.g. when fine-tuning a pre-trained deep neural network's last layer to adapt it to a novel task when performing transfer learning. We address this gap for finite-rank kernel ridge regression (KRR) by deriving sharp non-asymptotic upper and lower bounds for the KRR test error of any finite-rank KRR. Our bounds are tighter than previously derived bounds on finite-rank KRR, and unlike comparable results, they also remain valid for any regularization parameters.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 2 Oct 2023.
Builds on
28 of 42 references.
References · 28
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
- 2018Explicit Inductive Bias for Transfer Learning with Convolutional Networkscited by 226
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2016Generalization Properties of Learning with Random Featurescited by 163
- 2020Benign overfitting in ridge regressioncited by 152
- 2019The Convergence Rate of Neural Networks for Learned Functions of Different Frequenciescited by 134
16 more
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2021Generalization error of random features and kernel methods: hypercontractivity and kernel matrix concentrationcited by 110
- 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 107
- 2015Less is More: Nystr"om Computational Regularizationcited by 89
- 2020Implicit Regularization of Random Feature Modelscited by 54
- 2020Approximation Bounds for Random Neural Networks and Reservoir Systemscited by 52
- 2023High-dimensional analysis of double descent for linear regression with random projectionscited by 47
- 2022Spectrum of inner-product kernel matrices in the polynomial regime and multiple descent phenomenon in kernel ridge regressioncited by 42
- 2020Kernel regression in high dimensions: Refined analysis beyond double descentcited by 39
- 2019PAC-Bayes Un-Expected Bernstein Inequalitycited by 36
- 2022Robust Fine-Tuning of Deep Neural Networks with Hessian-based Generalization Guaranteescited by 34
- 2021Optimal Stopping via Randomized Neural Networkscited by 26
- 2019Risk bounds for reservoir computingcited by 22
- 2022Instance-Dependent Generalization Bounds via Optimal Transportcited by 13
- 2023Infinite-dimensional reservoir computingcited by 7
- 2022Target alignment in truncated kernel ridge regressioncited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 3; 2026: 1.
8 papers.
- 2023Generalization in Kernel Regression Under Realistic Assumptionscited by 26
- 2024Characterizing Overfitting in Kernel Ridgeless Regression Through the Eigenspectrumcited by 13
- 2024A Comprehensive Analysis on the Learning Curve in Kernel Ridge Regressioncited by 6
- 2025Random Feature Representation Boostingcited by 4
- 2025Generalisation and benign over-fitting for linear regression onto random functional covariatescited by 1
- 2025Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Datacited by 1
- 2024Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spacescited by 0
- 2026Random Neural Network Expressivity for Non-Linear Partial Differential Equationscited by 0
- 2026Random Neural Network Expressivity for Non-Linear Partial Differential Equations24 May 2026
- 2025Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data31 Aug 2025
- 2025Generalisation and benign over-fitting for linear regression onto random functional covariates19 Aug 2025
- 2025Random Feature Representation Boosting30 Jan 2025
- 2024A Comprehensive Analysis on the Learning Curve in Kernel Ridge Regression23 Oct 2024
- 2024Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces8 Feb 2024
- 2024Characterizing Overfitting in Kernel Ridgeless Regression Through the Eigenspectrum2 Feb 2024
- 2023Generalization in Kernel Regression Under Realistic Assumptions26 Dec 2023