Auer, P. (2002). Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 3:397-422.
Bistritz, I., Zhou, Z., Chen, X., Bambos, N., and Blanchet, J. (2019). Online EXP3 learning in adversarial bandits with delayed feedback. In Advances in Neural Information Processing Systems 32, pages 11349-11358.
Calandriello, D., Lazaric, A., and Valko, M. (2017). Efficient second-order online kernel learning with adaptive embedding. In Advances in Neural Information Processing Systems 30, pages 6140-6150.
Chapelle, O. (2014). Modeling delayed feedback in display advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 1097-1105.
Chatterji, N. S., Pacchiano, A., and Bartlett, P. L. (2019). Online learning with kernel losses. In Proceedings of the 36th International Conference on Machine Learning, pages 971-980.
Chou, K.-C., Lin, H.-T., Chiang, C.-K., and Lu, C.-J. (2015). Pseudo-reward algorithms for contextual bandits with linear payoff functions. In Proceedings of the 6th Asian Conference on Machine Learning, pages 344-359.
Chu, W., Li, L., Reyzin, L., and Schapire, R. E. (2011). Contextual bandits with linear payoff functions. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, pages 208-214.
Dimakopoulou, M., Zhou, Z., Athey, S., and Imbens, G. (2019). Balanced linear contextual bandits. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pages 3445-3453.
Esfandiari, H., Karbasi, A., Mehrabian, A., and Mirrokni, V. S. (2021). Regret bounds for batched bandits. In Proceedings of the 35th AAAI Conference on Artificial Intelligence, pages 7340-7348.
Gao, Z., Han, Y., Ren, Z., and Zhou, Z. (2019). Batched multi-armed bandits problem. In Advances in Neural Information Processing Systems 32, pages 501-511.
Gu, Q., Karbasi, A., Khosravi, K., Mirrokni, V., and Zhou, D. (2021). Batched neural bandits. arXiv preprint arXiv:2102.13028.
Han, Y., Zhou, Z., Zhou, Z., Blanchet, J. H., Glynn, P. W., and Ye, Y. (2020). Sequential batch learning in finite-action linear contextual bandits. CoRR, abs/2004.06321.
Jin, C., Allen-Zhu, Z., Bubeck, S., and Jordan, M. I. (2018). Is q-learning provably efficient? In Advances in Neural Information Processing Systems 31.
Kane, D. M. and Nelson, J. (2014). Sparser Johnson-Lindenstrauss transforms. Journal of the ACM, 61(1):4:1-4:23.
Kim, G. and Paik, M. C. (2019). Doubly-robust lasso bandit. In Advances in Neural Information Processing Systems 32, pages 5869-5879.
Lan, A. S. and Baraniuk, R. G. (2016). A contextual bandits framework for personalized learning action selection. In Proceedings of the 9th International Conference on Educational Data Mining, pages 424-429.
Li, L., Chu, W., Langford, J., and Schapire, R. E. (2010). A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th International Conference on World Wide Web, pages 661-670.
Li, S., Chen, W., Li, S., and Leung, K. (2019). Improved algorithm on online clustering of bandits. In Kraus, S., editor, Proceedings of the 28th International Joint Conference on Artificial Intelligence, volume Li2019Improved, pages 2923-2929.