Pith. sign in

REVIEW 1 cited by

Time-uniform, nonparametric, nonasymptotic confidence sequences

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.08240 v9 pith:P3DWX6ZV submitted 2018-10-18 math.ST math.PRstat.MEstat.TH

classification math.STmath.PRstat.MEstat.TH
keywords confidencenonasymptoticnonparametricsequencesconditionsestimationmatrixsequence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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\'er-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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Anytime-Valid Tests for Sparse Anomalies

    math.ST 2025-06 conditional novelty 7.0 of 10

    Sequential anytime-valid tests for sparse Gaussian anomalies become possible exactly at the fixed-sample detection time t*=T*rho(beta*), and an adaptive mixture test achieves the same threshold without knowing the ano...

Pith tools