Risk-Averse Constrained Reinforcement Learning with Optimized Certainty Equivalents
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917117220093952 |
|---|---|
| author | Lee, Jane H. Saglam, Baturay Pougkakiotis, Spyridon Karbasi, Amin Kalogerias, Dionysis |
| author_facet | Lee, Jane H. Saglam, Baturay Pougkakiotis, Spyridon Karbasi, Amin Kalogerias, Dionysis |
| contents | Constrained optimization provides a common framework for dealing with conflicting objectives in reinforcement learning (RL). In most of these settings, the objectives (and constraints) are expressed though the expected accumulated reward. However, this formulation neglects risky or even possibly catastrophic events at the tails of the reward distribution, and is often insufficient for high-stakes applications in which the risk involved in outliers is critical. In this work, we propose a framework for risk-aware constrained RL, which exhibits per-stage robustness properties jointly in reward values and time using optimized certainty equivalents (OCEs). Our framework ensures an exact equivalent to the original constrained problem within a parameterized strong Lagrangian duality framework under appropriate constraint qualifications, and yields a simple algorithmic recipe which can be wrapped around standard RL solvers, such as PPO. Lastly, we establish the convergence of the proposed algorithm under common assumptions, and verify the risk-aware properties of our approach through several numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_20199 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Risk-Averse Constrained Reinforcement Learning with Optimized Certainty Equivalents Lee, Jane H. Saglam, Baturay Pougkakiotis, Spyridon Karbasi, Amin Kalogerias, Dionysis Machine Learning Constrained optimization provides a common framework for dealing with conflicting objectives in reinforcement learning (RL). In most of these settings, the objectives (and constraints) are expressed though the expected accumulated reward. However, this formulation neglects risky or even possibly catastrophic events at the tails of the reward distribution, and is often insufficient for high-stakes applications in which the risk involved in outliers is critical. In this work, we propose a framework for risk-aware constrained RL, which exhibits per-stage robustness properties jointly in reward values and time using optimized certainty equivalents (OCEs). Our framework ensures an exact equivalent to the original constrained problem within a parameterized strong Lagrangian duality framework under appropriate constraint qualifications, and yields a simple algorithmic recipe which can be wrapped around standard RL solvers, such as PPO. Lastly, we establish the convergence of the proposed algorithm under common assumptions, and verify the risk-aware properties of our approach through several numerical experiments. |
| title | Risk-Averse Constrained Reinforcement Learning with Optimized Certainty Equivalents |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2510.20199 |