On the optimality of coin-betting for mean estimation

We consider the problem of testing the mean of a bounded real random variable. We introduce a notion of optimal classes for e-variables and e-processes, and establish the optimality of the coin-betting formulation among e-variable-based algorithmic frameworks for testing and estimating the (conditional) mean. As a consequence, we provide a direct and explicit characterisation of all valid e-variables and e-processes for this testing problem. In the language of classical statistical decision theory, we fully describe the set of all admissible e-variables and e-processes, and identify the corresponding minimal complete class.

Authors

Publication Details

Journal
International Journal of Approximate Reasoning
Published
2025-09-01
DOI
https://doi.org/10.1016/j.ijar.2025.109550
Citations
1
Primary Topic
Advanced Bandit Algorithms Research
Type
article
Field-Weighted Citation Impact
2.11

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the optimality of coin-betting for mean estimation

Eugenio Clerico
1 citations
International Journal of Approximate Reasoning
Advanced Bandit Algorithms Research
2.11
article

On the optimality of coin-betting for mean estimation

Eugenio Clerico
article en
1 citations

Abstract

We consider the problem of testing the mean of a bounded real random variable. We introduce a notion of optimal classes for e-variables and e-processes, and establish the optimality of the coin-betting formulation among e-variable-based algorithmic frameworks for testing and estimating the (conditional) mean. As a consequence, we provide a direct and explicit characterisation of all valid e-variables and e-processes for this testing problem. In the language of classical statistical decision theory, we fully describe the set of all admissible e-variables and e-processes, and identify the corresponding minimal complete class.

International Journal of Approximate ReasoningVol. 187
H2020 European Research Council
Openalex Percentile: Top 11%
Advanced Bandit Algorithms Research
2.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.