Regret Bounds for Risk-Sensitive Reinforcement Learning
Osbert Bastani, Yecheng Jason Ma, Estelle Shen, Wanqiao Xu
Abstract
In safety-critical applications of reinforcement learning such as healthcare and robotics, it is often desirable to optimize risk-sensitive objectives that account for tail outcomes rather than expected reward. We prove the first regret bounds for reinforcement learning under a general class of risk-sensitive objectives including the popular CVaR objective. Our theory is based on a novel characterization of the CVaR objective as well as a novel optimistic MDP construction.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 19cd2db4-ce6a-49b7-9a4a-7368524b0ee2Cited by top-tier papers20
- Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaRKaiwen Wang, Nathan Kallus, Wen SunICML 2023 · 36 citations
- Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty EquivalentsWenhao Xu, Xuefeng Gao, Xuedong HeICML 2023 · 14 citations
- Provably Efficient Iterated CVaR Reinforcement Learning with Function Approximation and Human FeedbackYu Chen, Yihan Du, Pihe Hu, Siwei Wang et al.ICLR 2024 · 12 citations
- RA-PbRL: Provably Efficient Risk-Aware Preference-Based Reinforcement LearningYujie Zhao, Jose E. Aguilar Escamilla, Weyl Lu, Huazheng WangNeurIPS 2024 · 11 citations
- Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative ModelMark Rowland, Kevin Kevin Li, Rémi Munos, Clare Lyle et al.NeurIPS 2024 · 9 citations
Builds on4
- Conservative Offline Distributional Reinforcement LearningYecheng Jason Ma, Dinesh Jayaraman, Osbert BastaniNeurIPS 2021 · 118 citations
- Being Optimistic to Be Conservative: Quickly Learning a CVaR PolicyRamtin Keramati, Christoph Dann, Alex Tamkin, Emma BrunskillAAAI 2020 · 86 citations
- Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement LearningYingjie Fei, Zhuoran Yang, Yudong Chen, Zhaoran WangNeurIPS 2021 · 70 citations
- Risk-Sensitive Reinforcement Learning with Function Approximation: A Debiasing ApproachYingjie Fei, Zhuoran Yang, Zhaoran WangICML 2021 · 53 citations
Related papers
- Provably Efficient Risk-Sensitive Reinforcement Learning: Iterated CVaR and Worst PathYihan Du, Siwei Wang, Longbo HuangICLR 2023 · 2 citations
- A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty EquivalentsKaiwen Wang, Dawen Liang, Nathan Kallus, Wen SunICML 2025
- Predictive CVaR Q-learningJu-Hyun Kim, Seungki MinICLR 2026
- Beyond CVaR: Leveraging Static Spectral Risk Measures for Enhanced Decision-Making in Distributional Reinforcement LearningMehrdad Moghimi, Hyejin KuICML 2025
- Boosted CVaR ClassificationRuntian Zhai, Chen Dan, Arun Sai Suggala, J. Zico Kolter et al.NeurIPS 2021 · 17 citations
