[27] Y. Li, Y. Wang, and Y. Zhou. Nearly minimax-optimal regret for linearly parameterized bandits. In Conference on Learning Theory, pages 2173-2174. PMLR, 2019.
[28] X. Lu and B. Van Roy. Ensemble sampling. In Proceedings of the 31st International Conference on Neural Information Processing Systems, pages 3260-3268, 2017.
[29] K. Mahadik, Q. Wu, S. Li, and A. Sabne. Fast distributed bandits for online recommendation systems. In Proceedings of the 34th ACM International Conference on Supercomputing, pages 1-13, 2020.
[30] E. Mazumdar, A. Pacchiano, Y. Ma, M. Jordan, and P. Bartlett. On approximate thompson sampling with Langevin algorithms. In International Conference on Machine Learning, pages 6797-6807. PMLR, 2020.
[31] T. Minka et al. Divergence measures and message passing. Technical report, Citeseer, 2005.
[32] B. O'Donoghue and T. Lattimore. Variational bayesian optimistic sampling. Advances in Neural Information Processing Systems, 34, 2021.
[33] I. Osband, C. Blundell, A. Pritzel, and B. Van Roy. Deep exploration via bootstrapped dqn. Advances in Neural Information Processing Systems, 29:4026-4034, 2016.
[34] M. Phan, Y. Abbasi-Yadkori, and J. Domke. Thompson sampling with approximate inference. arXiv preprint arXiv:1908.04970, 2019.
[35] A. Rényi. On measures of entropy and information. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics, volume 4, pages 547-562. University of California Press, 1961.
[36] C. Riquelme, G. Tucker, and J. Snoek. Deep bayesian bandits showdown: An empirical comparison of bayesian deep networks for thompson sampling. In International Conference on Learning Representations, 2018.
[37] H. Robbins. Some aspects of the sequential design of experiments. Bulletin of the American Mathematical Society, 58(5):527-535, 1952.
[38] F. Ruiz and M. Titsias. A contrastive divergence for combining variational inference and mcmc. In International Conference on Machine Learning, pages 5537-5545. PMLR, 2019.
[39] D. Russo and B. Van Roy. Learning to optimize via posterior sampling. Mathematics of Operations Research, 39(4):1221-1243, 2014.
[40] Y. Seldin, C. Szepesvári, P. Auer, and Y. Abbasi-Yadkori. Evaluation and analysis of the performance of the exp3 algorithm in stochastic environments. In European Workshop on Reinforcement Learning, pages 103-116. PMLR, 2013.
[41] J. Snoek, O. Rippel, K. Swersky, R. Kiros, N. Satish, N. Sundaram, M. Patwary, M. Prabhat, and R. Adams. Scalable bayesian optimization using deep neural networks. In International Conference on Machine Learning, pages 2171–2180. PMLR, 2015.
[42] N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995, 2009.
[43] B. Szorenyi, R. Busa-Fekete, I. Hegedus, R. Ormandi, M. Jelasy, and B. Kégl. Gossip-based distributed stochastic bandit algorithms. In International Conference on Machine Learning, pages 19-27. PMLR, 2013.
[44] 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-294, 1933.
[45] I. Urteaga and C. Wiggins. Variational inference for the multi-armed contextual bandit. In International Conference on Artificial Intelligence and Statistics, pages 698–706. PMLR, 2018.
[46] N. Wan, D. Li, and N. Hovakimyan. f-divergence variational inference. Advances in Neural Information Processing Systems, 33:17370-17379, 2020.