BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits

6 February 2016

Papers citing "BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits"

9 / 9 papers shown

Title
Random Latent Exploration for Deep Reinforcement Learning Srinath Mahankali Zhang-Wei Hong Ayush Sekhari Alexander Rakhlin Pulkit Agrawal 137 3 0 18 Jul 2024
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits Masahiro Kato Shinji Ito 95 0 0 05 Mar 2024
Policy Learning with Observational Data Susan Athey Stefan Wager CML OffRL 241 183 0 09 Feb 2017
Efficient Algorithms for Adversarial Contextual Learning Vasilis Syrgkanis A. Krishnamurthy Robert Schapire 92 79 0 08 Feb 2016
Adaptive Online Learning Dylan J. Foster Alexander Rakhlin Karthik Sridharan 60 51 0 21 Aug 2015
Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints Alexander Rakhlin Karthik Sridharan 128 9 0 04 Mar 2015
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits Alekh Agarwal Daniel J. Hsu Satyen Kale John Langford Lihong Li Robert Schapire OffRL 223 504 0 04 Feb 2014
Efficient Optimal Learning for Contextual Bandits Miroslav Dudík Daniel J. Hsu Satyen Kale Nikos Karampatziakis John Langford L. Reyzin Tong Zhang 137 300 0 13 Jun 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees A. Beygelzimer John Langford Lihong Li L. Reyzin Robert Schapire OffRL 154 324 0 22 Feb 2010