Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning

James McCarthy, Radu Marinescu, Elizabeth Daly, Ivana Dusparic
7/11/2025
cs.LGcs.AI

No official code found. Best implementation: jamesgmccarthy/ECAI2025-ORAC-SupplementalMaterial (0 stars, last commit 2025-08-26).

Abstract

Risk-averse Constrained Reinforcement Learning (RaCRL) aims to learn policies that minimise the likelihood of rare and catastrophic constraint violations caused by an environment's inherent randomness. In general, risk-aversion leads to conservative exploration of the environment which typically results in converging to sub-optimal policies that fail to adequately maximise reward or, in some cases, fail to achieve the goal. In this paper, we propose an exploration-based approach for RaCRL called Optimistic Risk-averse Actor Critic (ORAC), which constructs an exploratory policy by maximising a local upper confidence bound of the state-action reward value function whilst minimising a local lower confidence bound of the risk-averse state-action cost value function. Specifically, at each step, the weighting assigned to the cost value is increased or decreased if it exceeds or falls below the safety constraint value. This way the policy is encouraged to explore uncertain regions of the environment to discover high reward states whilst still satisfying the safety constraints. Our experimental results demonstrate that the ORAC approach prevents convergence to sub-optimal policies and improves significantly the reward-cost trade-off in various continuous control tasks such as Safety-Gymnasium and a complex building energy management environment CityLearn.

View on arXivView PDF

Code Implementations(1)

Supplemental Material for our paper Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning at ECAI 2025

00Aug 26, 20251 years ago

Similar Papers

Cite this paper

@article{mccarthy2025optimistic,
  title  = {Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning},
  author = {James McCarthy and Radu Marinescu and Elizabeth Daly and Ivana Dusparic},
  year   = {2025},
  eprint = {2507.08793},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.08793v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.08793.svg)](https://codeofpaper.com/paper/2507.08793)

Discussion