For general OCO over a d-dimensional compact convex set, an algorithm achieves O(d log(1+T/d)) alternating regret, improving the previous best of O-tilde(d^(2/3) T^(1/3))

For general OCO over a $d$-dimensional compact convex set, we give an algorithm with $O(d\log (1+T/d))$ alternating regret, improving the previous best of $\widetilde{O}(d^{2/3}T^{1/3})$.

http://arxiv.org/abs/2608.24731v1