C. Dann, C.-Y. Wei, and J. Zimmert. Best of both worlds policy optimization. In International Conference on Machine Learning, pages 6968-7008. PMLR, 2023a.
C. Dann, C.-Y. Wei, and J. Zimmert. A blackbox approach to best of both worlds in bandits and beyond. In Conference on Learning Theory, pages 5503-5570. PMLR, 2023b.
L. Erez and T. Koren. Towards best-of-all-worlds online learning with feedback graphs. Advances in Neural Information Processing Systems, 34, 2021.
D. J. Foster, S. M. Kakade, J. Qian, and A. Rakhlin. The statistical complexity of interactive decision making. arXiv preprint arXiv:2112.13487, 2021.
D. J. Foster, A. Rakhlin, A. Sekhari, and K. Sridharan. On the complexity of adversarial decision making. In Advances in Neural Information Processing Systems, 2022.
E. Hazan and Z. Karnin. Volumetric spanners: an efficient exploration basis for learning. The Journal of Machine Learning Research, 17(1):4062-4095, 2016.
D. Hoeven, T. Erven, and W. Kotlowski. The many faces of exponential weights in online learning. In Conference On Learning Theory, pages 2067-2092. PMLR, 2018.
S. Ito. Parameter-free multi-armed bandit algorithms with hybrid data-dependent regret bounds. In Conference on Learning Theory, pages 2552–2583. PMLR, 2021.
S. Ito and K. Takemura. Best-of-three-worlds linear bandit algorithm with variance-adaptive regret bounds. In Conference on Learning Theory, pages 2653-2677. PMLR, 2023.
S. Ito, S. Hirahara, T. Soma, and Y. Yoshida. Tight first-and second-order regret bounds for adversarial linear bandits. In Advances in Neural Information Processing Systems, volume 33, 2020.
S. Ito, T. Tsuchiya, and J. Honda. Adversarily robust multi-armed bandit algorithm with variance-dependent regret bounds. In Conference on Learning Theory, pages 1421-1422. PMLR, 2022a.
S. Ito, T. Tsuchiya, and J. Honda. Nearly optimal best-of-both-worlds algorithms for online learning with feedback graphs. In Advances in Neural Information Processing Systems, volume 35, 2022b.
T. Jin and H. Luo. Simultaneously learning stochastic and adversarial episodic mdps with known transition. Advances in Neural Information Processing Systems, 33:16557-16566, 2020.
T. Jin, L. Huang, and H. Luo. The best of both worlds: stochastic and adversarial episodic mdps with unknown transition. Advances in Neural Information Processing Systems, 34, 2021.
T. Jin, J. Liu, and H. Luo. Improved best-of-both-worlds guarantees for multi-armed bandits: Ctrl with general regularizers and multiple optimal arms. arXiv preprint arXiv:2302.13534, 2023.
J. Kirschner, T. Lattimore, and A. Krause. Information directed sampling for linear partial monitoring. In Conference on Learning Theory, pages 2328-2369. PMLR, 2020.
F. Kong, C. Zhao, and S. Li. Best-of-three-worlds analysis for linear bandits with follow-the-regularized-leader algorithm. In Proceedings of Thirty Sixth Conference on Learning Theory, pages 657-673. PMLR, 2023.
T. Lattimore and A. Gyory. Mirror descent and the information ratio. In Conference on Learning Theory, pages 2965-2992. PMLR, 2021.
T. Lattimore and C. Szepesvari. The end of optimism? an asymptotic analysis of finite-armed linear bandits. In Artificial Intelligence and Statistics, pages 728-737. PMLR, 2017.
T. Lattimore and C. Szepesvári. Bandit Algorithms. Cambridge University Press, 2020a.
T. Lattimore and C. Szepesvári. Exploration by optimisation in partial monitoring. In Conference on Learning Theory, pages 2488-2515. PMLR, 2020b.
C.-W. Lee, H. Luo, C.-Y. Wei, M. Zhang, and X. Zhang. Achieving near instance-optimality and minimax-optimality in stochastic and adversarial linear bandits simultaneously. In International Conference on Machine Learning, pages 6142-6151. PMLR, 2021.