Poster
On the Universality of Online Mirror Descent
Nati Srebro · Karthik Sridharan · Ambuj Tewari

Tue Dec 13th 05:45 -- 11:59 PM @ None #None

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