Planning and Learning in Average Risk-aware MDPs
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
For continuing tasks, average cost Markov decision processes have well-documented value and can be solved using efficient algorithms. However, it explicitly assumes that the agent is risk-neutral. In this work, we extend risk-neutral algorithms to accommodate the more general class of dynamic risk measures. Specifically, we propose a relative value iteration (RVI) algorithm for planning and design two model-free Q-learning algorithms, namely a generic algorithm based on the multi-level Monte Carlo (MLMC) method, and an off-policy algorithm dedicated to utility-based shortfall risk measures. Both the RVI and MLMC-based Q-learning algorithms are proven to converge to optimality. Numerical experiments validate our analysis, confirm empirically the convergence of the off-policy algorithm, and demonstrate that our approach enables the identification of policies that are finely tuned to the intricate risk-awareness of the agent that they serve.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 19 of its 52 references that are in the map. First posted on arXiv 22 Mar 2025.
Builds on
19 of 52 references.
Closest ancestors · 2
Same direction, newest first
- 2024Q-learning for Quantile MDPs: A Decomposition, Performance, and Convergence Analysis31 Oct
- 2024On Convergence of Average-Reward Q-Learning in Weakly Communicating Markov Decision Processes29 Aug
Other references · 17
- 2015Risk-Constrained Reinforcement Learning with Percentile Risk Criteriacited by 337
- 2013Risk-sensitive Reinforcement Learningcited by 130
- 2014Optimizing the CVaR via Samplingcited by 99
- 2014Algorithms for CVaR Optimization in MDPscited by 99
- 2020Learning and Planning in Average-Reward Markov Decision Processescited by 54
- 2023A Finite Sample Complexity Bound for Distributionally Robust Q-learningcited by 36
- 2023Sample Complexity of Variance-reduced Distributionally Robust Q-learningcited by 29
- 2019Discounted Reinforcement Learning Is Not an Optimization Problemcited by 26
- 2023Robust Average-Reward Markov Decision Processescited by 22
- 2023Model-Free Robust Average-Reward Reinforcement Learningcited by 20
- 2019A Wasserstein distance approach for concentration of empirical risk estimatescited by 18
- 2019Unbiased Multilevel Monte Carlo: Stochastic Optimization, Steady-state Simulation, Quantiles, and Other Applicationscited by 18
5 more
- 2020Risk-Averse Learning by Temporal Difference Methodscited by 13
- 2022A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDPcited by 13
- 2022Ergodic Risk-sensitive control -- A surveycited by 4
- 2014On Average Risk-sensitive Markov Control Processescited by 1
- 2019On the relative value iteration with a risk-sensitive criterioncited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Bayesian Risk-Sensitive Policy Optimization For MDPs With General Loss Functions
- 2025Risk-Averse Total-Reward Reinforcement Learning
- 2026Risk-Aware General-Utility Markov Decision Processes
- 2021An Offline Risk-aware Policy Selection Method for Bayesian Markov Decision Processes
- 2025Efficient Algorithms for Mitigating Uncertainty and Risk in Reinforcement Learning
- 2024Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning
- 2025Recursive Entropic Risk Optimization in Discounted MDPs: Sample Complexity Bounds with a Generative Model
- 2025An Actor-Critic Algorithm with Function Approximation for Risk Sensitive Cost Markov Decision Processes