general
fact
neutral
A matching lower bound of Ω(d log(1+T/d)) shows that the Ω(log T) factor is unavoidable for general OCO
We also prove a matching lower bound of $Ω(d\log (1+T/d))$, showing that the $Ω(\log T)$ factor is unavoidable.
Machine Learning (Statistics)28 Aug 2026