109 search results - page 2 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
ALT
2009
Springer
13 years 9 months ago
2009
Springer
In this paper the sequential prediction problem with expert advice is considered for the case when the losses of experts suffered at each step can be unbounded. We present some mo...
JMLR
2011
13 years 5 hour ago
2011
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
CP
2006
Springer
13 years 8 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
COLT
2010
Springer
13 years 3 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...