Introduction to Reinforcement Learning
author:
Csaba Szepesvari,
Department of Computing Science, University of Alberta
Description
The tutorial will introduce
Reinforcement Learning, that is, learning what actions to take,
and when to take them, so as to optimize long-term performance. This may
involve sacrificing immediate reward to obtain greater reward in the
long-term or just to obtain more information about the environment. The
first part of the tutorial will cover the basics, such as Markov
decision processes, dynamic programming, temporal-difference learning,
Monte Carlo methods, eligibility traces, the role of function
approximation. In the second part we cover some recent developments,
namely policy gradient and second order methods, such as LSPI and the
modified Bellman residual minimization algorithm.
You might be experiencing some problems with Your Video player.
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.
Related content
Visitors who watched this lecture also watched...
Watch videos: (click on thumbnail to launch)
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





