Multi-Armed Bandits

Online allocation and homogeneous partitioning for piecewise constant mean-approximation NeurIPS 2012 Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012 On Multilabel Classification and Ranking with Partial Feedback NeurIPS 2012 Risk-Aversion in Multi-armed Bandits NeurIPS 2012 Stochastic Bandit Based on Empirical Moments AISTATS 2012 The Best of Both Worlds: Stochastic and Adversarial Bandits COLT 2012 Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012 Adaptive Hedge NeurIPS 2011 A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011 An Empirical Evaluation of Thompson Sampling NeurIPS 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 Bandits, Query Learning, and the Haystack Dimension COLT 2011 Committing Bandits NeurIPS 2011 Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011 Contextual Gaussian Process Bandit Optimization NeurIPS 2011 Dynamic Policy Programming with Function Approximation AISTATS 2011 Finite Time Analysis of Stratified Sampling for Monte Carlo NeurIPS 2011 From Bandits to Experts: On the Value of Side-Observations NeurIPS 2011 Improved Algorithms for Linear Stochastic Bandits NeurIPS 2011 Linear Submodular Bandits and their Application to Diversified Retrieval NeurIPS 2011 Minimax Policies for Combinatorial Prediction Games COLT 2011 Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011 Monotone multi-armed bandit allocations COLT 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Multi-Bandit Best Arm Identification NeurIPS 2011