mlsanityData to 7 Oct 2026

A Risk-Sensitive Approach to Policy Optimization

arXiv 2208.09106 ↗First posted 19 Aug 2022cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Standard deep reinforcement learning (DRL) aims to maximize expected reward, considering collected experiences equally in formulating a policy. This differs from human decision-making, where gains and losses are valued differently and outlying outcomes are given increased consideration. It also fails to capitalize on opportunities to improve safety and/or performance through the incorporation of distributional context. Several approaches to distributional DRL have been investigated, with one popular strategy being to evaluate the projected distribution of returns for possible actions. We propose a more direct approach whereby risk-sensitive objectives, specified in terms of the cumulative distribution function (CDF) of the distribution of full-episode rewards, are optimized. This approach allows for outcomes to be weighed based on relative quality, can be used for both continuous and discrete action spaces, and may naturally be applied in both constrained and unconstrained settings. We show how to compute an asymptotically consistent estimate of the policy gradient for a broad class of risk-sensitive objectives via sampling, subsequently incorporating variance reduction and regularization measures to facilitate effective on-policy learning. We then demonstrate that the use of moderately "pessimistic" risk profiles, which emphasize scenarios where the agent performs poorly, leads to enhanced exploration and a continual focus on addressing deficiencies. We test the approach using different risk profiles in six OpenAI Safety Gym environments, comparing to state of the art on-policy methods. Without cost constraints, we find that pessimistic risk profiles can be used to reduce cost while improving total reward accumulation. With cost constraints, they are seen to provide higher positive rewards than risk-neutral approaches at the prescribed allowable cost.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 20 of its 45 references that are in the map. First posted on arXiv 19 Aug 2022.

Builds on

20 of 45 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2015Trust Region Policy Optimizationcited by 2,503
  4. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  5. 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,168
  6. 2017Constrained Policy Optimizationcited by 928
  7. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  8. 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
  9. 2018Reward Constrained Policy Optimizationcited by 397
  10. 2018Implicit Quantile Networks for Distributional Reinforcement Learningcited by 362
  11. 2019Constrained Reinforcement Learning Has Zero Duality Gapcited by 144
  12. 2019Lyapunov-based Safe Policy Optimization for Continuous Controlcited by 140
8 more
  1. 2020Distributional Soft Actor-Critic: Off-Policy Reinforcement Learning for Addressing Value Estimation Errorscited by 80
  2. 2015Policy Gradient for Coherent Risk Measurescited by 74
  3. 2021Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learningcited by 42
  4. 2015Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Controlcited by 34
  5. 2020Cautious Reinforcement Learning via Distributional Risk in the Dual Domaincited by 18
  6. 2018Clipped Action Policy Gradientcited by 17
  7. 2021Robust Risk-Aware Reinforcement Learningcited by 17
  8. 2020Risk-Sensitive Deep RL: Variance-Constrained Actor-Critic Provably Finds Globally Optimal Policycited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 3.

6 papers.