Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits
In batched multi-armed bandit problems, the learner can adaptively pull arms and adjust strategy in batches. In many real applications, not only the regret but also the batch complexity need to be optimized. Existing batched bandit algorithms usually assume that the time horizon T is known in advance. However, many applications involve an unpredictable stopping time. In this paper, we study the anytime batched multi-armed bandit problem. We propose an anytime algorithm that achieves the asymptotically optimal regret for exponential families of reward distributions with O(log log T · ilogα(T))1 batches, where α ∈ OT(1). Moreover, we prove that for any constant c > 0, no algorithm can achieve the asymptotically optimal regret within clog log T batches.
