2018/10/18 by Steven R. Howard, Aaditya Ramdas, Jon McAuliffe +1 · 2 voices · 106 citations
Mathematics · #Advanced Causal Inference Techniques #CDF-based nonparametric confidence interval #Confidence distribution #Confidence interval #Iterated function #Law of the iterated logarithm #Logarithm #Matrix (chemical analysis) #Nonparametric statistics #Random Matrices and Applications #Sequence (biology) #Statistical Methods and Inference #math.PR #math.ST #stat.ME #stat.TH
paper · pdf · open access · doi:10.1214/20-aos1991
published in The Annals of Statistics 49(2) (Institute of Mathematical Statistics) · 48 pages, 10 figures
arxiv published 2018/10/18 · openalex created_date 2020/06/05 · openalex publication_date 2021/04/01 · arxiv created 2022/08/06 · arxiv updated 2022/08/09 · openalex updated_date 2026/08/06
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.