5 search results - page 1 / 1 » Online Bandit Learning for a Special Class of Non-Convex Los... |
ALT
2006
Springer
13 years 8 months ago
2006
Springer
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...
COLT
2010
Springer
13 years 2 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
ALT
2005
Springer
14 years 1 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
ICML
2010
IEEE
13 years 2 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
COLT
2010
Springer
13 years 2 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...