83 search results - page 9 / 17 » Online Learning: Beyond Regret |
CORR
2010
Springer
13 years 7 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
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
AAAI
2008
13 years 10 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Most models of utility elicitation in decision support and interactive optimization assume a predefined set of "catalog" features over which user preferences are express...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
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...