Skip to content
conftrace_

multi-armed bandit

1,217 papers

MABS MAB

Papers

Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Online Learning under Delayed Feedback ICML 2013 Online Learning with Switching Costs and Other Adaptive Adversaries NeurIPS 2013 Open Problem: Adversarial Multiarmed Bandits with Limited Advice COLT 2013 Opportunistic Strategies for Generalized No-Regret Problems COLT 2013 Prior-free and prior-dependent regret bounds for Thompson Sampling NeurIPS 2013 Ranked Bandits in Metric Spaces: Learning Diverse Rankings over Large Document Collections JMLR 2013 Regret Minimization for Branching Experts COLT 2013 Sequential Transfer in Multi-armed Bandit with Finite Set of Models NeurIPS 2013 The price of bandit information in multiclass online classification COLT 2013 Thompson Sampling for 1-Dimensional Exponential Family Bandits NeurIPS 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 A Stochastic Bandit Algorithm for Scratch Games ACML 2012 Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button NeurIPS 2012 Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NeurIPS 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 Online allocation and homogeneous partitioning for piecewise constant mean-approximation NeurIPS 2012 On Multilabel Classification and Ranking with Partial Feedback NeurIPS 2012 Risk-Aversion in Multi-armed Bandits NeurIPS 2012 Stochastic Bandit Based on Empirical Moments AISTATS 2012