MICRO: Model-based Offline Reinforcement Learning With A Conservative Bellman Operator

Abstract

Offline reinforcement learning (RL) faces a significant challenge of distribution shift. Model-free offline RL penalizes the Q value for out-of-distribution (OOD) data or constrains the policy closed to the behavior policy to tackle this problem, but this inhibits the exploration of the OOD region. Model-based offline RL, which uses the trained environment model to generate more OOD data and performs conservative policy optimization within that model, has become an effective method for this problem. However, the current model-based algorithms rarely consider agent robustness when incorporating conservatism into policy. Therefore, the new model-based offline algorithm with a conservative Bellman operator (MICRO) is proposed. This method trades off performance and robustness via introducing the robust Bellman operator into the algorithm. Compared with previous model-based algorithms with robust adversarial models, MICRO can significantly reduce the computation cost by only choosing the m

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyliu2023micro

Related papers

• DOMAIN: Mildly Conservative Model-based Offline Reinforcement Learning (2023)0.00
• Mildly Conservative Q-learning For Offline Reinforcement Learning (2022)0.00
• Long-horizon Model-based Offline Reinforcement Learning Without Conservatism (2025)0.00
• Morel : Model-based Offline Reinforcement Learning (2020)0.00
• Distributionally Robust Model-based Offline Reinforcement Learning With Near-optimal Sample Complexity (2022)0.00
• Conservative Bayesian Model-based Value Expansion For Offline Policy Optimization (2022)0.00
• Overcoming Model Bias For Robust Offline Deep Reinforcement Learning (2020)11.58
• Deployment-efficient Reinforcement Learning Via Model-based Offline Optimization (2020)0.00