REVIEW 4 cited by
Estimating means of bounded random variables by betting
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
read the original 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.
Forward citations
Cited by 4 Pith papers
-
Simulation-Based Inference for Adaptive Experiments
Simulation with optimism resimulates an adaptive experiment under the null with positively biased nuisance means, yielding asymptotically valid tests and narrower confidence intervals after bandit designs.
-
Risk-Limiting Audits for Parliamentary Majorities
A parliamentary majority can be certified with far fewer inspected ballots than certifying every reported seat, using a product of seat-level anytime-valid e-processes and adaptive sampling.
-
LOGOS: A Living Logic for AI Agent Teams That Evolve With Humans
LOGOS makes multi-agent self-evolution governable by compiling inputs into versioned Agent Packs and promoting only candidates that pass held-out evidence, root policy, and human authorization.
-
Stabilizing Bandits using Regularization: Precise Regret and A Quantitative Central Limit Theorem
Log-barrier regularized stochastic mirror descent yields Lai–Wei stable bandit sampling, valid Wald intervals, near-optimal regret up to logs, and asymptotic normality under o(√T) corruption.
Discussion (0). Continue with ORCID to comment.