multi-armed bandit

The Best of Both Worlds: Stochastic and Adversarial Bandits COLT 2012 Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011 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 -Armed Bandits JMLR 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 Bandits, Query Learning, and the Haystack Dimension COLT 2011 Better Algorithms for Benign Bandits JMLR 2011 Committing Bandits NeurIPS 2011 Contextual Bandits with Similarity Information COLT 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 Monotone multi-armed bandit allocations COLT 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Multi-Bandit Best Arm Identification NeurIPS 2011 Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011 PAC-Bayesian Analysis of Contextual Bandits NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Prediction strategies without loss NeurIPS 2011 The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011 Non-Stochastic Bandit Slate Problems NeurIPS 2010