Poster
On the Universality of Online Mirror Descent
Nati Srebro · Karthik Sridharan · Ambuj Tewari
[
Abstract
]
Abstract:
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
Live content is unavailable. Log in and register to view live content