← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Recovering Bandits NIPS 2019
MaxGap Bandit: Adaptive Algorithms for Approximate Ranking NIPS 2019
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function NIPS 2019
Stochastic Bandits with Context Distributions NIPS 2019
Nonparametric Contextual Bandits in Metric Spaces with Unknown Metric NIPS 2019
Online EXP3 Learning in Adversarial Bandits with Delayed Feedback NIPS 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NIPS 2019
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NIPS 2019
Machine Teaching of Active Sequential Learners NIPS 2019
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NIPS 2019
Online Learning via the Differential Privacy Lens NIPS 2019
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits NIPS 2019
Bandits with Feedback Graphs and Switching Costs NIPS 2019
Making the Cut: A Bandit-based Approach to Tiered Interviewing NIPS 2019
Improved Regret Bounds for Bandit Combinatorial Optimization NIPS 2019
Doubly-Robust Lasso Bandit NIPS 2019
Offline Contextual Bandits with High Probability Fairness Guarantees NIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits NIPS 2019
A New Perspective on Pool-Based Active Classification and False-Discovery Control NIPS 2019
Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits NIPS 2019
Thompson Sampling with Information Relaxation Penalties NIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NIPS 2019
Thompson Sampling and Approximate Inference NIPS 2019