DROMO: Distributionally Robust Offline Model-based Policy Optimization
On the map: Offline RL and imitation learning from data → Offline RL algorithms
Abstract (arXiv)
We consider the problem of offline reinforcement learning with model-based control, whose goal is to learn a dynamics model from the experience replay and obtain a pessimism-oriented agent under the learned model. Current model-based constraint includes explicit uncertainty penalty and implicit conservative regularization that pushes Q-values of out-of-distribution state-action pairs down and the in-distribution up. While the uncertainty estimation, on which the former relies on, can be loosely calibrated for complex dynamics, the latter performs slightly better. To extend the basic idea of regularization without uncertainty quantification, we propose distributionally robust offline model-based policy optimization (DROMO), which leverages the ideas in distributionally robust optimization to penalize a broader range of out-of-distribution state-action pairs beyond the standard empirical out-of-distribution Q-value minimization. We theoretically show that our method optimizes a lower bound on the ground-truth policy evaluation, and it can be incorporated into any existing policy gradient algorithms. We also analyze the theoretical properties of DROMO's linear and non-linear instantiations.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. Builds on 45 of its 70 references that are in the map. First posted on arXiv 15 Sep 2021.
Builds on
45 of 70 references.
Closest ancestors · 6
Same direction, newest first
- 2020PLAS: Latent Action Space for Offline Reinforcement Learning14 Nov
- 2020Conservative Q-Learning for Offline Reinforcement Learning8 Jun
- 2020MOPO: Model-based Offline Policy Optimization27 May
- 2020MOReL : Model-Based Offline Reinforcement Learning12 May
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems4 May
- 2020Keep Doing What Worked: Behavioral Modelling Priors for Offline Reinforcement Learning19 Feb
Other references · 39
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2015Trust Region Policy Optimizationcited by 2,580
- 2019Scalability in Perception for Autonomous Driving: Waymo Open Datasetcited by 2,451
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2018BDD100K: A Diverse Driving Dataset for Heterogeneous Multitask Learningcited by 1,288
- 2018Learning Latent Dynamics for Planning from Pixelscited by 1,264
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
- 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
- 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 773
27 more
- 2018QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulationcited by 743
- 2016Deep Exploration via Bootstrapped DQNcited by 527
- 2017Safe Model-based Reinforcement Learning with Stability Guaranteescited by 366
- 2016Safe, Multi-Agent, Reinforcement Learning for Autonomous Drivingcited by 311
- 2019Verified Uncertainty Calibrationcited by 309
- 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 287
- 2019Way Off-Policy Batch Deep Reinforcement Learning of Implicit Human Preferences in Dialogcited by 284
- 2015Embed to Control: A Locally Linear Latent Dynamics Model for Control from Raw Imagescited by 274
- 2019DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Correctionscited by 254
- 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 227
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 219
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2018Deep Reinforcement Learning and the Deadly Triadcited by 174
- 2016Variance-based regularization with convex objectivescited by 155
- 2017Safe Policy Improvement with Baseline Bootstrappingcited by 144
- 2017Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximationcited by 121
- 2020Deployment-Efficient Reinforcement Learning via Model-Based Offline Optimizationcited by 120
- 2018Plan Online, Learn Offline: Efficient Learning and Exploration via Model-Based Controlcited by 113
- 2018Deep Imitative Models for Flexible Inference, Planning, and Controlcited by 76
- 2019Diagnosing Bottlenecks in Deep Q-learning Algorithmscited by 73
- 2018Efficient Exploration through Bayesian Deep Q-Networkscited by 67
- 2019Off-Policy Deep Reinforcement Learning by Bootstrapping the Covariate Shiftcited by 47
- 2017Stein Variational Policy Gradientcited by 44
- 2021Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvaturecited by 32
- 2018Variational Bayesian Reinforcement Learning with Regret Boundscited by 31
- 2019Calibrated Model-Based Deep Reinforcement Learningcited by 31
- 2019Learning Self-Correctable Policies and Value Functions from Demonstrations with Negative Samplingcited by 8
Built on by
Citing papers per year: 2023: 1; 2024: 2.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2023Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
- 2023Double Pessimism is Provably Efficient for Distributionally Robust Offline Reinforcement Learning: Generic Algorithm and Robust Partial Coverage
- 2021COMBO: Conservative Offline Model-Based Policy Optimization
- 2023Model-based Offline Reinforcement Learning with Local Misspecification
- 2024Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
- 2022Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
- 2026Offline Policy Optimization with Posterior Sampling
- 2026Robust Regularized Policy Iteration under Transition Uncertainty