pith. sign in

arxiv: 2505.04553 · v2 · pith:7TOOUNCGnew · submitted 2025-05-07 · 💱 q-fin.MF · cs.AI· q-fin.RM

Risk-sensitive Reinforcement Learning Based on Convex Scoring Functions

classification 💱 q-fin.MF cs.AIq-fin.RM
keywords algorithmproposeauxiliaryclassconvexfunctionslearningproblem
0
0 comments X
read the original abstract

We propose a reinforcement learning (RL) framework under a broad class of risk objectives, characterized by convex scoring functions. This class covers many common risk measures, such as variance, Expected Shortfall, entropic Value-at-Risk, and mean-risk utility. To resolve the time-inconsistency issue, we consider an augmented state space and an auxiliary variable and recast the problem as a two-state optimization problem. We propose a customized Actor-Critic algorithm and establish some theoretical approximation guarantees. A key theoretical contribution is that our results do not require the Markov decision process to be continuous. Additionally, we propose an auxiliary variable sampling method inspired by the alternating minimization algorithm, which is convergent under certain conditions. We validate our approach in simulation experiments with a financial application in statistical arbitrage trading, demonstrating the effectiveness of the algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. When Does Trajectory-Level Supervision Permit Efficient Offline Reinforcement Learning?

    stat.ML 2026-06 unverdicted novelty 6.0

    Proposes OPAC for trajectory-level offline RL achieving 𝓣O(H^{2}√(C_sa(π*)/n)) bounds with matching lower bound, plus conditions for tractability in generalized nonlinear outcome settings.