Constraint-Adaptive Policy Switching for Offline Safe Reinforcement Learning

Authors

  • Yassine Chemingui Washington State University
  • Aryan Deshwal University of Minnesota - Twin Cities
  • Honghao Wei Washington State University
  • Alan Fern Oregon State University
  • Jana Doppa Washington State University

DOI:

https://doi.org/10.1609/aaai.v39i15.33726

Abstract

Offline safe reinforcement learning (OSRL) involves learning a decision-making policy to maximize rewards from a fixed batch of training data to satisfy pre-defined safety constraints. However, adapting to varying safety constraints during deployment without retraining remains an under-explored challenge. To address this challenge, we introduce constraint-adaptive policy switching (CAPS), a wrapper framework around existing offline RL algorithms. During training, CAPS uses offline data to learn multiple policies with a shared representation that optimize different reward and cost trade-offs. During testing, CAPS switches between those policies by selecting at each state the policy that maximizes future rewards among those that satisfy the current cost constraint. Our experiments on 38 tasks from the DSRL benchmark demonstrate that CAPS consistently outperforms existing methods, establishing a strong wrapper-based baseline for OSRL.

Published

2025-04-11

How to Cite

Chemingui, Y., Deshwal, A., Wei, H., Fern, A., & Doppa, J. (2025). Constraint-Adaptive Policy Switching for Offline Safe Reinforcement Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 39(15), 15722–15730. https://doi.org/10.1609/aaai.v39i15.33726

Issue

Section

AAAI Technical Track on Machine Learning I