[JMNB14] Kevin Jamieson, Matthew Malloy, Robert Nowak, and Sébastien Bubeck. lil'UCB: An Optimal Exploration Algorithm for Multi-Armed Bandits. In Conference on Learning Theory, pages 423-439. PMLR, 2014.
[KCG16] Emilie Kaufmann, Olivier Cappé, and Aurélien Garivier. On the complexity of best-arm identification in multi-armed bandit models. The Journal of Machine Learning Research, 17(1):1–42, 2016.
[KG21] Tomás Kocák and Aurélien Garivier. Epsilon best arm identification in spectral band-dits. In *IJCAI*, pages 2636–2642, 2021.
[KSJ20] Julian Katz-Samuels and Kevin Jamieson. The true sample complexity of identifying good arms. In International Conference on Artificial Intelligence and Statistics, pages 1781-1791. PMLR, 2020.
[LCLS10] Lihong Li, Wei Chu, John Langford, and Robert E Schapire. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international conference on World wide web, pages 661-670, 2010.
$\left[\mathrm{LJD}^{+}17\right]$  Lisha Li, Kevin Jamieson, Giulia DeSalvo, Afshin Rostamizadeh, and Ameet Talwalkar. Hyperband: A novel bandit-based approach to hyperparameter optimization. The Journal of Machine Learning Research, 18(1):6765-6816, 2017.
[LP14] Kyle Luh and Nicholas Pippenger. Large-deviation bounds for sampling without replacement. The American Mathematical Monthly, 121(5):449-454, 2014.
[LPB17] David E Losada, Javier Parapar, and Alvaro Barreiro. Multi-armed bandits for adjudicating documents in pooling-based evaluation of information retrieval systems. Information Processing & Management, 53(5):1005–1025, 2017.
[LR85] Tze Leung Lai and Herbert Robbins. Asymptotically efficient Adaptive Allocation Rules. Advances in Applied Mathematics, 6:4-22, 1985.
[LS20] Tor Lattimore and Csaba Szepesvári. Bandit Algorithms. Cambridge University Press, 2020.
[MNS16] Amit Moscovich, Boaz Nadler, and Clifford Spiegelman. On the exact Berk-Jones statistics and their  $p$ -value calculation. *Electronic Journal of Statistics*, 10(2):2329-2354, 2016.
[MT04] Shie Mannor and John N Tsitsiklis. The Sample Complexity of Exploration in the Multi-Armed Bandit Problem. Journal of Machine Learning Research, 5(Jun):623-648, 2004.
[MU17] Michael Mitzenmacher and Eli Upfal. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press, 2017.
[Nie20] Frank Nielsen. An Elementary Introduction to Information Geometry. Entropy, 22(10):1100, 2020.
[PRCS16] Vianney Perchet, Philippe Rigollet, Sylvain Chassang, and Erik Snowberg. Batched Bandit Problems. The Annals of Statistics, pages 660–681, 2016.
[RLS19] Wenbo Ren, Jia Liu, and Ness B Shroff. Exploring  $k$  out of Top  $\rho$  Fraction of Arms in Stochastic Bandits. In The 22nd International Conference on Artificial Intelligence and Statistics, pages 2820-2828. PMLR, 2019.
[Sl19] Aleksandrs Slivkins. Introduction to Multi-Armed Bandits. Foundations and Trends® in Machine Learning, 12(1-2):1-286, 2019.
[TRMD21] Parth K Thaker, Nikhil Rao, Mohit Malu, and Gautam Dasarathy. Pure Exploration in Multi-armed Bandits with Graph Side Information. arXiv:2108.01152, 2021.
[WAM08] Yizao Wang, Jean-Yves Audibert, and Rémi Munos. Algorithms for infinitely many-armed bandits. Advances in Neural Information Processing Systems, 21, 2008.
[ZKSN22] Yinglun Zhu, Julian Katz-Samuels, and Robert Nowak. Near instance optimal model selection for pure exploration linear bandits. In International Conference on Artificial Intelligence and Statistics, pages 6735-6769. PMLR, 2022.