Sciweavers

7 search results - page 2 / 2
» Online Learning in Case of Unbounded Losses Using Follow the...
Sort
View
COLT
2007
Springer
13 years 11 months ago
Regret to the Best vs. Regret to the Average
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...
CORR
2010
Springer
91views Education» more  CORR 2010»
12 years 11 months ago
Switching between Hidden Markov Models using Fixed Share
In prediction with expert advice the goal is to design online prediction algorithms that achieve small regret (additional loss on the whole data) compared to a reference scheme. I...
Wouter M. Koolen, Tim van Erven