On the Universality of Online Mirror Descent
Nati Srebro · Karthik Sridharan · Ambuj Tewari
2011 Poster
Abstract
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
Chat is not available.
Successful Page Load