Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
Kaixuan Ji, Qingyue Zhao, Heyang Zhao, Qiwei Di, Quanquan Gu

TL;DR
This paper provides a comprehensive analysis of KL-regularized multi-armed bandits, establishing near-optimal regret bounds that depend linearly on the number of arms and the regularization parameter, across all regimes.
Contribution
It introduces a sharp, high-probability regret bound for KL-UCB with a novel peeling argument, and characterizes the regret's dependence on regularization intensity, number of arms, and time horizon.
Findings
First high-probability regret bound with linear dependence on K
Lower bound matching the upper bound up to logarithmic factors
Regret scales as () in low-regularization regime
Abstract
Recent studies have shown that reinforcement learning with KL-regularized objectives can enjoy faster rates of convergence or logarithmic regret, in contrast to the classical -type regret in the unregularized setting. However, the statistical efficiency of online learning with respect to KL-regularized objectives remains far from completely characterized, even when specialized to multi-armed bandits (MABs). We address this problem for MABs via a sharp analysis of KL-UCB using a novel peeling argument, which yields a upper bound: the first high-probability regret bound with linear dependence on . Here, is the time horizon, is the number of arms, is the regularization intensity, and hides all logarithmic factors except those involving . The near-tightness of our analysis is certified by the first non-constant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Stochastic Gradient Optimization Techniques · Reinforcement Learning in Robotics
