83 search results - page 1 / 17 » Online Learning: Beyond Regret |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
JMLR
2012
11 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We relate regret minimization to various online learning tasks, and most notable option pricing.
COLT
2003
Springer
14 years 27 days ago
2003
Springer
This paper extends the game-theoretic notion of internal regret to the case of on-line potfolio selection problems. New sequential investment strategies are designed to minimize th...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
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...