Lune

NeurIPS2020Top-tier venue

Confidence sequences for sampling without replacement

Ian Waudby-Smith, Aaditya Ramdas

2020Year
57Citations
6Top-tier citations

Abstract

Many practical tasks involve sampling sequentially without replacement (WoR) from a finite population of size N , in an attempt to estimate some parameter θ ‹ . 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 θ ‹ . A CS is a sequence of confidence sets pCnq N n"1 , that shrink in size, and all contain θ ‹ 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.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

Cited by top-tier papers6

Ask how each one uses it

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines