[12] N. Cesa-Bianchi and G. Lugosi. Combinatorial bandits. Journal of Computer and System Sciences, 78(5):1404-1422, 2012.
[13] S.-H. Chang, P. C. Cosman, and L. B. Milstein. Chernoff-type bounds for the Gaussian error function. IEEE Transactions on Communications, 59(11):2939-2944, 2011.
[14] H. Chen, Y. He, and C. Zhang. On interpolating experts and multi-armed bandits. arXiv preprint arXiv:2307.07264, 2023.
[15] A. Cohen, T. Hazan, and T. Koren. Tight bounds for bandit combinatorial optimization. In Conference on Learning Theory, pages 629-642. PMLR, 2017.
[16] C. Dann, C. Wei, and J. Zimmert. A blackbox approach to best of both worlds in bandits and beyond. In The Thirty Sixth Annual Conference on Learning Theory, volume 195 of Proceedings of Machine Learning Research, pages 5503-5570. PMLR, 2023.
[17] K. Eldowa, N. Cesa-Bianchi, A. M. Metelli, and M. Restelli. Information-theoretic regret bounds for bandits with fixed expert advice. In IEEE Information Theory Workshop, pages 30-35. IEEE, 2023.
[18] L. Erez and T. Koren. Towards best-of-all-worlds online learning with feedback graphs. Advances in Neural Information Processing Systems, 34:28511-28521, 2021.
[19] E. Esposito, F. Fusco, D. van der Hoeven, and N. Cesa-Bianchi. Learning on the edge: Online learning with stochastic feedback graphs. In Advances in Neural Information Processing Systems, volume 35, pages 34776-34788, 2022.
[20] D. Haussler, J. Kivinen, and M. Warmuth. Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44(5):1906-1925, 1998.
[21] S. Ito, D. Hatano, H. Sumita, K. Takemura, T. Fukunaga, N. Kakimura, and K.-I. Kawarabayashi. Improved regret bounds for bandit combinatorial optimization. Advances in Neural Information Processing Systems, 32, 2019.
[22] S. Ito, T. Tsuchiya, and J. Honda. Nearly optimal best-of-both-worlds algorithms for online learning with feedback graphs. Advances in Neural Information Processing Systems, 35:28631–28643, 2022.
[23] T. Jin, J. Liu, and H. Luo. Improved best-of-both-worlds guarantees for multi-armed bandits: FTRL with general regularizers and multiple optimal arms. arXiv preprint arXiv:2302.13534, 2023.
[24] R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Proceedings of a Symposium on the Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
[25] T. Kocák, G. Neu, M. Valko, and R. Munos. Efficient learning by implicit exploration in bandit problems with side observations. In Advances in Neural Information Processing Systems, volume 27, pages 613-621, 2014.
[26] J. Kwon and V. Perchet. Gains and losses are fundamentally different in regret minimization: The sparse case. Journal of Machine Learning Research, 17(227):1-32, 2016.
[27] T. Lattimore and C. Szepesvári. Bandit algorithms. Cambridge University Press, 2020.
[28] H. Luo, H. Tong, M. Zhang, and Y. Zhang. Improved high-probability regret for adversarial bandits with time-varying feedback graphs. In International Conference on Algorithmic Learning Theory, pages 1074-1100. PMLR, 2023.
[29] S. Mannor and O. Shamir. From bandits to experts: On the value of side-observations. Advances in Neural Information Processing Systems, 24, 2011.
[30] F. Orabona. A modern introduction to online learning. CoRR, abs/1912.13213, 2019.
[31] C. Rouyer and Y. Seldin. Tsallis-inf for decoupled exploration and exploitation in multi-armed bandits. In Conference on Learning Theory, pages 3227–3249. PMLR, 2020.
[32] C. Rouyer, D. van der Hoeven, N. Cesa-Bianchi, and Y. Seldin. A near-optimal best-of-both-worlds algorithm for online learning with feedback graphs. In Advances in Neural Information Processing Systems, 2022.
[33] Y. Seldin and G. Lugosi. A lower bound for multi-armed bandits with expert advice. In 13th European Workshop on Reinforcement Learning (EWRL), volume 2, page 7, 2016.