English

COptiDICE: Offline Constrained Reinforcement Learning via Stationary Distribution Correction Estimation

Machine Learning 2022-04-20 v1 Artificial Intelligence

Abstract

We consider the offline constrained reinforcement learning (RL) problem, in which the agent aims to compute a policy that maximizes expected return while satisfying given cost constraints, learning only from a pre-collected dataset. This problem setting is appealing in many real-world scenarios, where direct interaction with the environment is costly or risky, and where the resulting policy should comply with safety constraints. However, it is challenging to compute a policy that guarantees satisfying the cost constraints in the offline RL setting, since the off-policy evaluation inherently has an estimation error. In this paper, we present an offline constrained RL algorithm that optimizes the policy in the space of the stationary distribution. Our algorithm, COptiDICE, directly estimates the stationary distribution corrections of the optimal policy with respect to returns, while constraining the cost upper bound, with the goal of yielding a cost-conservative policy for actual constraint satisfaction. Experimental results show that COptiDICE attains better policies in terms of constraint satisfaction and return-maximization, outperforming baseline algorithms.

Keywords

Cite

@article{arxiv.2204.08957,
  title  = {COptiDICE: Offline Constrained Reinforcement Learning via Stationary Distribution Correction Estimation},
  author = {Jongmin Lee and Cosmin Paduraru and Daniel J. Mankowitz and Nicolas Heess and Doina Precup and Kee-Eung Kim and Arthur Guez},
  journal= {arXiv preprint arXiv:2204.08957},
  year   = {2022}
}

Comments

24 pages, 6 figures, Accepted at ICLR 2022 (spotlight)

R2 v1 2026-06-24T10:52:17.032Z