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

Building Higher-Order Abstractions from the Components of Recommender Systems AAAI 2024
Navigating Uncertainty in Epidemic Contexts with Reinforcement Learning AAAI 2024
Identifying Copeland Winners in Dueling Bandits with Indifferences AISTATS 2024
Best Arm Identification with Resource Constraints AISTATS 2024
Pure Exploration in Bandits with Linear Constraints AISTATS 2024
Multi-armed bandits with guaranteed revenue per arm AISTATS 2024
Constant or Logarithmic Regret in Asynchronous Multiplayer Bandits with Limited Communication AISTATS 2024
Efficient Quantum Agnostic Improper Learning of Decision Trees AISTATS 2024
Meta Learning in Bandits within shared affine Subspaces AISTATS 2024
Federated Linear Contextual Bandits with Heterogeneous Clients AISTATS 2024
Directional Optimism for Safe Linear Bandits AISTATS 2024
Exploration via linearly perturbed loss minimisation AISTATS 2024
A Unified Framework for Discovering Discrete Symmetries AISTATS 2024
Autoregressive Bandits AISTATS 2024
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits AISTATS 2024
Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses AISTATS 2024
Online learning in bandits with predicted context AISTATS 2024
Sum-max Submodular Bandits AISTATS 2024
Online Learning in Contextual Second-Price Pay-Per-Click Auctions AISTATS 2024
Optimal Zero-Shot Detector for Multi-Armed Attacks AISTATS 2024
Towards Costless Model Selection in Contextual Bandits: A Bias-Variance Perspective AISTATS 2024
Can Probabilistic Feedback Drive User Impacts in Online Platforms? AISTATS 2024
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits AISTATS 2024
Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo AISTATS 2024
Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024