Diminishing Return of Value Expansion Methods in Model-Based Reinforcement Learning
Daniel Palenicek, Michael Lutter, Joao Carvalho, Jan Peters
Abstract
Model-based reinforcement learning is one approach to increase sample efficiency. However, the accuracy of the dynamics model and the resulting compounding error over modelled trajectories are commonly regarded as key limitations. A natural question to ask is: How much more sample efficiency can be gained by improving the learned dynamics models? Our paper empirically answers this question for the class of model-based value expansion methods in continuous control problems. Value expansion methods should benefit from increased model accuracy by enabling longer rollout horizons and better value function approximations. Our empirical study, which leverages oracle dynamics models to avoid compounding model errors, shows that (1) longer horizons increase sample efficiency, but the gain in improvement decreases with each additional expansion step, and (2) the increased model accuracy only marginally increases the sample efficiency compared to learned models with identical horizons. Therefore, longer horizons and increased model accuracy yield diminishing returns in terms of sample efficiency. These improvements in sample efficiency are particularly disappointing when compared to model-free value expansion methods. Even though they introduce no computational overhead, we find their performance to be on-par with model-based value expansion methods. Therefore, we conclude that the limitation of model-based value expansion methods is not the model accuracy of the learned models. While higher model accuracy is beneficial, our experiments show that even a perfect model will not provide an un-rivalled sample efficiency but that the bottleneck lies elsewhere.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 98454512-dcf9-46c0-8e98-8c54b5bdf8f8Cited by top-tier papers2
- XQC: Well-conditioned Optimization Accelerates Deep Reinforcement LearningDaniel Palenicek, Florian Vogt, Joe Watson, Ingmar Posner et al.ICLR 2026 · 20 citations
- The Surprising Difficulty of Search in Model-Based Reinforcement LearningWei-Di Chang, Mikael Henaff, Brandon Amos, Gregory Dudek et al.ICML 2026 · 4 citations
Builds on5
- Dream to Control: Learning Behaviors by Latent ImaginationDanijar Hafner, Timothy P. Lillicrap, Jimmy Ba, Mohammad NorouziICLR 2020 · 1,852 citations
- Model-Augmented Actor-Critic: Backpropagating through PathsIgnasi Clavera, Yao Fu, Pieter AbbeelICLR 2020 · 96 citations
- Bidirectional Model-based Policy OptimizationHang Lai, Jian Shen, Weinan Zhang, Yong YuICML 2020 · 66 citations
- Gamma-Models: Generative Temporal Difference Learning for Infinite-Horizon PredictionMichael Janner, Igor Mordatch, Sergey LevineNeurIPS 2020 · 49 citations
- Selective Dyna-Style Planning Under Limited Model CapacityZaheer Abbas, Samuel Sokota, Erin Talvitie, Martha WhiteICML 2020 · 38 citations
Related papers
- Live in the Moment: Learning Dynamics Model Adapted to Evolving PolicyXiyao Wang, Wichayaporn Wongkamjan, Ruonan Jia, Furong HuangICML 2023 · 20 citations
- Any-step Dynamics Model Improves Future Predictions for Online and Offline Reinforcement LearningHaoxin Lin, Yu-Yan Xu, Yihao Sun, Zhilong Zhang et al.ICLR 2025
- Scalable Offline Model-Based RL with Action ChunksKwanyoung Park, Seohong Park, Youngwoon Lee, Sergey LevineICLR 2026 · 12 citations
- Improving planning and MBRL with temporally-extended actionsPalash Chatterjee, Roni KhardonNeurIPS 2025
- On Rollouts in Model-Based Reinforcement LearningBernd Frauenknecht, Devdutt Subhasish, Friedrich Solowjow, Sebastian TrimpeICLR 2025 · 1 citation
