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
Replication-proof Bandit Mechanism Design with Bayesian Agents
AAAI 2025
Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Bandits
AISTATS 2025
Risk-Averse Best Arm Set Identification with Fixed Budget and Fixed Confidence
ACML 2025
Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
AISTATS 2025
Robust Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
AAAI 2025
Satisficing Regret Minimization in Bandits
ICLR 2025
Second Order Bounds for Contextual Bandits with Function Approximation
ICLR 2025
Stochastic Bandits Robust to Adversarial Attacks
ICLR 2025
Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback
AAAI 2025
The Adaptive Q-Network for Recommendation Tasks with Dynamic Item Space
AAAI 2025
The Bandit Whisperer: Communication Learning for Restless Bandits
AAAI 2025
Tighter Confidence Bounds for Sequential Kernel Regression
AISTATS 2025
Time-varying Gaussian Process Bandits with Unknown Prior
AISTATS 2025
Towards Fusion of Neural Audio Codec-based Representations with Spectral for Heart Murmur Classification via Bandit-based Cross-Attention Mechanism
Interspeech 2025
Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits
AISTATS 2025
Variance-Dependent Regret Bounds for Nonstationary Linear Bandits
AISTATS 2025
Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo
AISTATS 2024
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
AAAI 2024
Adaptive Important Region Selection with Reinforced Hierarchical Search for Dense Object Detection
NeurIPS 2024
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
COLT 2024
Adaptive Regret for Bandits Made Possible: Two Queries Suffice
ICLR 2024
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
NeurIPS 2024
An Adaptive Implicit Hitting Set Algorithm for MAP and MPE Inference
PGM 2024
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
NeurIPS 2024
A Survey on Multi-player Bandits
JMLR 2024