515 search results - page 8 / 103 » Approximating Markov Processes by Averaging |
115
Voted
AAAI
1998
15 years 3 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
130
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
124
Voted
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. TD(
106
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
150
Voted
JMLR
2010
14 years 8 months ago
2010
In this paper, we propose a novel adaptive step-size approach for policy gradient reinforcement learning. A new metric is defined for policy gradients that measures the effect of ...