2025
Near Optimal Non-asymptotic Sample Complexity of 1-Identification
ICML 2025poster
Motivated by an open direction in existing literature, we study the 1-identification problem, a fundamental multi-armed bandit formulation on pure exploration. The goal is to determine whether there exists an arm whose mean reward is at least a known threshold $\mu_0$, or to output \textsf{None} if…