Multi-Armed Bandits

Information Complexity in Bandit Subset Selection COLT 2013 Learning Prices for Repeated Auctions with Strategic Buyers NeurIPS 2013 (More) Efficient Reinforcement Learning via Posterior Sampling NeurIPS 2013 Multiple Identifications in Multi-Armed Bandits ICML 2013 (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NeurIPS 2013 Online Learning with Switching Costs and Other Adaptive Adversaries NeurIPS 2013 On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013 Opportunistic Strategies for Generalized No-Regret Problems COLT 2013 Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013 Prior-free and prior-dependent regret bounds for Thompson Sampling NeurIPS 2013 Regret Minimization for Branching Experts COLT 2013 Sequential Transfer in Multi-armed Bandit with Finite Set of Models NeurIPS 2013 Thompson Sampling for 1-Dimensional Exponential Family Bandits NeurIPS 2013 Thompson Sampling for Contextual Bandits with Linear Payoffs ICML 2013 Thompson Sampling in Switching Environments with Bayesian Online Change Detection AISTATS 2013 Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards NeurIPS 2013 Analysis of Thompson Sampling for the Multi-armed Bandit Problem COLT 2012 Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button NeurIPS 2012 Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012 Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NeurIPS 2012 Contextual Bandit Learning with Predictable Rewards AISTATS 2012 Distributed Non-Stochastic Experts NeurIPS 2012 Hierarchical Optimistic Region Selection driven by Curiosity NeurIPS 2012 Multi-armed Bandit Problems with History AISTATS 2012 On Bayesian Upper Confidence Bounds for Bandit Problems AISTATS 2012