An Empirical Comparison of Abstraction in Models of Markov Decision Processes

author: Todd Hester, Department of Computer Science, University of Texas at Austin
published: Aug. 26, 2009,   recorded: June 2009,   views: 4115
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Reinforcement learning studies the problem of solving sequential decision making problems. Model-based methods learn an effective policy in few actions by learning a model of the domain and simulating experience in their models. Typical model-based methods must visit each state at least once, which can be infeasible in large domains. To overcome this problem, the model learning algorithm needs to generalize knowledge to unseen states and provide information about the states in which it needs more experience. In this paper, we use existing supervised learning techniques to learn the model of the domain. We empirically compare their effectiveness at generalizing knowledge across states on three different domains. Our results indicate that tree-based models perform the best after training on a small number of transitions, while support vector machines perform the best after a large number of transitions.

See Also:

Download slides icon Download slides: icml09_hester_ecammdp_01.pdf (7.2┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: