2012
NeurIPS
NeurIPS 2012
Mirror Descent Meets Fixed Share (and feels no regret)
Abstract
Mirror descent with an entropic regularizer is known to achieve shifting regret bounds that are logarithmic in the dimension. This is done using either a carefully designed projection or by a weight sharing technique. Via a novel unified analysis, we show that these two approaches deliver essentially equivalent bounds on a notion of regret generalizing shifting, adaptive, discounted, and other related regrets. Our analysis also captures and extends the generalized weight sharing technique of Bousquet and Warmuth, and can be refined in several ways, including improvements for small losses and adaptive tuning of parameters.
🌉
Interdisciplinary Bridge
- Artificial Intelligence and Mathematics & Optimization
📈
Trend Setter
- Convex Optimization
🐣
Hot Topic Early Bird
- online algorithm
Topics
Machine Learning > Optimization & Theory > Learning Theory
Machine Learning > Optimization & Theory > Optimization
Mathematics & Optimization > Optimization > Online Algorithms
Machine Learning > Learning Types > Online Learning
Machine Learning > Optimization & Theory > Online Algorithms
Mathematics & Optimization > Optimization > Optimization
Artificial Intelligence > Core AI > Game Theory
Mathematics & Optimization > Optimization > Convex Optimization
Machine Learning > Optimization & Theory > Convex Optimization