top of page
  • Photo du rédacteurHélène Dufour

Reinforcement Learning with Dynamic Convex Risk Measures

"We develop an approach for solving time-consistent risk-sensitive stochastic optimization problems using model-free reinforcement learning (RL). Specifically, we assume agents assess the risk of a sequence of random variables using dynamic convex risk measures. We employ a time-consistent dynamic programming principle to determine the value of a particular policy, and develop policy gradient update rules. We further develop an actor-critic style algorithm using neural networks to optimize over policies. Finally, we demonstrate the performance and flexibility of our approach by applying it to optimization problems in statistical arbitrage trading and obstacle avoidance robot control."

0 vue0 commentaire

Posts récents

Voir tout

Robust convex risk measures

"We study the general properties of robust convex risk measures as worst-case values under uncertainty on random variables. We establish general concrete results regarding convex conjugates and sub-di


Optimal cybersecurity investment depends on threat severity and bank fragility. Regulators should consider operational resilience standards, red-teaming, subsidies, and negligence penalties to facilit


bottom of page