[1] A. Agarwal, O. Dekel, and L. Xiao. Optimal algorithms for online convex optimization with multi-point bandit feedback. In *Colt*, pages 28-40. CiteSeer, 2010.
[2] D. P. Bertsekas and J. N. Tsitsiklis. Introduction to probability vol. 1. 2002.
[3] S. Bubeck, Y. T. Lee, and R. Eldan. Kernel-based methods for bandit convex optimization. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 72-85, 2017.
[4] D. Garber, E. Hazan, and T. Ma. Online learning of eigenvectors. In International Conference on Machine Learning, pages 560-568. PMLR, 2015.
[5] A. Gopalan, O.-A. Maillard, and M. Zaki. Low-rank bandits with latent mixtures. arXiv preprint arXiv:1609.01508, 2016.
[6] E. Hazan and K. Y. Levy. Bandit convex optimization: Towards tight bounds. In MIPS, 2014.
[7] B. Huang, K. Huang, S. M. Kakade, J. D. Lee, Q. Lei, R. Wang, and J. Yang. Optimal gradient-based algorithms for non-concave bandit optimization. arXiv preprint arXiv:2107.04518, 2021.
[8] K. G. Jamieson, R. Nowak, and B. Recht. Query complexity of derivative-free optimization. Advances in Neural Information Processing Systems (NeurIPS), 2012.
[9] N. Johnson, V. Sivakumar, and A. Banerjee. Structured stochastic linear bandits. arXiv preprint arXiv:1606.05693, 2016.
[10] K.-S. Jun, R. Willett, S. Wright, and R. Nowak. Bilinear bandits with low-rank structure. In International Conference on Machine Learning, pages 3163-3172. PMLR, 2019.
[11] S. Katariya, B. Kveton, C. Szepesvari, C. Vernade, and Z. Wen. Stochastic rank-1 bandits. In Artificial Intelligence and Statistics, pages 392–401. PMLR, 2017.
[12] B. R. Kiran, I. Sobh, V. Talpaert, P. Mannion, A. A. A. Sallab, S. Yogamani, and P. Pérez. Deep reinforcement learning for autonomous driving: A survey. IEEE Transactions on Intelligent Transportation Systems, 23(6):4909-4926, 2022.
[13] R. F. Kizilcec, J. Reich, M. Yeomans, C. Dann, E. Brunskill, G. Lopez, S. Turkay, J. J. Williams, and D. Tingley. Scaling up behavioral science interventions in online education. Proceedings of the National Academy of Sciences, 117(26):14900-14905, 2020.
[14] J. Kober, A. Bagnell, and J. Peters. Reinforcement learning in robotics: A survey. Springer Tracts in Advanced Robotics, 97:9-67, 2014.
[15] W. Kotlowski and G. Neu. Bandit principal component analysis. In Conference On Learning Theory, pages 1994–2024. PMLR, 2019.
[16] S. Lale, K. Azizzadenesheli, A. Anandkumar, and B. Hassibi. Stochastic linear bandits with hidden low rank structure. arXiv preprint arXiv:1901.09490, 2019.
[17] J. Larson, M. Menickelly, and S. M. Wild. Derivative-free optimization methods. Acta Numerica, 28:287-404, 2019.
[18] T. Lattimore and B. Hao. Bandit phase retrieval. arXiv preprint arXiv:2106.01660, 2021.
[19] Y. Lu, A. Meisami, and A. Tewari. Low-rank generalized linear bandit problems. In International Conference on Artificial Intelligence and Statistics, pages 460-468. PMLR, 2021.
[20] E. Moulines and F. Bach. Non-asymptotic analysis of stochastic approximation algorithms for machine learning. Advances in neural information processing systems, 24, 2011.
[21] O. Shamir. On the complexity of bandit and derivative-free stochastic convex optimization. In Conference on Learning Theory, pages 3-24. PMLR, 2013.
[22] S. Yildirim and S. B. Stene. A survey on the need and use of AI in game agents. InTech, 2010.
[23] C. Yu, J. Liu, and S. Nemati. Reinforcement learning in healthcare: A survey. In arXiv preprint arXiv:1908.08796, 2020.
[24] X. Yu, I. King, M. R. Lyu, and T. Yang. A generic approach for accelerating stochastic zeroth-order convex optimization. *IJCAI*, 2018.
[25] L. Zhang, T. Yang, R. Jin, and Z.-H. Zhou. Online bandit learning for a special class of non-convex losses. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.