← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Sequential Transfer in Multi-armed Bandit with Finite Set of Models NIPS 2013
Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem COLT 2013
Further Optimal Regret Bounds for Thompson Sampling AISTATS 2013
Thompson Sampling in Switching Environments with Bayesian Online Change Detection AISTATS 2013
Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013
Learning Prices for Repeated Auctions with Strategic Buyers NIPS 2013
(More) Efficient Reinforcement Learning via Posterior Sampling NIPS 2013
Distributed Exploration in Multi-Armed Bandits NIPS 2013
Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 2013
Generic Exploration and K-armed Voting Bandits ICML 2013
Thompson Sampling for Contextual Bandits with Linear Payoffs ICML 2013
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NIPS 2012
Hierarchical Optimistic Region Selection driven by Curiosity NIPS 2012
Contextual Bandit Learning with Predictable Rewards AISTATS 2012
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012
Stochastic Bandit Based on Empirical Moments AISTATS 2012
On Bayesian Upper Confidence Bounds for Bandit Problems AISTATS 2012
Multi-armed Bandit Problems with History AISTATS 2012
The Best of Both Worlds: Stochastic and Adversarial Bandits COLT 2012
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button NIPS 2012
Risk-Aversion in Multi-armed Bandits NIPS 2012
Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012
Analysis of Thompson Sampling for the Multi-armed Bandit Problem COLT 2012