← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Parametric Bandits: The Generalized Linear Case NIPS 2010
Non-Stochastic Bandit Slate Problems NIPS 2010
Regret Bounds for Gaussian Process Bandit Problems AISTATS 2010
A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010
Learning from Logged Implicit Exploration Data NIPS 2010
Monte Carlo Sampling for Regret Minimization in Extensive Games NIPS 2009
Online Learning of Assignments NIPS 2009
Adapting to the Shifting Intent of Search Queries NIPS 2009
Online Models for Content Optimization NIPS 2008
Mortal Multi-Armed Bandits NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Adapting to a Market Shock: Optimal Sequential Market-Making NIPS 2008
Online Optimization in X-Armed Bandits NIPS 2008
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty RSS 2007
The Price of Bandit Information for Online Optimization NIPS 2007
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information NIPS 2007
Handling Advertisements of Unknown Quality in Search Advertising NIPS 2006
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning NIPS 2006
Tracking a Small Set of Experts by Mixing Past Posteriors JMLR 2002