conftrace_

multi-armed bandit

1098 papers

Explore in graph

Also known as

MAB

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) thompson sampling (237) upper confidence bound (197) regret minimization (315) online algorithm (445) sample complexity (1169) contextual bandit (381) best arm identification (85)

Papers

Finite Time Analysis of Stratified Sampling for Monte Carlo NIPS 2011
Multi-armed bandits on implicit metric spaces NIPS 2011
PAC-Bayesian Analysis of Contextual Bandits NIPS 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
-Armed Bandits JMLR 2011
Committing Bandits NIPS 2011
Non-Stochastic Bandit Slate Problems NIPS 2010
Regret Bounds for Gaussian Process Bandit Problems AISTATS 2010
Parametric Bandits: The Generalized Linear Case NIPS 2010
A Parameter-free Hedging Algorithm NIPS 2009
Adapting to the Shifting Intent of Search Queries NIPS 2009
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Mortal Multi-Armed Bandits NIPS 2008
Online Optimization in X-Armed Bandits NIPS 2008
Online Models for Content Optimization NIPS 2008
The Price of Bandit Information for Online Optimization NIPS 2007
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information NIPS 2007
The On-Line Shortest Path Problem Under Partial Monitoring JMLR 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 NIPS 2006
Online Choice of Active Learning Algorithms JMLR 2004
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem JMLR 2004