On the Universality of Online Mirror Descent
Neural Information Processing Systems (NeurIPS), 2011
Abstract
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
View on arXivComments on this paper