Sciweavers

683 search results - page 92 / 137
» Coarticulation in Markov Decision Processes
Sort
View
ICML
2007
IEEE
14 years 9 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
2008
IEEE
14 years 9 months ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
ICML
2008
IEEE
14 years 9 months ago
Manifold alignment using Procrustes analysis
In this paper we introduce a novel approach to manifold alignment, based on Procrustes analysis. Our approach differs from "semisupervised alignment" in that it results ...
Chang Wang, Sridhar Mahadevan
ICML
2003
IEEE
14 years 9 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
ICML
2001
IEEE
14 years 9 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