Yifang Chen, Chung-Wei Lee, Haipeng Luo, and Chen-Yu Wei. 2019. A new algorithm for nonstationary contextual bandits: Efficient, optimal and parameter-free. In Conference on Learning Theory. PMLR, 696-726.
Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire. 2011. Contextual bandits with linear payoff functions. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 208-214.
Ashok Cutkosky and Kwabena Boahen. 2017. Online learning without prior information. In Conference on Learning Theory. PMLR, 643-677.
Miroslav Dudík, Nika Haghtalab, Haipeng Luo, Robert E Schapire, Vasilis Syrgkanis, and Jennifer Wortman Vaughan. 2020. Oracle-efficient online learning and auction design. Journal of the ACM (JACM) 67, 5 (2020), 1-57.
Miroslav Dudik, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, and Tong Zhang. 2011. Efficient optimal learning for contextual bandits. arXiv preprint arXiv:1106.2369 (2011).
Dylan J Foster, Sham M Kakade, Jian Qian, and Alexander Rakhlin. 2021. The statistical complexity of interactive decision making. arXiv preprint arXiv:2112.13487 (2021).
Nika Haghtalab, Yanjun Han, Abhishek Shetty, and Kunhe Yang. 2022. Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries. arXiv preprint arXiv:2202.08549 (2022).
Elad Hazan and Tomer Koren. 2016. The computational power of optimization in online learning. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. 128-141.
Adam Kalai and Santosh Vempala. 2005. Efficient algorithms for online decision problems. J. Comput. System Sci. 71, 3 (2005), 291-307.
Akshay Krishnamurthy, Alekh Agarwal, and Miro Dudik. 2016. Contextual semibandits via supervised learning oracles. Advances In Neural Information Processing Systems 29 (2016).
John Langford and Tong Zhang. 2007. The epoch-greedy algorithm for contextual multi-armed bandits. Advances in neural information processing systems 20, 1 (2007), 96-1.
Tyler Lu, David Pál, and Martin Pál. 2009. Showing relevant ads via context multi-armed bandits. In Proceedings of AISTATS.
Haipeng Luo, Chen-Yu Wei, Alekh Agarwal, and John Langford. 2018. Efficient contextual bandits in non-stationary worlds. In Conference On Learning Theory. PMLR, 1739-1776.
Alexander Rakhlin and Karthik Sridharan. 2015. Hierarchies of relaxations for online prediction problems with evolving constraints. In Conference on Learning Theory. PMLR, 1457-1479.
Alexander Rakhlin and Karthik Sridharan. 2016. Bistro: An efficient relaxation-based method for contextual bandits. In International Conference on Machine Learning. PMLR, 1977-1985.
Sasha Rakhlin, Ohad Shamir, and Karthik Sridharan. 2012. Relax and randomize: From value to algorithms. Advances in Neural Information Processing Systems 25 (2012).
David Simchi-Levi and Yunzong Xu. 2022. Bypassing the monster: A faster and simpler optimal algorithm for contextual bandits under realizability. Mathematics of Operations Research 47, 3 (2022), 1904-1931.
Aleksandrs Slivkins. 2009. Contextual Bandits with Similarity Information. CoRR abs/0907.3986 (2009). arXiv:0907.3986 http://arxiv.org/abs/0907.3986
Aleksandrs Slivkins. 2019. Introduction to multi-armed bandits. Foundations and Trends® in Machine Learning 12, 1-2 (2019), 1-286.
Arun Suggala and Praneeth Netrapalli. 2020. Follow the perturbed leader: Optimism and fast parallel algorithms for smooth minimax games. Advances in Neural Information Processing Systems 33 (2020), 22316-22326.