[7] P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
[8] D. M. Blei, A. Kucukelbir, and J. D. McAuliffe. Variational inference: A review for statisticians. Journal of the American Statistical Association, 112(518):859-877, 2017.
[9] R. Brekelmans, V. Masrani, F. Wood, G. Ver Steeg, and A. Galstyan. All in the exponential family: Bregman duality in thermodynamic variational inference. In International Conference on Machine Learning, pages 1111-1122. PMLR, 2020.
[10] S. Bubeck and N. Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. arXiv preprint arXiv:1204.5721, 2012.
[11] A. N. Burnetas and M. N. Katehakis. Optimal adaptive policies for sequential allocation problems. Advances in Applied Mathematics, 17(2):122-142, 1996.
[12] O. Chapelle and L. Li. An empirical evaluation of thompson sampling. Advances in Neural Information Processing Systems, 24:2249-2257, 2011.
[13] V. Dani, T. P. Hayes, and S. M. Kakade. Stochastic linear optimization under bandit feedback. 21st Annual Conference on Learning Theory, 2008.
[14] K. Daudel et al. Mixture weights optimisation for alpha-divergence variational inference. Advances in Neural Information Processing Systems, 34:4397-4408, 2021.
[15] A. Garivier and O. Cappé. The kl-ucb algorithm for bounded stochastic bandits and beyond. In Proceedings of the 24th Annual Conference on Learning Theory, pages 359–376. JMLR Workshop and Conference Proceedings, 2011.
[16] A. Gopalan, S. Mannor, and Y. Mansour. Thompson sampling for complex online problems. In International Conference on Machine Learning, pages 100-108. PMLR, 2014.
[17] D. Guo, S. I. Ktena, P. K. Myana, F. Huszar, W. Shi, A. Tejani, M. Kneier, and S. Das. Deep bayesian bandits: Exploring in online personalized recommendations. In Fourteenth ACM Conference on Recommender Systems, pages 456-461, 2020.
[18] B. Hao, Y. Abbasi Yadkori, Z. Wen, and G. Cheng. Bootstrapping upper confidence bound. Advances in Neural Information Processing Systems, 32:12123-12133, 2019.
[19] J. Hernandez-Lobato, Y. Li, M. Rowland, T. Bui, D. Hernandez-Lobato, and R. Turner. Black-box alpha divergence minimization. In International Conference on Machine Learning, pages 1511-1520. PMLR, 2016.
[20] E. Kaufmann. On bayesian index policies for sequential resource allocation. The Annals of Statistics, 46(2):842-865, 2018.
[21] E. Kaufmann, O. Cappé, and A. Garivier. On bayesian upper confidence bounds for bandit problems. In Artificial Intelligence and Statistics, pages 592-600. PMLR, 2012.
[22] E. Kaufmann, N. Korda, and R. Munos. Thompson sampling: An asymptotically optimal finite-time analysis. In International Conference on Algorithmic Learning Theory, pages 199-213. Springer, 2012.
[23] D. P. Kingma and M. Welling. Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114, 2013.
[24] N. Korda, B. Szorenyi, and S. Li. Distributed clustering of linear bandits in peer to peer networks. In International Conference on Machine Learning, pages 1301-1309. PMLR, 2016.
[25] T. L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6(1):4-22, 1985.
[26] Y. Li and R. E. Turner. Rényi divergence variational inference. Advances in Neural Information Processing Systems, 29, 2016.