conftrace_
← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1,057 papers

Papers per year

5
27
87
38
'10
'15
'20
'25

Papers

Finding a most biased coin with fewest flips COLT 2014
lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits COLT 2014
Most Correlated Arms Identification COLT 2014
Robust Multi-objective Learning with Mentor Feedback COLT 2014
Follow the Leader with Dropout Perturbations COLT 2014
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
Resourceful Contextual Bandits COLT 2014
Thompson Sampling for Complex Online Problems ICML 2014
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations ICML 2014
Boosting with Online Binary Learners for the Multiclass Bandit Problem ICML 2014
Spectral Bandits for Smooth Graph Functions ICML 2014
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing ICML 2014
Online Clustering of Bandits ICML 2014
Reducing Dueling Bandits to Cardinal Bandits ICML 2014
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications ICML 2014
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits ICML 2014
Adaptive Monte Carlo via Bandit Allocation ICML 2014
Sequential Transfer in Multi-armed Bandit with Finite Set of Models NIPS 2013
A Gang of Bandits NIPS 2013
Prior-free and prior-dependent regret bounds for Thompson Sampling NIPS 2013
Eluder Dimension and the Sample Complexity of Optimistic Exploration NIPS 2013
Distributed Exploration in Multi-Armed Bandits NIPS 2013
(More) Efficient Reinforcement Learning via Posterior Sampling NIPS 2013
Forgetful Bayes and myopic planning: Human learning and decision-making in a bandit setting NIPS 2013
Estimation Bias in Multi-Armed Bandit Algorithms for Search Advertising NIPS 2013