The Greedy Advantage in Finite-Horizon Bandits
Kai Zhou, Michael Lingzhi Li, Kai Wang
stat.ML, cs.LG
Submitted: 2026-07-31
Comments: 122 pages, 3 figures, submitted to Management Science and under peer review
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Be Greedy in Multi-Armed Bandits
- Algorithms for multi-armed bandit problems
- On the Prior Sensitivity of Thompson Sampling
- Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
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
- A Transport Geometry of Benign Overfitting
- Efficient quadratic entropy with distance sketches