Pith. sign in

REVIEW 1 cited by

Asymptotics of Cross-Validation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.11111 v2 pith:WWNEV7KV submitted 2020-01-29 math.ST stat.TH

classification math.STstat.TH
keywords crossspeed-upcentralcross-validationfulllossmodelsnumber
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Cross validation is a central tool in evaluating the performance of machine learning and statistical models. However, despite its ubiquitous role, its theoretical properties are still not well understood. We study the asymptotic properties of the cross validated-risk for a large class of models. Under stability conditions, we establish a central limit theorem and Berry-Esseen bounds, which enable us to compute asymptotically accurate confidence intervals. Using our results, we paint a big picture for the statistical speed-up of cross validation compared to a train-test split procedure. A corollary of our results is that parametric M-estimators (or empirical risk minimizers) benefit from the "full" speed-up when performing cross-validation under the training loss. In other common cases, such as when the training is done using a surrogate loss or a regularizer, we show that the behavior of the cross-validated risk is complex with a variance reduction which may be smaller or larger than the "full" speed-up, depending on the model and the underlying distribution. We allow the number of folds to grow with the number of observations at any rate.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Overtuning in Hyperparameter Optimization

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Around 10% of hyperparameter optimization runs select a validation-optimal configuration that generalizes worse than the first configuration evaluated, a phenomenon the authors call overtuning.

Pith tools