What Are the Statistical Limits of Offline Reinforcement Learning With Function Approximation?
summary
Assumes linear Q realizability and spectral coverage and then proves an information-theoretic lower bound: any offline algorithm can require about D^{H/2} samples to evaluate a known policy. Construction uses a tiny deterministic MDP (roughly D·H states, two actions) where fitted-backup least-squares yields an exact equality that unfolds into a product-of-matrices and causes exponential variance, verified by experiments. Avoids blowup only under stronger conditions like policy completeness or very small distribution shift; confidence intervals merely detect failure.
AI-written summary · about
chapters (26)
- 0:00Intro
- 1:20What is offline reinforcement learning
- 2:48Intuition
- 4:07Realizability
- 6:00Sequential Decision Making
- 6:57Standard Approach
- 7:48Coverage
- 9:22Limits
- 9:50Policy Evaluation
- 11:15Setting
- 12:17Feature Mapping
- 15:31Upper Limits
- 17:53Lower Limits
- 19:16Observations
- 22:50Upper Bounds
- 24:43Inequality
- 27:30Simulation
- 29:22Summary
- 32:05Sufficient Conditions
- 34:06Possible Results
- 38:30Intuition and Construction
- 42:59Practical Considerations
- 45:39Follow Up
- 47:08Experiments
- 49:26Other Experiments
- 51:15Model vs Feature
related talks
54mOn the Hardness of Reinforcement Learning With Value-function Approximation
34mUniform Offline Policy Evaluation (OPE) and Offline Learning in Tabular RL
48mOffline Reinforcement Learning With Only Realizability
52mWhen Can We Use Weak Function Approximation to Solve Large Scale Planning Problems in MDPs?
54mGeneralization and Robustness in Offline Reinforcement Learning
35mOnline Learning with A Lot of Batch Data
11mLinear Predictors in Reinforcement Learning: ...
31mLearning to Control Unknown Systems
