Skip to content
conftrace_

Multi-Armed Bandits

1,327 papers

6
32
103
106
'10
'15
'20
'25

Papers

Robust Multi-objective Learning with Mentor Feedback COLT 2014 Sequential crowdsourced labeling as an epsilon-greedy exploration in a Markov Decision Process AISTATS 2014 Spectral Bandits for Smooth Graph Functions ICML 2014 Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NeurIPS 2014 Stochastic Regret Minimization via Thompson Sampling COLT 2014 Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits ICML 2014 The Blinded Bandit: Learning with Adaptive Feedback NeurIPS 2014 Thompson Sampling for Complex Online Problems ICML 2014 Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem COLT 2013 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 A Gang of Bandits NeurIPS 2013 Almost Optimal Exploration in Multi-Armed Bandits ICML 2013 A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013 Beating Bandits in Gradually Evolving Worlds COLT 2013 Bounded regret in stochastic multi-armed bandits COLT 2013 Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 2013 Distributed Exploration in Multi-Armed Bandits NeurIPS 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 Estimation Bias in Multi-Armed Bandit Algorithms for Search Advertising NeurIPS 2013 Forgetful Bayes and myopic planning: Human learning and decision-making in a bandit setting NeurIPS 2013 From Bandits to Experts: A Tale of Domination and Independence NeurIPS 2013 Further Optimal Regret Bounds for Thompson Sampling AISTATS 2013 Generic Exploration and K-armed Voting Bandits ICML 2013 High-Dimensional Gaussian Process Bandits NeurIPS 2013 How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NeurIPS 2013