Sciweavers

5 search results - page 1 / 1
» Using Bisimulation for Policy Transfer in MDPs
Sort
View
78
Voted
AAAI
2010
15 years 1 months ago
Using Bisimulation for Policy Transfer in MDPs
Knowledge transfer has been suggested as a useful approach for solving large Markov Decision Processes. The main idea is to compute a decision-making policy in one environment and...
Pablo Samuel Castro, Doina Precup
RAS
2010
131views more  RAS 2010»
14 years 10 months ago
Probabilistic Policy Reuse for inter-task transfer learning
Policy Reuse is a reinforcement learning technique that efficiently learns a new policy by using past similar learned policies. The Policy Reuse learner improves its exploration b...
Fernando Fernández, Javier García, M...
96
Voted
AAAI
1997
15 years 29 days ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
AAAI
2006
15 years 1 months ago
Using Homomorphisms to Transfer Options across Continuous Reinforcement Learning Domains
We examine the problem of Transfer in Reinforcement Learning and present a method to utilize knowledge acquired in one Markov Decision Process (MDP) to bootstrap learning in a mor...
Vishal Soni, Satinder P. Singh
UAI
1998
15 years 29 days ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr