Confidence sequences for sampling without replacement

Ian Waudby-Smith, Aaditya Ramdas
6/8/2020
stat.MEmath.STstat.ML

Official code: WannabeSmith/confseq_wor (4 stars, BSD-3-Clause, last commit 2021-05-06).

Abstract

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 $(C_n)_{n=1}^N$, 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.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause

Code for confidence sequences for sampling without replacement (NeurIPS, 2020). https://arxiv.org/pdf/2006.04347.pdf

40Python, Jupyter NotebookOct 22, 20205 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{waudbysmith2020confidence,
  title  = {Confidence sequences for sampling without replacement},
  author = {Ian Waudby-Smith and Aaditya Ramdas},
  year   = {2020},
  eprint = {2006.04347},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2006.04347}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2006.04347.svg)](https://codeofpaper.com/paper/2006.04347)

Discussion