Stochastic Matching Bandits with Rare Optimization Updates
stat.ML, cs.LG
Submitted: 2025-09-04
Updated: 2026-10-21
Terminology
Sources
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
- Dynamic pricing and assortment under a contextual MNL demand
- Sequential Batch Learning in Finite-Action Linear Contextual Bandits
- Queueing Matching Bandits with Preference Feedback
- Oracle-Efficient Combinatorial Semi-Bandits
- Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
- Achieving Limited Adaptivity for Multinomial Logistic Bandits
- Optimal Batched Linear Bandits
- Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Scalable Posterior Uncertainty for Flexible Density-Based Clustering
- Efficient quadratic entropy with distance sketches
- Embedding-Bias in Conditional Independence Testing