Multi-Armed Bandits
1,327 papers
Papers per year
1
2
3
5
3
6
25
16
33
44
32
35
46
58
89
103
141
182
161
176
106
60
'10
'15
'20
'25
Papers
Learning a Ground Truth Ranking Using Noisy Approval Votes
IJCAI 2017
Learning Unknown Markov Decision Processes: A Thompson Sampling Approach
NeurIPS 2017
Minimal Exploration in Structured Stochastic Bandits
NeurIPS 2017
Model-Independent Online Learning for Influence Maximization
ICML 2017
Monte-Carlo Tree Search by Best Arm Identification
NeurIPS 2017
Multi-Task Learning for Contextual Bandits
NeurIPS 2017
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem
NeurIPS 2017
Off-policy evaluation for slate recommendation
NeurIPS 2017
On Context-Dependent Clustering of Bandits
ICML 2017
Online Learning to Rank with Top-k Feedback
JMLR 2017
Optimal Posted-Price Mechanism in Microtask Crowdsourcing
IJCAI 2017
Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Space
ICML 2017
Perishability of Data: Dynamic Pricing under Varying-Coefficient Models
JMLR 2017
Position-based Multiple-play Bandit Problem with Unknown Position Bias
NeurIPS 2017
Provably Optimal Algorithms for Generalized Linear Contextual Bandits
ICML 2017
Real-Time Bidding with Side Information
NeurIPS 2017
Safety-Aware Algorithms for Adversarial Contextual Bandit
ICML 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing
NeurIPS 2017
The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits
AISTATS 2017
Thompson Sampling for Linear-Quadratic Control Problems
AISTATS 2017
Thresholding Bandits with Augmented UCB
IJCAI 2017
XOR-Sampling for Network Design with Correlated Stochastic Events
IJCAI 2017
Adaptive Concentration Inequalities for Sequential Decision Problems
NeurIPS 2016
An Information-Theoretic Analysis of Thompson Sampling
JMLR 2016
Anytime Exploration for Multi-armed Bandits using Confidence Information
ICML 2016