mlsanityData to 7 Oct 2026

Concentration inequalities for leave-one-out cross validation

arXiv 2211.02478 ↗First posted 4 Nov 2022math.ST cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

In this article we prove that estimator stability is enough to show that leave-one-out cross validation is a sound procedure, by providing concentration bounds 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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 40 references that are in the map. First posted on arXiv 4 Nov 2022.

Builds on

3 of 40 references.

References · 3

  1. 2021Cross-validation: what does it estimate and how well does it do it?cited by 65
  2. 2016Stability revisited: new generalisation bounds for the Leave-one-Outcited by 10
  3. 2019An Exponential Efron-Stein Inequality for Lq Stable Learning Rulescited by 6

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.