Estimating means of bounded random variables by betting

Ian Waudby-Smith, Aaditya Ramdas
10/19/2020
math.STstat.MEstat.ML

Official code: gostevehoward/confseq (87 stars, MIT, last commit 2026-01-07). 1 more implementation below.

Abstract

This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations. We present a general approach for deriving concentration bounds, that can be seen as a generalization and improvement of the celebrated Chernoff method. At its heart, it is based on a class of composite nonnegative martingales, with strong connections to testing by betting and the method of mixtures. We show how to extend these ideas to sampling without replacement, another heavily studied problem. In all cases, our bounds are adaptive to the unknown variance, and empirically vastly outperform existing approaches based on Hoeffding or empirical Bernstein inequalities and their recent supermartingale generalizations. In short, we establish a new state-of-the-art for four fundamental problems: CSs and CIs for bounded means, when sampling with and without replacement.

View on arXivView PDF

Code Implementations(2)

MIT

Confidence sequences and uniform boundaries

874C, RJul 30, 20199 months agoMIT
BSD-3-Clause
40C++, TeXOct 28, 20212 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{waudbysmith2020estimating,
  title  = {Estimating means of bounded random variables by betting},
  author = {Ian Waudby-Smith and Aaditya Ramdas},
  year   = {2020},
  eprint = {2010.09686},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2010.09686}
}

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/2010.09686.svg)](https://codeofpaper.com/paper/2010.09686)

Discussion