Offline Reinforcement Learning and Model-Based Optimization
summary
Identifies the core failure mode as distributional shift from optimizing learned models and shows two concrete fixes with results: a regularized Q‑learning objective called conservative Q‑learning that adversarially finds and pushes down spuriously large Q values and provably yields a lower bound in expectation, improving scores on D4RL benchmarks (notably maze stitching, dexterous manipulation, Atari), and a model inversion networks approach that trains a conditional GAN X = G(Y,Z) and selects Y,Z so forward and inverse models agree, demonstrated on protein design and face synthesis.
AI-written summary · about
chapters (23)
- 0:00Intro
- 2:00What makes modern machine learning word
- 2:33Predictive models are very powerful!
- 4:08Automated decision making is very powerf
- 5:06First setting: data-driven reinforcement lear
- 6:14Second setting: data-driven model-based optimization
- 10:40Off-policy RL: a quick primer
- 11:29What's the problem?
- 12:51Distribution shift in a nutshell
- 15:55How do prior methods address this?
- 19:26Learning with Q-function lower bounds Algorithm
- 21:30Does the bound hold in practice?
- 22:37How does CQL compare?
- 24:04Predictive modeling and design
- 24:30What's wrong with just doing prediction?
- 24:44The model-based optimization problem
- 25:38Uncertainty and extrapolation
- 26:40What can we do?
- 27:56Model inversion networks (MINS)
- 30:09Putting it all together
- 30:23Experimental results
- 30:59Some takeaways
- 31:38Some concluding remarks
related talks
48mPractical Model-based Algorithms for Reinforcement Learning and Imitation Learning, with...
56mA Tutorial on Reinforcement Learning II
01h 17mOnline Reinforcement Learning and Regret
54mGeneralization and Robustness in Offline Reinforcement Learning
09mLearning Under Requirements
30mOffline RL with RLlib
11mLinear Predictors in Reinforcement Learning: ...
48mOffline Reinforcement Learning With Only Realizability
