Efficient pure exploration in adaptive round model

In the adaptive setting, many multi-armed bandit applications allow the learner to adaptively draw samples and adjust sampling strategy in rounds. In many real applications, not only the query complexity but also the round complexity need to be optimized. In this paper, we study both PAC and exact top-k arm identification problems and design efficient algorithms considering both round complexity and query complexity. For PAC problem, we achieve optimal query complexity and use only O(log^*k _d (n)) rounds, which matches the lower bound of round complexity, while most of existing works need T(log ⁿ_k ) rounds. For exact top-k arm identification, we improve the round complexity factor from log n to log^*_d 1 (n), and achieve near optimal query complexity. In experiments, our algorithms conduct far fewer rounds, and outperform state of the art by orders of magnitude with respect to query cost.