On the Universality of Online Mirror Descent
classification
💻 cs.LG
keywords
descentmirroronlineachievealwaysclassconvexgeneral
read the original abstract
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.