2011
NeurIPS
NeurIPS 2011
On the Universality of Online Mirror Descent
Abstract
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
🌉
Interdisciplinary Bridge
- Artificial Intelligence and Mathematics & Optimization
📈
Trend Setter
- Optimization
🧭
Keyword Pioneer
- online mirror descent
🐣
Hot Topic Early Bird
- mirror descent
Authors
Topics
Machine Learning > Optimization & Theory > Learning Theory
Machine Learning > Optimization & Theory > Optimization
Mathematics & Optimization > Optimization
Mathematics & Optimization > Optimization > Online Algorithms
Machine Learning > Learning Types > Online Learning
Mathematics & Optimization > Optimization > Optimization