5 search results - page 1 / 1 » Hedged learning: regret-minimization with learning experts |
COLT
2007
Springer
13 years 11 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...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
JACM
2006
13 years 4 months ago
2006
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this work, a novel occlusion detection algorithm using online learning is proposed for video applications. Each frame of a video is considered as a time-step for which pixels a...
NIPS
1997
13 years 6 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...