The Effective Horizon Explains Deep RL Performance in Stochastic Environments
Cassidy Laidlaw, Banghua Zhu, Stuart Russell, Anca D. Dragan
摘要
Reinforcement learning (RL) theory has largely focused on proving minimax sample complexity bounds. These require strategic exploration algorithms that use relatively limited function classes for representing the policy or value function. Our goal is to explain why deep RL algorithms often perform well in practice, despite using random exploration and much more expressive function classes like neural networks. Our work arrives at an explanation by showing that many stochastic MDPs can be solved by performing only a few steps of value iteration on the random policy's Q function and then acting greedily. When this is true, we find that it is possible to separate the exploration and learning components of RL, making it much easier to analyze. We introduce a new RL algorithm, SQIRL, that iteratively learns a near-optimal policy by exploring randomly to collect rollouts and then performing a limited number of steps of fitted-Q iteration over those rollouts. We find that any regression algorithm that satisfies basic in-distribution generalization properties can be used in SQIRL to efficiently solve common MDPs. This can explain why deep RL works with complex function approximators like neural networks, since it is empirically established that neural networks generalize well in-distribution. Furthermore, SQIRL explains why random exploration works well in practice, since we show many environments can be solved by effectively estimating the random policy's Q-function and then applying zero or a few steps of value iteration. We leverage SQIRL to derive instance-dependent sample complexity bounds for RL that are exponential only in an "effective horizon" of lookahead-which is typically much smaller than the full horizon-and on the complexity of the class used for function approximation. Empirically, we also find that SQIRL performance strongly correlates with PPO and DQN performance in a variety of stochastic environments, supporting that our theoretical analysis is predictive of practical performance. Our code and data are available at https://github.com/cassidylaidlaw/effective-horizon .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Offline Goal-conditioned Reinforcement Learning with Quasimetric RepresentationsVivek Myers, Bill Zheng, Benjamin Eysenbach, Sergey LevineNeurIPS 2025 · 被引用 26 次
- Temporal Representation Alignment: Successor Features Enable Emergent Compositionality in Robot Instruction FollowingVivek Myers, Bill Zheng, Anca D. Dragan, Kuan Fang 等NeurIPS 2025 · 被引用 13 次
它引用的顶会 Paper8
- Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient AlgorithmsChi Jin, Qinghua Liu, Sobhan MiryoosefiNeurIPS 2021 · 被引用 264 次
- Bilinear Classes: A Structural Framework for Provable Generalization in RLSimon S. Du, Sham M. Kakade, Jason D. Lee, Shachar Lovett 等ICML 2021 · 被引用 207 次
- Guarantees for Epsilon-Greedy Reinforcement Learning with Function ApproximationChristoph Dann, Yishay Mansour, Mehryar Mohri, Ayush Sekhari 等ICML 2022 · 被引用 76 次
- Bridging RL Theory and Practice with the Effective HorizonCassidy Laidlaw, Stuart J. Russell, Anca D. DraganNeurIPS 2023 · 被引用 42 次
- Model-Based Offline PlanningArthur Argenson, Gabriel Dulac-ArnoldICLR 2021 · 被引用 20 次
相关 Paper
- Provably Efficient Reinforcement Learning with Kernel and Neural Function ApproximationsZhuoran Yang, Chi Jin, Zhaoran Wang, Mengdi Wang 等NeurIPS 2020 · 被引用 48 次
- Going Beyond Linear RL: Sample Efficient Neural Function ApproximationBaihe Huang, Kaixuan Huang, Sham M. Kakade, Jason D. Lee 等NeurIPS 2021 · 被引用 10 次
- Count-Based Exploration with the Successor RepresentationMarlos C. Machado, Marc G. Bellemare, Michael BowlingAAAI 2020 · 被引用 206 次
- A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function ApproximationHeyang Zhao, Jiafan He, Quanquan GuNeurIPS 2024 · 被引用 16 次
- Optimistic Exploration with Learned Features Provably Solves Markov Decision Processes with Neural DynamicsSirui Zheng, Lingxiao Wang, Shuang Qiu, Zuyue Fu 等ICLR 2023
