Opening Deep Reinforcement Learning
Deep Reinforcement Learning
- Length
- 24 min
- Level
- Graduate
- Recorded
- UC Berkeley2020
Chapter 1 of 3: Practical considerations for Q-learning
Sergey Levine traces Q-learning’s overestimation bias to the max operation in session 22 of UC Berkeley’s graduate CS 285 course. He explains how double Q-learning uses two decorrelated networks and how N-step returns trade lower bias for higher variance.

Your comment is kept while you sign up.Sign in
Analyzes Q-learning overestimation bias and derives double Q-learning alongside multi-step return estimators.
Sergey Levine traces Q-learning’s overestimation bias to the max operation in session 22 of UC Berkeley’s graduate CS 285 course. He explains how double Q-learning uses two decorrelated networks and how N-step returns trade lower bias for higher variance.
Safe and efficient off-policy reinforcement learning
This lecture
Lecture 22 of 73 of Deep Reinforcement Learning.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.