On the Universality of Online Mirror Descent

Details On the Universality of Online Mirror Descent On the Universality of Online Mirror Descent

2011-07-20

arxiv.org/abs/1107.4080v1

Computer Science

Learning

Scientific paper

We show that for a general class of convex online learning problems, Mirror
Descent can always achieve a (nearly) optimal regret guarantee.

Affiliated with

Also associated with

No associations

Rating

On the Universality of Online Mirror Descent does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Universality of Online Mirror Descent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Universality of Online Mirror Descent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36458