mlsanityData to 7 Oct 2026

Confidence sequences for sampling without replacement

arXiv 2006.04347 ↗First posted 8 Jun 2020stat.ME math.ST stat.MLcited by 23

Not on the map. Why?

Abstract (arXiv)

Many practical tasks involve sampling sequentially without replacement (WoR) from a finite population of size N, in an attempt to estimate some parameter θ^star. Accurately quantifying uncertainty throughout this process is a nontrivial task, but is necessary because it often determines when we stop collecting samples and confidently report a result. We present a suite of tools for designing confidence sequences (CS) for θ^star. A CS is a sequence of confidence sets (Cn)n=1N, that shrink in size, and all contain θ^star simultaneously with high probability. We present a generic approach to constructing a frequentist CS using Bayesian tools, based on the fact that the ratio of a prior to the posterior at the ground truth is a martingale. We then present Hoeffding- and empirical-Bernstein-type time-uniform CSs and fixed-time confidence intervals for sampling WoR, which improve on previous bounds in the literature and explicitly quantify the benefit of WoR sampling.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 7; 2024: 3; 2025: 3; 2026: 6.

23 papers.

Sort:

By area:

  1. 2022Anytime-valid off-policy inference for contextual banditscited by 37
  2. 2021Time-uniform central limit theory and asymptotic confidence sequencescited by 29
  3. 2024A General Framework for Data-Use Auditing of ML Modelscited by 15
  4. 2023Online multiple testing with e-valuescited by 12
  5. 2023On the near-optimality of betting confidence sets for bounded meanscited by 9
  6. 2022Nonparametric extensions of randomized response for private confidence setscited by 6
  7. 2023Risk-limiting Financial Audits via Weighted Sampling without Replacementcited by 6
  8. 2023Early-Exit Neural Networks with Nested Prediction Setscited by 6
  9. 2025On the Provable Performance Guarantee of Efficient Reasoning Modelscited by 6
  10. 2021PAC Mode Estimation using PPR Martingale Confidence Sequencescited by 5
  11. 2025Instance-Level Data-Use Auditing of Visual ML Modelscited by 4
  12. 2023The extended Ville's inequality for nonintegrable nonnegative supermartingalescited by 3
11 more
  1. 2025Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezingcited by 3
  2. 2023PICProp: Physics-Informed Confidence Propagation for Uncertainty Quantificationcited by 1
  3. 2026Concentration Inequalities for Exchangeable Tensors and Matrix-valued Datacited by 1
  4. 2023Identifying Copeland Winners in Dueling Bandits with Indifferencescited by 0
  5. 2024Positive Semidefinite Matrix Supermartingalescited by 0
  6. 2024Estimating Unknown Population Sizes Using the Hypergeometric Distributioncited by 0
  7. 2026ALIVE: Warnings Before Exclusion in Budgeted Multi-Source Learningcited by 0
  8. 2026Discovering Translation-Worthy Languages with E-Valuescited by 0
  9. 2026Sharp Limits for Honest Uncertainty in Hard-Budget Repeated Evaluationcited by 0
  10. 2026Rank Confidence Sequences:Anytime-valid Leaderboardscited by 0
  11. 2026When Can Old Evaluations Certify a New Model? Label-Efficient Release Decisions under Evaluator Driftcited by 0