[22] D. G. Horvitz and D. J. Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association, 47(260):663-685, 1952.
[23] T. Jin, P. Xu, J. Shi, X. Xiao, and Q. Gu. Mots: Minimax optimal thompson sampling. In International Conference on Machine Learning, pages 5074-5083. PMLR, 2021.
[24] T. Jin, P. Xu, X. Xiao, and A. Anandkumar. Finite-time regret of thompson sampling algorithms for exponential family multi-armed bandits. In Advances in Neural Information Processing Systems, 2022.
[25] E. Kaufmann, N. Korda, and R. Munos. Thompson sampling: An asymptotically optimal finite-time analysis. In Proceedings of the international conference on Algorithmic Learning Theory (ALT), pages 199-213, 2012.
[26] N. Korda, E. Kaufmann, and R. Munos. Thompson sampling for 1-dimensional exponential family bandits. Advances in neural information processing systems, 26, 2013.
[27] T. L. Lai, H. Robbins, et al. Asymptotically efficient adaptive allocation rules. Advances in applied mathematics, 6(1):4-22, 1985.
[28] T. Lattimore. Refining the confidence level for optimistic bandit strategies. The Journal of Machine Learning Research, 19(1):765-796, 2018.
[29] T. Lattimore and C. Szepesvári. Bandit Algorithms. Cambridge University Press, 2020. URL: https://tor-lattimore.com/downloads/book/book.pdf.
[30] O.-A. Maillard. APPRENTISSAGE SEQUENTIEL: Bandits, Statistique et Reinforcement. PhD thesis, Université des Sciences et Technologie de Lille-Lille I, 2013.
[31] O.-A. Maillard, R. Munos, and G. Stoltz. A finite-time analysis of multi-armed bandits problems with kullback-leibler divergences. In Proceedings of the Conference On Learning Theory (COLT), pages 497–514, 2011.
[32] B. Mason, K.-S. Jun, and L. Jain. An experimental design approach for regret minimization in logistic bandits. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 7736-7743, 2022.
[33] P. Ménard and A. Garivier. A minimax and asymptotically optimal algorithm for stochastic bandits. In Proceedings of the international conference on Algorithmic Learning Theory (ALT), pages 223-237, 2017.
[34] P. Ménard and A. Garivier. A minimax and asymptotically optimal algorithm for stochastic bandits. In International Conference on Algorithmic Learning Theory, pages 223-237. PMLR, 2017.
[35] S. Mukherjee, K. P. Naveen, N. Sudarsanam, and B. Ravindran. Efficient-ucbv: An almost optimal algorithm using variance estimates. Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2018.
[36] E. Novak. Some results on the complexity of numerical integration. Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014, pages 161-183, 2016.
[37] F. Orabona. A modern introduction to online learning. arXiv preprint arXiv:1912.13213, 2019.
[38] J. M. Robins and A. Rotnitzky. Semiparametric efficiency in multivariate regression models with missing data. Journal of the American Statistical Association, 90(429):122-129, 1995.
[39] D. Russo and B. V. Roy. Learning to Optimize via Posterior Sampling. Mathematics of Operations Research, 39(4):1221-1243, 2014.
[40] Y. Seldin and A. Slivkins. One practical algorithm for both stochastic and adversarial bandits. In International Conference on Machine Learning, pages 1287-1295. PMLR, 2014.
[41] W. R. Thompson. On the Likelihood that One Unknown Probability Exceeds Another in View of the Evidence of Two Samples. Biometrika, 25(3/4):285, 1933.