Time-uniform, nonparametric, nonasymptotic confidence sequences

Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, Jasjeet Sekhon
10/18/2018
math.STmath.PRstat.ME

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

Abstract

A confidence sequence is a sequence of confidence intervals that is uniformly valid over an unbounded time horizon. Our work develops confidence sequences whose widths go to zero, with nonasymptotic coverage guarantees under nonparametric conditions. We draw connections between the Cramér-Chernoff method for exponential concentration, the law of the iterated logarithm (LIL), and the sequential probability ratio test -- our confidence sequences are time-uniform extensions of the first; provide tight, nonasymptotic characterizations of the second; and generalize the third to nonparametric settings, including sub-Gaussian and Bernstein conditions, self-normalized processes, and matrix martingales. We illustrate the generality of our proof techniques by deriving an empirical-Bernstein bound growing at a LIL rate, as well as a novel upper LIL for the maximum eigenvalue of a sum of random matrices. Finally, we apply our methods to covariance matrix estimation and to estimation of sample average treatment effect under the Neyman-Rubin potential outcomes model.

View on arXivView PDF

Code Implementations(1)

MIT

Confidence sequences and uniform boundaries

874C, RJul 30, 20199 months agoMIT

Cite this paper

@article{howard2018timeuniform,
  title  = {Time-uniform, nonparametric, nonasymptotic confidence sequences},
  author = {Steven R. Howard and Aaditya Ramdas and Jon McAuliffe and Jasjeet Sekhon},
  year   = {2018},
  eprint = {1810.08240},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1810.08240}
}

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

Discussion