event thumbnail image
ICML 2007 - The 24th Annual International Conference on Machine Learning
Pascal

Gaussian Process Temporal Difference

author: Yaakov Engel, University of Alberta

Description

Although Bayesian methods for Reinforcement Learning can be traced back to the 1960s (Howard's work in Operations Research), Bayesian methods have only been used sporadically in modern Reinforcement Learning. This is in part because non-Bayesian approaches tend to be much simpler to work with. However, recent advances have shown that Bayesian approaches do not need to be as complex as initially thought and offer several theoretical advantages. For instance, by keeping track of full distributions (instead of point estimates) over the unknowns, Bayesian approaches permit a more comprehensive quantification of the uncertainty regarding the transition probabilities, the rewards, the value function parameters and the policy parameters. Such distributional information can be used to optimize (in a principled way) the classic exploration/exploitation tradeoff, which can speed up the learning process. Similarly, active learning for reinforcement learning can be naturally optimized. The estimation of gradient performance with respect to value function or and/or policy parameters can also be done more accurately while using less data. Bayesian approaches also facilitate the encoding of prior knowledge and the explicit formulation of domain assumptions.

The primary goal of this tutorial is to raise the awareness of the research community with regard to Bayesian methods, their properties and potential benefits for the advancement of Reinforcement Learning. An introduction to Bayesian learning will be given, followed by a historical account of Bayesian Reinforcement Learning and a description of existing Bayesian methods for Reinforcement Learning. The properties and benefits of Bayesian techniques for Reinforcement Learning will be discussed, analyzed and illustrated with case studies.

You might be experiencing some problems with Your Video player.
Slides
0:00 - Questions
3:30 Gaussian Process Temporal Difference Learning
3:58 Why Use GPs in RL?
6:02 Gaussian Processes
8:25 Example: Parametric GP
10:44 Conditioning - Gauss-Markov Thm.
12:38 GP Regression
14:46 GP Regression (ctd.)
15:56 Example
17:16 Markov Decision Processes
18:35 Control and Returns
19:42 Value-Based RL
20:51 Bellman's Equation
22:42 Solution Method Taxonomy
23:12 What's Missing?
27:01 GP Temporal Difference Learning
31:06 Deterministic Dynamics
33:02 - Questions
39:38 The Posterior
41:32 Learning State-Action Values
42:03 Policy Improvement
44:12 GPSARSA Algorithm
45:44 A 2D Navigation Task
48:20 - Questions

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

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.

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: