No-Regret Algorithms for Unconstrained Online Convex Optimization Matthew Streeter H. Brendan McMahan Duolingo, Inc

In particular, regret with respect to x = 0 is constant. We then prove lower bounds showing that our guarantees are near-optimal in this setting.