57 citations · 120 across the 3 of their papers we have counts for
1 paper · 1 filter
Nathan Srebro, Karthik Sridharan, Ambuj Tewari
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.