Stabilizing Q-learning with Weighted Bellman Losses

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=X4G34wleKfM


Duration: 29:42
561 views
16

Pieter Abbeel (UC Berkeley)
https://simons.berkeley.edu/talks/tbd-218
Deep Reinforcement Learning



Other Videos By Simons Institute for the Theory of Computing


2020-10-02CoinDICE: Off-Policy Confidence Interval Estimation via Dual Lens
2020-10-02Rigorous Uncertainty Quantification for Off-policy Evaluation in Reinforcement Learning: a Variation
2020-10-02Is Safe Learning the Future of RL?
2020-10-01Policy Gradients Methods, Neural Policy Classes, and Distribution Shift
2020-10-01Fast Reinforcement Learning With Generalized Policy Updates
2020-10-01Exploiting Latent Structure and Bisimulation Metrics for Better Generalization
2020-10-01Invariant Prediction for Generalization in Reinforcement Learning
2020-10-01Language as a Scaffold for Reinforcement Learning
2020-09-30Discussion: Optimization
2020-09-30Generalizing the Projected Bellman Error Objective for Nonlinear Value Estimation
2020-09-30Stabilizing Q-learning with Weighted Bellman Losses
2020-09-30Munchausen Reinforcement Learning
2020-09-30Adaptive Approximate Policy Iteration
2020-09-30On Distance Approximation for Graph Properties
2020-09-29Discussion: Exploration
2020-09-29PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
2020-09-29Temporally-Extended ε-Greedy Exploration
2020-09-29Learning Exploration Strategies with Meta-Reinforcement Learning
2020-09-29Behaviour Suite for Reinforcement Learning
2020-09-28Discussion: Offline Reinforcement Learning
2020-09-28Attacking the Off-Policy Problem With Duality


Tags:
Pieter Abbeel
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Deep Reinforcement Learning