Concentration inequalities for leave-one-out cross validation
math.ST, cs.LG, stat.ML, stat.TH
Submitted: 2022-11-04
Updated: 2026-10-12
Comments: 30 pages, Lean formalization at https://github.com/BennyAvelin/leave-one-out-concentration
Code: https://github.com/BennyAvelin/leave-one-out-concentration
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: In this article we prove that estimator stability, together with a gradient-growth condition on the expected fitted loss, is enough to provide concentration bounds for leave-one-out cross-validation
Abstract
In this article we prove that estimator stability, together with a gradient-growth condition on the expected fitted loss, is enough to provide concentration bounds for leave-one-out cross-validation in a general framework. In particular, we provide concentration bounds beyond Lipschitz continuity assumptions on the loss or on the estimator. We obtain our results by relying on random variables with distribution satisfying the logarithmic Sobolev inequality, providing us a relatively rich class of distributions. We illustrate our method by considering several interesting examples, including linear regression, kernel density estimation, and stabilized/truncated estimators such as stabilized kernel regression.
Sources
- Cross-validation: what does it estimate and how well does it do it?
- Stability revisited: new generalisation bounds for the Leave-one-Out
- Concentration inequalities of the cross-validation estimate for stable predictors
Related papers
- Conformal Prediction for Dyadic Regression Under Complex Missingness
- Sharp Asymptotic Theory of Maximum Likelihood Estimation for Gaussian Processes with an RBF Kernel
- Bentkus-type asymptotic e-values
- High-Dimensional Asymptotics of Differentially Private PCA
- A proximal gradient algorithm for composite log-concave sampling
- KL Convergence Guarantees for Score diffusion models under minimal data assumptions