On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

arXiv:2605.02141 · cs.LG, cs.AI, math.ST, stat.ML, stat.TH · Submitted 2026-05-04 · Read on arXiv

cs.LG, cs.AI, math.ST, stat.ML, stat.TH

Submitted: 2026-05-04

Updated: 2026-10-26

Terminology

• Regularization — 7× in this paper · explained in 3 episodes
• Sample Complexity — 6× in this paper · explained in 20 episodes
• KL Regularization — 2× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks