Back to Prediction and Control with Function Approximation
University of Alberta

Prediction and Control with Function Approximation

In this course, you will learn how to solve problems with large, high-dimensional, and potentially infinite state spaces. You will see that estimating value functions can be cast as a supervised learning problem---function approximation---allowing you to build agents that carefully balance generalization and discrimination in order to maximize reward. We will begin this journey by investigating how our policy evaluation or prediction methods like Monte Carlo and TD can be extended to the function approximation setting. You will learn about feature construction techniques for RL, and representation learning via neural networks and backprop. We conclude this course with a deep-dive into policy gradient methods; a way to learn policies directly without learning a value function. In this course you will solve two continuous-state control tasks and investigate the benefits of policy gradient methods in a continuous-action environment. Prerequisites: This course strongly builds on the fundamentals of Courses 1 and 2, and learners should have completed these before starting this course. Learners should also be comfortable with probabilities & expectations, basic linear algebra, basic calculus, Python 3.0 (at least 1 year), and implementing algorithms from pseudocode. By the end of this course, you will be able to: -Understand how to use supervised learning approaches to approximate value functions -Understand objectives for prediction (value estimation) under function approximation -Implement TD with function approximation (state aggregation), on an environment with an infinite state space (continuous state space) -Understand fixed basis and neural network approaches to feature construction -Implement TD with neural network function approximation in a continuous state environment -Understand new difficulties in exploration when moving to function approximation -Contrast discounted problem formulations for control versus an average reward problem formulation -Implement expected Sarsa and Q-learning with function approximation on a continuous state control task -Understand objectives for directly estimating policies (policy gradient objectives) -Implement a policy gradient method (called Actor-Critic) on a discrete state environment

Status: Linear Algebra
Status: Pseudocode
IntermediateCourse22 hours

Featured reviews

IF

5.0Reviewed Nov 9, 2019

Great course. Slightly more complex than courses 1 and 2, but a huge improvement in terms of applicability to real-world situations.

SJ

5.0Reviewed Jun 24, 2020

Surely a level-up from the previous courses. This course adds to and extends what has been learned in courses 1 & 2 to a greater sphere of real-world problems. Great job Prof. Adam and Martha!

DL

5.0Reviewed May 31, 2020

I had been reading the book of Reinforcement Learning An Introduction by myself. This class helped me to finish the study with a great learning environment. Thank you, Martha and Adam!

JF

5.0Reviewed Jul 10, 2020

Martha and Adam are excellent instructors. This course is so well organized and presented. I have learned a lot! Thanks very much!

JJ

5.0Reviewed Apr 27, 2020

This is the third instalment in reinforcement learning.so far so good. yeah, you can get stuck some times but it is okay you can make it out.

AC

5.0Reviewed Dec 1, 2019

Well peaced and thoughtfully explained course. Highly recommended for anyone willing to set solid grounding in Reinforcement Learning. Thank you Coursera and Univ. of Alberta for the masterclass.

AP

4.0Reviewed Apr 12, 2020

There is a lot of material covered in the course. Be aware the pace picks up considerably from the first two courses. This said, it is a worthwhile course to take.

SP

4.0Reviewed Feb 26, 2020

more detailed explanation of some of the assignments and how state values are got with tile coding but overall a great experience!

WP

5.0Reviewed Apr 11, 2020

Difficult but excellent and impressing. Human being is incredible creating such ideas. This course shows a way to the state when all such ingenious ideas will be created by self learning algorithms.

CS

5.0Reviewed Feb 10, 2021

this course bridged the gap to Deep Learning, the most exciting direction in RL. I would like a sequel dedicated to this from U Alberta

NN

5.0Reviewed Oct 23, 2020

The course was really good one with quizzes to make us remember the important lesson items and well polished Assignments are given which i haven't seen before in coursera

EB

5.0Reviewed Nov 13, 2021

Super interesting, challenging but the videos are very helpful to complement the understanding of the Sutton and Barto RL book. Thanks the Univ. of Alberta team!

All reviews

Showing: 20 of 149

George Gvishiani
5.0
Reviewed Feb 28, 2020
Navid Hakimi
4.0
Reviewed Oct 16, 2019
Maxim Volgin
3.0
Reviewed Jan 23, 2020
Vasilis Vasileiou
2.0
Reviewed Jul 11, 2020
Kian Kyars
1.0
Reviewed Jul 18, 2023
Neil Howard
5.0
Reviewed Nov 3, 2021
Joe Mayer
3.0
Reviewed May 16, 2024
Lars Rolefs
3.0
Reviewed Aug 23, 2021
Mukund Chavan
5.0
Reviewed Mar 27, 2020
SCOTT ANDERSON
4.0
Reviewed Aug 5, 2020
Arthur Ozga
5.0
Reviewed Oct 9, 2020
Maximiliano Beber
5.0
Reviewed Mar 31, 2020
D. Refaeli
5.0
Reviewed Dec 31, 2019
Mark Johnson
5.0
Reviewed Oct 22, 2019
Marcelo Bacher
5.0
Reviewed Apr 16, 2025
Light W
5.0
Reviewed Jun 17, 2021
Julien TREGUER
5.0
Reviewed Nov 12, 2019
Gordon Lau Wai Chung
5.0
Reviewed Mar 23, 2020
Walter O. Augenstein
5.0
Reviewed Dec 9, 2019
Julian Ehlers
5.0
Reviewed Apr 4, 2023