On the Universality of Online Mirror Descent
  We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee. 
Nathan Srebro, Karthik Sridharan, Ambuj Tewari
cs.LG