[8] A. A. Deshmukh, U. Dogan, and C. Scott. Multi-task learning for contextual bandits. Advances in neural information processing systems, 30, 2017.
[9] A. Erraqabi, A. Lazaric, M. Valko, E. Brunskill, and Y.-E. Liu. Trading off rewards and errors in multi-armed bandits. In Artificial Intelligence and Statistics, pages 709–717. PMLR, 2017.
[10] E. Even-Dar, S. Mannor, Y. Mansour, and S. Mahadevan. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of machine learning research, 7(6), 2006.
[11] L. Fan and P. W. Glynn. The fragility of optimized bandit algorithms. arXiv preprint arXiv:2109.13595, 2022.
[12] N. Galichet, M. Sebag, and O. Teytaud. Exploration vs exploitation vs safety: Risk-aware multi-armed bandits. In Asian Conference on Machine Learning, pages 245–260. PMLR, 2013.
[13] K. Greenewald, A. Tewari, S. Murphy, and P. Klasna. Action centered contextual bandits. Advances in neural information processing systems, 30, 2017.
[14] N. Khajonchotpanya, Y. Xue, and N. Rugeerapaiboon. A revised approach for risk-averse multi-armed bandits under cvar criterion. Operations Research Letters, 49(4):465–472, 2021.
[15] G.-S. Kim and M. C. Paik. Contextual multi-armed bandit algorithm for semiparametric reward model. In International Conference on Machine Learning, pages 3389–3397. PMLR, 2019.
[16] A. Krishnamurthy, Z. S. Wu, and V. Syrgkanis. Semiparametric contextual bandits. In International Conference on Machine Learning, pages 2776-2785. PMLR, 2018.
[17] T. Lattimore and C. Szepesvári. Bandit algorithms. Cambridge University Press, 2020.
[18] O.-A. Maillard. Robust risk-averse stochastic multi-armed bandits. In International Conference on Algorithmic Learning Theory, pages 218–233. Springer, 2013.
[19] L. Prashanth, K. Jagannathan, and R. K. Kolla. Concentration bounds for cvar estimation: The cases of light-tailed and heavy-tailed distributions. In Proceedings of the 37th International Conference on Machine Learning, pages 5577-5586, 2020.
[20] D. J. Russo, B. Van Roy, A. Kazerouni, I. Osband, Z. Wen, et al. A tutorial on thompson sampling. Foundations and Trends® in Machine Learning, 11(1):1-96, 2018.
[21] A. Salomon and J.-Y. Audibert. Deviations of stochastic bandit regret. In International Conference on Algorithmic Learning Theory, pages 159-173. Springer, 2011.
[22] A. Sani, A. Lazaric, and R. Munos. Risk-aversion in multi-armed bandits. Advances in Neural Information Processing Systems, 25, 2012.
[23] D. Simchi-Levi and C. Wang. Multi-armed bandit experimental design: Online decision-making and adaptive inference. Available at SSRN 4224969, 2022.
[24] D. Simchi-Levi, Z. Zheng, and F. Zhu. A simple and optimal policy design for online learning with safety against heavy-tailed risk. arXiv preprint arXiv:2206.02969, 2022.
[25] A. Slivkins et al. Introduction to multi-armed bandits. Foundations and Trends® in Machine Learning, 12(1-2):1-286, 2019.
[26] A. Tamkin, R. Keramati, C. Dann, and E. Brunskill. Distributionally-aware exploration for cvar bandits. In NeurIPS 2019 Workshop on Safety and Robustness on Decision Making, 2019.
[27] S. Vakili and Q. Zhao. Risk-averse multi-armed bandit problems under mean-variance measure. IEEE Journal of Selected Topics in Signal Processing, 10(6):1093–1111, 2016.
[28] F. Yang, A. Ramdas, K. G. Jamieson, and M. J. Wainwright. A framework for multi-a (rmed)/b (andit) testing with online fdr control. Advances in Neural Information Processing Systems, 30, 2017.