conftrace_
← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1,057 papers

Papers per year

5
27
87
38
'10
'15
'20
'25

Papers

An Empirical Evaluation of Thompson Sampling NIPS 2011
Contextual Gaussian Process Bandit Optimization NIPS 2011
Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NIPS 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011
Dynamic Policy Programming with Function Approximation AISTATS 2011
Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
Minimax Policies for Combinatorial Prediction Games COLT 2011
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011
Monotone multi-armed bandit allocations COLT 2011
Non-Stochastic Bandit Slate Problems NIPS 2010
Learning from Logged Implicit Exploration Data NIPS 2010
Parametric Bandits: The Generalized Linear Case 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
Monte Carlo Sampling for Regret Minimization in Extensive Games NIPS 2009
Adapting to the Shifting Intent of Search Queries NIPS 2009
Online Learning of Assignments NIPS 2009
Online Models for Content Optimization NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Mortal Multi-Armed Bandits NIPS 2008
Adapting to a Market Shock: Optimal Sequential Market-Making NIPS 2008