no code implementations • 29 Jan 2024 • Tzu-Hsien Tsai, Yun-Da Tsai, Shou-De Lin
We demonstrate that the sample complexity of the first $\lambda$ output arm in lil'HDoC is bounded by the original HDoC algorithm, except for one negligible term, when the distance between the expected reward and threshold is small.
no code implementations • 13 Mar 2023 • Yun-Da Tsai, Tzu-Hsien Tsai, Shou-De Lin
This paper targets a variant of the stochastic multi-armed bandit problem called good arm identification (GAI).
