Projection-free Online Exp-concave Optimization

Dan Garber, Ben Kretzu

We consider the setting of online convex optimization (OCO) with \textit{exp-concave} losses. The best regret bound known for this setting is $O(n\log T)$, where $n$ is the dimens…