← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Information Directed Sampling for Sparse Linear Bandits NIPS 2021
Deep Bandits Show-Off: Simple and Efficient Exploration with Deep Networks NIPS 2021
The Pareto Frontier of model selection for general Contextual Bandits NIPS 2021
Bandit Phase Retrieval NIPS 2021
Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination NIPS 2021
Stochastic bandits with groups of similar arms. NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
Auditing Black-Box Prediction Models for Data Minimization Compliance NIPS 2021
Dueling Bandits with Team Comparisons NIPS 2021
Asymptotically Best Causal Effect Identification with Multi-Armed Bandits NIPS 2021
Fair Exploration via Axiomatic Bargaining NIPS 2021
Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization NIPS 2021
Bandits with many optimal arms NIPS 2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms NIPS 2021
Observation-Free Attacks on Stochastic Bandits NIPS 2021
Design of Experiments for Stochastic Contextual Linear Bandits NIPS 2021
Bandits with Knapsacks beyond the Worst Case NIPS 2021
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NIPS 2021
Off-Policy Risk Assessment in Contextual Bandits NIPS 2021
Combinatorial Pure Exploration with Bottleneck Reward Function NIPS 2021
An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints NIPS 2021
Understanding Bandits with Graph Feedback NIPS 2021
Causal Bandits with Unknown Graph Structure NIPS 2021
Differentially Private Multi-Armed Bandits in the Shuffle Model NIPS 2021
A/B/n Testing with Control in the Presence of Subpopulations NIPS 2021