When you enroll in this course, you'll also be enrolled in this Specialization.
Learn new concepts from industry experts
Gain a foundational understanding of a subject or tool
Develop job-relevant skills with hands-on projects
Earn a shareable career certificate
There are 5 modules in this course
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
Welcome to the third course in the Reinforcement Learning Specialization: Prediction and Control with Function Approximation, brought to you by the University of Alberta, Onlea, and Coursera. In this pre-course module, you'll be introduced to your instructors, and get a flavour of what the course has in store for you. Make sure to introduce yourself to your classmates in the "Meet and Greet" section!
What's included
2 videos2 readings1 discussion prompt
Show info about module content
2 videos•Total 12 minutes
Course 3 Introduction•4 minutes
Meet your instructors!•8 minutes
2 readings•Total 20 minutes
Read Me: Pre-requisites and Learning Objectives•10 minutes
Reinforcement Learning Textbook•10 minutes
1 discussion prompt•Total 10 minutes
Meet and Greet•10 minutes
On-policy Prediction with Approximation
Module 2•5 hours to complete
Module details
This week you will learn how to estimate a value function for a given policy, when the number of states is much larger than the memory available to the agent. You will learn how to specify a parametric form of the value function, how to specify an objective function, and how estimating gradient descent can be used to estimate values from interaction with the world.
Framing Value Estimation as Supervised Learning•4 minutes
The Value Error Objective•4 minutes
Introducing Gradient Descent•7 minutes
Gradient Monte for Policy Evaluation•6 minutes
State Aggregation with Monte Carlo•8 minutes
Semi-Gradient TD for Policy Evaluation•4 minutes
Comparing TD and Monte Carlo with State Aggregation•5 minutes
Doina Precup: Building Knowledge for AI Agents with Reinforcement Learning•7 minutes
The Linear TD Update•4 minutes
The True Objective for TD•5 minutes
Week 1 Summary•4 minutes
2 readings•Total 50 minutes
Module 1 Learning Objectives•10 minutes
Weekly Reading: On-policy Prediction with Approximation•40 minutes
1 assignment•Total 30 minutes
On-policy Prediction with Approximation•30 minutes
1 programming assignment•Total 120 minutes
Semi-gradient TD(0) with State Aggregation•120 minutes
1 discussion prompt•Total 10 minutes
Good Objectives for Control•10 minutes
Constructing Features for Prediction
Module 3•5 hours to complete
Module details
The features used to construct the agent’s value estimates are perhaps the most crucial part of a successful learning system. In this module we discuss two basic strategies for constructing features: (1) fixed basis that form an exhaustive partition of the input, and (2) adapting the features while the agent interacts with the world via Neural Networks and Backpropagation. In this week’s graded assessment you will solve a simple but infinite state prediction task with a Neural Network and TD learning.
Generalization Properties of Coarse Coding•5 minutes
Tile Coding•3 minutes
Using Tile Coding in TD•5 minutes
What is a Neural Network?•3 minutes
Non-linear Approximation with Neural Networks•4 minutes
Deep Neural Networks•3 minutes
Gradient Descent for Training Neural Networks•9 minutes
Optimization Strategies for NNs•5 minutes
David Silver on Deep Learning + RL = AI?•9 minutes
Week 2 Review•2 minutes
2 readings•Total 50 minutes
Module 2 Learning Objectives•10 minutes
Weekly Reading: On-policy Prediction with Approximation II•40 minutes
1 assignment•Total 28 minutes
Constructing Features for Prediction•28 minutes
1 programming assignment•Total 180 minutes
Semi-gradient TD with a Neural Network•180 minutes
1 discussion prompt•Total 10 minutes
Constructing Features for Prediction•10 minutes
Control with Approximation
Module 4•6 hours to complete
Module details
This week, you will see that the concepts and tools introduced in modules two and three allow straightforward extension of classic TD control methods to the function approximation setting. In particular, you will learn how to find the optimal policy in infinite-state MDPs by simply combining semi-gradient TD methods with generalized policy iteration, yielding classic control methods like Q-learning, and Sarsa. We conclude with a discussion of a new problem formulation for RL---average reward---which will undoubtedly be used in many applications of RL in the future.
Episodic Sarsa with Function Approximation•4 minutes
Episodic Sarsa in Mountain Car•5 minutes
Expected Sarsa with Function Approximation•2 minutes
Exploration under Function Approximation•4 minutes
Average Reward: A New Way of Formulating Control Problems•10 minutes
Satinder Singh on Intrinsic Rewards•13 minutes
Week 3 Review•3 minutes
2 readings•Total 50 minutes
Module 3 Learning Objectives•10 minutes
Weekly Reading: On-policy Control with Approximation•40 minutes
1 assignment•Total 40 minutes
Control with Approximation•40 minutes
1 programming assignment•Total 180 minutes
Function Approximation and Control•180 minutes
2 discussion prompts•Total 20 minutes
Control with FA #1•10 minutes
Control with FA #2•10 minutes
Policy Gradient
Module 5•6 hours to complete
Module details
Every algorithm you have learned about so far estimates a value function as an intermediate step towards the goal of finding an optimal policy. An alternative strategy is to directly learn the parameters of the policy. This week you will learn about these policy gradient methods, and their advantages over value-function based methods. You will also learn how policy gradient methods can be used to find the optimal policy in tasks with both continuous state and action spaces.
The University of Alberta is considered among the world’s leading public research- and teaching-intensive universities, known for excellence across the humanities, sciences, creative arts, business, engineering and health sciences.
As one of Canada’s top universities, we are investing in purpose-built online post-secondary education—rooted in innovative digital pedagogies, world-class faculty, exceptional design, and a championed student experience.
The Alberta Machine Intelligence Institute (Amii) is home to some of the world’s top talent in machine intelligence. We’re an Alberta-based
research institute that pushes the bounds of academic knowledge and guides business understanding of artificial intelligence and machine learning.
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."
Learner reviews
4.8
848 reviews
5 stars
84.58%
4 stars
12.23%
3 stars
2.11%
2 stars
0.70%
1 star
0.35%
Showing 3 of 848
I
IF
5·
Reviewed on 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.
S
SJ
5·
Reviewed on 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!
D
DL
5·
Reviewed on 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!
When will I have access to the lectures and assignments?
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.