Generalization and Robustness in Offline Reinforcement Learning
summary
Proposes a model-based offline RL pipeline that fits a transition model by MLE then pessimism (constrain models near the MLE and plan against the worst-case model) and proves it competes with the best covered policy whenever a realizable model class and coverage measure hold, with sample complexity polynomial in function-class complexity (e.g. log |F|) rather than number of states. Extends to kernels and low-rank MDPs (bounds scale with rank d), and for imitation uses a learned model plus model uncertainty penalty to combine few expert demos with large offline logs — succeeds on a simulated humanoid where behavior cloning fails.
AI-written summary · about
chapters (19)
- 0:00Intro
- 0:43Empirical RL for large-scale problems
- 1:32Traditional Online RL paradigm
- 2:57offline RL paradigm
- 4:12Potential Applications of Offline RL
- 6:01Why offline RL is challenging?
- 8:44Finite Horizon MDPs
- 9:32Offline Data Collection
- 12:24Offline Data Coverage
- 13:48Learning goal in Offline RL: Robustness
- 15:14Learning goal in Offline RL: Generalization
- 17:25A Model-based Approach
- 19:02A Naive Model-based Approach
- 25:46Formal Theoretical Guarantee for CPPO
- 39:40Traditional Imitation Learning
- 40:20Covariate shift in Imitation
- 40:50Offline Imitation Learning
- 44:06Explanation of MILO
- 45:00Experiments of MILO
related talks
34mUniform Offline Policy Evaluation (OPE) and Offline Learning in Tabular RL
48mOffline Reinforcement Learning With Only Realizability
35mOnline Learning with A Lot of Batch Data
55mWhat Are the Statistical Limits of Offline Reinforcement Learning With Function Approximation?
48mPractical Model-based Algorithms for Reinforcement Learning and Imitation Learning, with...
34mOffline Reinforcement Learning and Model-Based Optimization
31mOnline Reinforcement Learning With The Help Of Confounded Offline Data
11mLinear Predictors in Reinforcement Learning: ...
