Revisiting Bellman Errors for Offline Model Selection
On the map: Offline RL and imitation learning from data → Offline RL algorithms
Abstract (arXiv)
Offline model selection (OMS), that is, choosing the best policy from a set of many policies given only logged data, is crucial for applying offline RL in real-world settings. One idea that has been extensively explored is to select policies based on the mean squared Bellman error (MSBE) of the associated Q-functions. However, previous work has struggled to obtain adequate OMS performance with Bellman errors, leading many researchers to abandon the idea. To this end, we elucidate why previous work has seen pessimistic results with Bellman errors and identify conditions under which OMS algorithms based on Bellman errors will perform well. Moreover, we develop a new estimator of the MSBE that is more accurate than prior methods. Our estimator obtains impressive OMS performance on diverse discrete control tasks, including Atari games.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 57 of its 97 references that are in the map. First posted on arXiv 31 Jan 2023.
Builds on
57 of 97 references.
Closest ancestors · 14
Same direction, newest first
- 2022Oracle Inequalities for Model Selection in Offline Reinforcement Learning3 Nov
- 2022Data-Efficient Pipeline for Offline Reinforcement Learning with Limited Data16 Oct
- 2022A Survey on Offline Reinforcement Learning: Taxonomy, Review, and Open Problems2 Mar
- 2021Towards Hyperparameter-free Policy Selection for Offline Reinforcement Learning26 Oct
- 2021A Workflow for Offline Model-Free Robotic Reinforcement Learning22 Sep
- 2021Online and Offline Reinforcement Learning by Planning with a Learned Model13 Apr
- 2021Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiency5 Feb
- 2020Offline Reinforcement Learning from Images with Latent Space Models21 Dec
- 2020Batch Value-function Approximation with Only Realizability11 Aug
- 2020Hyperparameter Selection for Offline Reinforcement Learning17 Jul
- 2020Conservative Q-Learning for Offline Reinforcement Learning8 Jun
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems4 May
2 more
Other references · 43
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2015Trust Region Policy Optimizationcited by 2,503
- 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2018BDD100K: A Diverse Driving Dataset for Heterogeneous Multitask Learningcited by 1,282
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
31 more
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
- 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 753
- 2018QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulationcited by 730
- 2017A Brief Survey of Deep Reinforcement Learningcited by 466
- 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
- 2018An Algorithmic Perspective on Imitation Learningcited by 455
- 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
- 2019Reinforcement Learning in Healthcare: A Surveycited by 308
- 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
- 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 285
- 2019Batch Policy Learning under Constraintscited by 242
- 2020Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learningcited by 134
- 2018Dopamine: A Research Framework for Deep Reinforcement Learningcited by 121
- 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
- 2019Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Samplingcited by 118
- 2020BADGR: An Autonomous Self-Supervised Learning-Based Navigation Systemcited by 97
- 2021Benchmarks for Deep Off-Policy Evaluationcited by 89
- 2020Off-Policy Evaluation via the Regularized Lagrangiancited by 86
- 2020Batch Policy Learning in Average Reward Markov Decision Processescited by 69
- 2021Model Selection for Offline Reinforcement Learning: Practical Considerations for Healthcare Settingscited by 68
- 2016Estimating Dynamic Treatment Regimes in Mobile Health Using V-learningcited by 65
- 2020Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settingscited by 65
- 2019Off-Policy Estimation of Long-Term Average Outcomes with Applications to Mobile Healthcited by 42
- 2022On Well-posedness and Minimax Optimal Rates of Nonparametric Q-function Estimation in Off-policy Evaluationcited by 33
- 2019Off-Policy Evaluation via Off-Policy Classificationcited by 32
- 2021Autoregressive Dynamics Models for Offline Policy Evaluation and Optimizationcited by 32
- 2022Why Should I Trust You, Bellman? The Bellman Error is a Poor Replacement for Value Errorcited by 31
- 2020Statistical Bootstrapping for Uncertainty Estimation in Off-Policy Evaluationcited by 28
- 2021Minimax Model Learningcited by 16
- 2020Causal Effect Estimation and Optimal Dose Suggestions in Mobile Healthcited by 8
- 2022Hyperparameter Selection Methods for Fitted Q-Evaluation with Error Guaranteecited by 1
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1; 2026: 1.
5 papers.
- 2023Towards Robust Multi-Modal Reasoning via Model Selectioncited by 6
- 2025Model Selection for Off-policy Evaluation: New Algorithms and Experimental Protocolcited by 6
- 2023When is Offline Policy Selection Sample Efficient for Reinforcement Learning?cited by 3
- 2024Adaptive Q-Network: On-the-fly Target Selection for Deep Reinforcement Learningcited by 3
- 2026Piece of CAKE: Adaptive Execution Engines via Microsecond-Scale Learningcited by 0
- 2026Piece of CAKE: Adaptive Execution Engines via Microsecond-Scale Learning4 Feb 2026
- 2025Model Selection for Off-policy Evaluation: New Algorithms and Experimental Protocol11 Feb 2025
- 2024Adaptive Q-Network: On-the-fly Target Selection for Deep Reinforcement Learning25 May 2024
- 2023When is Offline Policy Selection Sample Efficient for Reinforcement Learning?4 Dec 2023
- 2023Towards Robust Multi-Modal Reasoning via Model Selection12 Oct 2023
Similar, not cited
Close in wording, no citation either way
- 2025Enhancing Offline Model-Based RL via Active Model Selection: A Bayesian Optimization Perspective
- 2023MICRO: Model-Based Offline Reinforcement Learning with a Conservative Bellman Operator
- 2024The Role of Inherent Bellman Error in Offline Reinforcement Learning with Linear Function Approximation
- 2022Bellman Residual Orthogonalization for Offline Reinforcement Learning
- 2026Residuals-based Offline Reinforcement Learning
- 2023LLQL: Logistic Likelihood Q-Learning for Reinforcement Learning
- 2024UDQL: Bridging The Gap between MSE Loss and The Optimal Value Function in Offline Reinforcement Learning
- 2023Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Data