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

Scalable Thompson Sampling via Optimal Transport AISTATS 2019
Optimal Testing in the Experiment-rich Regime AISTATS 2019
Learning to Bootstrap for Entity Set Expansion EMNLP 2019
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model IJCAI 2019
Improved Algorithm on Online Clustering of Bandits IJCAI 2019
Multi-Objective Generalized Linear Bandits IJCAI 2019
InterSpot: Interactive Spammer Detection in Social Media IJCAI 2019
Approximations of the Restless Bandit Problem JMLR 2019
Best Arm Identification for Contaminated Bandits JMLR 2019
Reducing Exploration of Dying Arms in Mortal Bandits UAI 2019
BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback UAI 2019
Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits UAI 2019
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NIPS 2018
Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs NIPS 2018
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NIPS 2018
Fighting Boredom in Recommender Systems with Linear Reinforcement Learning NIPS 2018
Factored Bandits NIPS 2018
Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem NIPS 2018
Coordinate Descent with Bandit Sampling NIPS 2018
Contextual Pricing for Lipschitz Buyers NIPS 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NIPS 2018
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling NIPS 2018