On the Universality of Online Mirror Descent
Srebro, Nati, Sridharan, Karthik, Tewari, Ambuj
–Neural Information Processing Systems
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
Neural Information Processing Systems
Dec-31-2011