general
fact
neutral
The constant regret bound significantly improves previous results which had O(log^(2/3) d · T^(1/3)) regret
Our constant regret bound significantly improves previous results with $O(\log ^{2/3}d \cdot T^{1/3})$ regret [Cevher, Cutkosky, Kavis, Piliouras, Skoulakis, Viano, NeurIPS 2023, Hait, Li, Luo, Zhang, COLT 2025].
Machine Learning (Statistics)28 Aug 2026