Multi-Armed Bandits

Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 Online Submodular Set Cover, Ranking, and Repeated Active Learning NeurIPS 2011 Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011 PAC-Bayesian Analysis of Contextual Bandits NeurIPS 2011 Prediction strategies without loss NeurIPS 2011 Stochastic convex optimization with bandit feedback NeurIPS 2011 The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011 A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010 Learning from Logged Implicit Exploration Data NeurIPS 2010 Non-Stochastic Bandit Slate Problems NeurIPS 2010 Online Markov Decision Processes under Bandit Feedback NeurIPS 2010 Parametric Bandits: The Generalized Linear Case NeurIPS 2010 Regret Bounds for Gaussian Process Bandit Problems AISTATS 2010 Adapting to the Shifting Intent of Search Queries NeurIPS 2009 Monte Carlo Sampling for Regret Minimization in Extensive Games NeurIPS 2009 Online Learning of Assignments NeurIPS 2009 Adapting to a Market Shock: Optimal Sequential Market-Making NeurIPS 2008 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008 Mortal Multi-Armed Bandits NeurIPS 2008 Online Models for Content Optimization NeurIPS 2008 Online Optimization in X-Armed Bandits NeurIPS 2008 The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information NeurIPS 2007 The Price of Bandit Information for Online Optimization NeurIPS 2007 The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty RSS 2007 Handling Advertisements of Unknown Quality in Search Advertising NeurIPS 2006