mlsanityData to 14 Oct 2026

A lower confidence sequence for the changing mean of non-negative right heavy-tailed observations with bounded mean

arXiv 2210.11133 ↗First posted 20 Oct 2022stat.ML cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

A confidence sequence (CS) is an anytime-valid sequential inference primitive which produces an adapted sequence of sets for a predictable parameter sequence with a time-uniform coverage guarantee. This work constructs a non-parametric non-asymptotic lower CS for the running average conditional expectation whose slack converges to zero given non-negative right heavy-tailed observations with bounded mean. Specifically, when the variance is finite the approach dominates the empirical Bernstein supermartingale of Howard et. al.; with infinite variance, can adapt to a known or unknown (1 + δ)-th moment bound; and can be efficiently approximated using a sublinear number of sufficient statistics. In certain cases this lower CS can be converted into a closed-interval CS whose width converges to zero, e.g., any bounded realization, or post contextual-bandit inference with bounded rewards and unbounded importance weights. A reference implementation and example simulations demonstrate the technique.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 5 of its 14 references that are in the map. First posted on arXiv 20 Oct 2022.

Builds on

5 of 14 references.

References · 5

  1. 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
  2. 2020Estimating means of bounded random variables by bettingcited by 169
  3. 2022Catoni-style confidence sequences for heavy-tailed mean estimationcited by 17
  4. 2021Off-policy Confidence Sequencescited by 15
  5. 2022Anytime-valid sequential testing for elicitable functionals via supermartingalescited by 4

Built on by

Cited by year

Citing papers per year: 2023: 2.

2 papers.