Gaussian-efficient testing by betting on the mean of bounded data

2026-08-21

AI Summary

本文提出了一种新的非渐近置信区间方法，通过一种新颖的投注策略生成终端e值来估计均值μ，解决了在有界数据上进行高斯有效测试的问题。

Abstract

Given $[0,1]$-valued random variables $X_1,\dots,X_n$ such that $\mathbb{E}[X_i | X_1,\dots,X_{i-1}]= μ$ for all $i$, we propose a new nonasymptotic confidence interval for $μ$ that is obtained by inverting terminal e-values generated by a novel betting strategy. When the data are iid, its limiting width matches that of the central limit theorem (``Gaussian-efficient''), finally surpassing the inefficient limits of previous betting intervals. Our main conceptual advance involves designing betting fractions that track the conditional rejection probability of the most powerful terminal test in a limiting Gaussian experiment. When one predictable variance estimator is shared across candidate means, the deterministic inversion is an interval for every data sequence and its two endpoints can be found easily. The width can be improved further with external randomization. In simulations, our method yields the tightest intervals to date; for every distribution tested and all sufficiently large $n$, our deterministic version beats STaR-Bets and is competitive with Gaffke, while the randomized improvement beats both. It thus combines finite-sample validity under martingale dependence, easy endpoint computation, Gaussian-efficient inference for iid data, and excellent empirical performance. We also extend the construction and its efficiency theory to sampling without replacement, where it again achieves state-of-the-art empirical performance.

Problem

• nonasymptotic confidence interval
• Gaussian-efficient
• betting strategy

Innovation

• Gaussian-efficient
• betting strategy
• terminal e-values
• conditional rejection probability
• sampling without replacement