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
Online Learning with Gaussian Payoffs and Side Observations
NeurIPS 2015
Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach
NeurIPS 2015
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs
NeurIPS 2015
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
ICML 2015
Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions
NeurIPS 2015
Qualitative Multi-Armed Bandits: A Quantile-Based Approach
ICML 2015
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
COLT 2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring
NeurIPS 2015
Revenue Optimization against Strategic Buyers
NeurIPS 2015
Simple regret for infinitely many armed bandits
ICML 2015
Stochastic Online Greedy Learning with Semi-bandit Feedbacks
NeurIPS 2015
The Pareto Regret Frontier for Bandits
NeurIPS 2015
The Self-Normalized Estimator for Counterfactual Learning
NeurIPS 2015
When are Kalman-Filter Restless Bandits Indexable?
NeurIPS 2015
Adaptive Monte Carlo via Bandit Allocation
ICML 2014
A Drifting-Games Analysis for Online Learning and Applications to Boosting
NeurIPS 2014
A Latent Source Model for Online Collaborative Filtering
NeurIPS 2014
Bandit Convex Optimization: Towards Tight Bounds
NeurIPS 2014
Best-Arm Identification in Linear Bandits
NeurIPS 2014
Boosting with Online Binary Learners for the Multiclass Bandit Problem
ICML 2014
Bounded Regret for Finite-Armed Structured Bandits
NeurIPS 2014
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications
ICML 2014
Combinatorial Pure Exploration of Multi-Armed Bandits
NeurIPS 2014
Conditional Swap Regret and Conditional Correlated Equilibrium
NeurIPS 2014
Discovering, Learning and Exploiting Relevance
NeurIPS 2014