Mirror Descent Meets Fixed Share (and feels no regret)
| 
74 | 
76 | 
0
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.
还没有评论，说两句吧！
热门资源
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Learning to Predi...
Much of model-based reinforcement learning invo...
Hierarchical Task...
We extend hierarchical task network planning wi...
The Variational S...
Unlike traditional images which do not offer in...
Shape-based Autom...
We present an algorithm for automatic detection...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
