Co-occurring keywords · papers mentioning both
Papers
Safety-Aware Algorithms for Adversarial Contextual Bandit
ICML 2017
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits
COLT 2016
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
NeurIPS 2016
Refined Lower Bounds for Adversarial Bandits
NeurIPS 2016
A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits
ICML 2015
Combinatorial Bandits Revisited
NeurIPS 2015
Fighting Bandits with a New Kind of Smoothness
NeurIPS 2015
The Pareto Regret Frontier for Bandits
NeurIPS 2015
One Practical Algorithm for Both Stochastic and Adversarial Bandits
ICML 2014
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations
ICML 2014
From Bandits to Experts: On the Value of Side-Observations
NeurIPS 2011
Using Confidence Bounds for Exploitation-Exploration Trade-offs
JMLR 2002