Co-occurring keywords · papers mentioning both
Papers
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
A Parameter-free Hedging Algorithm
NeurIPS 2009
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
Structure Learning in Human Sequential Decision-Making
NeurIPS 2008
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information
NeurIPS 2007
The On-Line Shortest Path Problem Under Partial Monitoring
JMLR 2007
The Price of Bandit Information for Online Optimization
NeurIPS 2007
Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems
JMLR 2006
Handling Advertisements of Unknown Quality in Search Advertising
NeurIPS 2006
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning
NeurIPS 2006
Online Choice of Active Learning Algorithms
JMLR 2004
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
JMLR 2004