Pith. sign in

REVIEW 4 cited by

On the near-optimality of betting confidence sets for bounded means

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 2310.01547 v2 pith:W2ZT3MVU submitted 2023-10-02 math.ST cs.ITcs.LGmath.ITstat.APstat.MLstat.TH

On the near-optimality of betting confidence sets for bounded means

classification math.ST cs.ITcs.LGmath.ITstat.APstat.MLstat.TH
keywords bettingconfidenceapproachasymptoticbernsteinboundedboundsclassical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Constructing nonasymptotic confidence intervals (CIs) for the mean of a univariate distribution from independent and identically distributed (i.i.d.) observations is a fundamental task in statistics. For bounded observations, a classical nonparametric approach proceeds by inverting standard concentration bounds, such as Hoeffding's or Bernstein's inequalities. Recently, an alternative betting-based approach for defining CIs and their time-uniform variants called confidence sequences (CSs), has been shown to be empirically superior to the classical methods. In this paper, we provide theoretical justification for this improved empirical performance of betting CIs and CSs. Our main contributions are as follows: (i) We first compare CIs using the values of their first-order asymptotic widths (scaled by $\sqrt{n}$), and show that the betting CI of Waudby-Smith and Ramdas (2023) has a smaller limiting width than existing empirical Bernstein (EB)-CIs. (ii) Next, we establish two lower bounds that characterize the minimum width achievable by any method for constructing CIs/CSs in terms of certain inverse information projections. (iii) Finally, we show that the betting CI and CS match the fundamental limits, modulo an additive logarithmic term and a multiplicative constant. Overall these results imply that the betting CI~(and CS) admit stronger theoretical guarantees than the existing state-of-the-art EB-CI~(and CS); both in the asymptotic and finite-sample regimes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Non-partitioned e-detectors for nonparametric sequential change detection

    stat.ME 2026-07 accept novelty 7.0

    Aggregating point-null e-processes and minimizing over candidate no-change laws yields ARL- and PFA-valid non-partitioned change detectors with first-order optimal delay under local REGROW conditions.

  2. Asymptotically Log-Optimal Bayes-Assisted Confidence Sequences for Bounded Means

    stat.ML 2026-05 unverdicted novelty 7.0

    A Bayesian predictive model adaptively constructs asymptotically log-optimal confidence sequences for bounded means using test martingales.

  3. Asymptotically Log-Optimal Bayes-Assisted Confidence Sequences for Bounded Means

    stat.ML 2026-05 unverdicted novelty 7.0

    A Bayesian predictive model adaptively selects martingale factors to construct asymptotically log-optimal confidence sequences for bounded means while preserving anytime validity under misspecification.

  4. Efficient Sequential Evaluation of Large Language Models

    stat.ML 2026-07 conditional novelty 5.0

    A confidence-sequence framework for sequentially estimating an LLM's average benchmark accuracy under adaptive question selection, with growth-oriented sampling rules that in practice often lose to uniform sampling.