Offline Reinforcement Learning With Only Realizability
summary
Proposes solving offline RL by solving a regularized primal-dual LP (density-regularized DICE-style objective) to recover an importance weight w and extract a policy, requiring only realizability for value and density ratio plus a single-policy concentrability on the regularized occupancy. Shows unbiased sample estimates, uniform-convergence bounds giving sample rates that scale with log |function classes| and polynomially in 1/ε (a provable ε^-6 bound with an ε^-4 asymptotic improvement), and handles agnostic misspecification and policy extraction via behavior cloning.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 5:00Linear Kernel
- 9:00Offline vs Online
- 13:40What should F approximate
- 15:36What is completeness
- 17:48Common justification for completeness
- 19:24Classical pessimism
- 25:02Linear pessimism
- 29:28Density regularization
- 32:18Policy extraction
- 33:24Realizability
- 40:30Proof
- 41:40Other Results
- 43:45Conclusion
related talks
54mGeneralization and Robustness in Offline Reinforcement Learning
55mWhat Are the Statistical Limits of Offline Reinforcement Learning With Function Approximation?
34mUniform Offline Policy Evaluation (OPE) and Offline Learning in Tabular RL
11mLinear Predictors in Reinforcement Learning: ...
30mOffline RL with RLlib
34mOffline Reinforcement Learning and Model-Based Optimization
54mOn the Hardness of Reinforcement Learning With Value-function Approximation
35mOnline Learning with A Lot of Batch Data
