38 search results - page 3 / 8 » On the Convergence of Optimistic Policy Iteration |
UAI
2004
13 years 7 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
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
COLT
2007
Springer
14 years 13 days ago
2007
Springer
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
ECML
2004
Springer
13 years 11 months ago
2004
Springer
Although tabular reinforcement learning (RL) methods have been proved to converge to an optimal policy, the combination of particular conventional reinforcement learning techniques...
IJCAI
2001
13 years 7 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...