Minimax Optimal Simple Regret in Two-Armed Best-Arm Identification
Masahiro Kato

TL;DR
This paper proves that the Neyman allocation is asymptotically minimax optimal for simple regret in two-armed best-arm identification, matching the lower bound and improving understanding of optimal adaptive sampling strategies.
Contribution
It establishes the minimax optimality of the Neyman allocation for simple regret without locality restrictions, including the constant term, in two-armed BAI.
Findings
Neyman allocation asymptotically matches the minimax lower bound for simple regret.
The optimality holds for location-shift distributions, including Gaussian.
Neyman allocation reduces to uniform allocation under Bernoulli distributions.
Abstract
This study investigates an asymptotically minimax optimal algorithm in the two-armed fixed-budget best-arm identification (BAI) problem. Given two treatment arms, the objective is to identify the arm with the highest expected outcome through an adaptive experiment. We focus on the Neyman allocation, where treatment arms are allocated following the ratio of their outcome standard deviations. Our primary contribution is to prove the minimax optimality of the Neyman allocation for the simple regret, defined as the difference between the expected outcomes of the true best arm and the estimated best arm. Specifically, we first derive a minimax lower bound for the expected simple regret, which characterizes the worst-case performance achievable under the location-shift distributions, including Gaussian distributions. We then show that the simple regret of the Neyman allocation asymptotically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks
MethodsFocus
