Sciweavers

1176 search results - page 5 / 236
» Sparse reward processes
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
ICML
2001
IEEE
15 years 10 months ago
Continuous-Time Hierarchical Reinforcement Learning
Hierarchical reinforcement learning (RL) is a general framework which studies how to exploit the structure of actions and tasks to accelerate policy learning in large domains. Pri...
Mohammad Ghavamzadeh, Sridhar Mahadevan
AAAI
2006
14 years 11 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
DSN
2008
IEEE
15 years 4 months ago
A recurrence-relation-based reward model for performability evaluation of embedded systems
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...
Ann T. Tai, Kam S. Tso, William H. Sanders
MASCOTS
1996
14 years 10 months ago
Well-Defined Stochastic Petri Nets
Formalisms based on stochastic Petri Nets (SPNs) can employ structural analysis to ensure that the underlying stochastic process is fully determined. The focus is on the detection...
Gianfranco Ciardo, Robert Zijal