On the Universality of Online Mirror Descent

Nati Srebro, Karthik Sridharan, Ambuj Tewari

Advances in Neural Information Processing Systems 24 (NIPS 2011)

We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.