← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Distributed Non-Stochastic Experts NIPS 2012
Online allocation and homogeneous partitioning for piecewise constant mean-approximation NIPS 2012
Dynamic Policy Programming with Function Approximation AISTATS 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
Committing Bandits NIPS 2011
Multi-Bandit Best Arm Identification NIPS 2011
Multi-armed bandits on implicit metric spaces NIPS 2011
PAC-Bayesian Analysis of Contextual Bandits NIPS 2011
Linear Submodular Bandits and their Application to Diversified Retrieval NIPS 2011
Adaptive Hedge NIPS 2011
Finite Time Analysis of Stratified Sampling for Monte Carlo NIPS 2011
Monotone multi-armed bandit allocations COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011
Minimax Policies for Combinatorial Prediction Games 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
From Bandits to Experts: On the Value of Side-Observations NIPS 2011
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
Optimal and Robust Price Experimentation: Learning by Lottery AISTATS 2011
Prediction strategies without loss NIPS 2011
Improved Algorithms for Linear Stochastic Bandits NIPS 2011