Pith. sign in

REVIEW 2 cited by

RandALO: Out-of-sample risk estimation in no time flat

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 2409.09781 v2 pith:NEEPNDGT submitted 2024-09-15 math.ST cs.LGmath.OCstat.COstat.MLstat.TH

classification math.STcs.LGmath.OCstat.COstat.MLstat.TH
keywords randaloriskestimationestimatorexpensivefoldhighleave-one-out
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Estimating out-of-sample risk for models trained on large high-dimensional datasets is an expensive but essential part of the machine learning process, enabling practitioners to optimally tune hyperparameters. Cross-validation (CV) serves as the de facto standard for risk estimation but poorly trades off high bias ($K$-fold CV) for computational cost (leave-one-out CV). We propose a randomized approximate leave-one-out (RandALO) risk estimator that is not only a consistent estimator of risk in high dimensions but also less computationally expensive than $K$-fold CV. We support our claims with extensive simulations on synthetic and real data and provide a user-friendly Python package implementing RandALO available on PyPI as randalo and at https://github.com/cvxgrp/randalo.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. MAGIC: Near-Optimal Data Attribution for Deep Learning

    cs.LG 2025-04 conditional novelty 6.0 of 10

    MAGIC computes the exact influence function for smooth, deterministic deep learning training runs and achieves near-perfect linear datamodeling scores on CIFAR-10, GPT-2, and Gemma-2B, far outperforming TRAK and EK-FAC.

  2. Code generation for solving and differentiating through convex optimization problems

    math.OC 2025-04 conditional novelty 6.0 of 10

    CVXPYgen gains compiled C code generation for differentiating through LP/QP solution maps, with order-of-magnitude speedups over CVXPYlayers in the reported examples.

Pith tools