On Kernel Eigen-alignments of KRR: Reconstruction and Generalization
Yang Liu, Ernest Fokoue, Richard Lange, Daniel Krutz

TL;DR
This paper explores how eigenalignments between kernel matrices and targets influence generalization in kernel ridge regression, providing bounds based on eigenvector and eigenvalue estimation stability.
Contribution
It offers a novel analysis linking eigenvector alignment and eigenvalue estimation to generalization, especially in finite-sample kernel learning scenarios.
Findings
High-rank kernels enable near-zero reconstruction error.
Generalization improves with increased eigenvector alignment and eigenvalue gaps.
Analysis applies to finite-sample settings with suboptimal training data.
Abstract
This paper investigates the critical role of eigenalignments between the kernel matrix and learning targets in achieving robust generalization in learning problems. We establish a direct connection between generalization performance in kernel methods and the estimation of eigenvectors and eigenvalues of matrices, offering a more intuitive understanding compared to prior work with minimal assumptions. We also show that, since the prediction task in KRR is essentially the weighted sum of eigenvectors/singular vectors, by analyzing how much error can be caused by perturbations to the kernel matrix, we can then derive a bound on this generalization error using the estimation stability of matrix eigenvalues and eigenvectors. Compared with previous work, our analysis concentrates on finite-sample settings and on the generalization error arising from having a suboptimal finite training set.…
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.
