263 search results - page 14 / 53 » Regret Bounds for Prediction Problems |
COLT
2006
Springer
14 years 1 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...
NIPS
2004
13 years 11 months ago
2004
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
UAI
2004
13 years 11 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
ICML
2001
IEEE
14 years 10 months ago
2001
IEEE
The Bayesian framework is ideally suited for induction problems. The probability of observing xt at