English

Algorithms for CVaR Optimization in MDPs

Artificial Intelligence 2014-07-14 v3 Optimization and Control

Abstract

In many sequential decision-making problems we may want to manage risk by minimizing some measure of variability in costs in addition to minimizing a standard criterion. Conditional value-at-risk (CVaR) is a relatively new risk measure that addresses some of the shortcomings of the well-known variance-related risk measures, and because of its computational efficiencies has gained popularity in finance and operations research. In this paper, we consider the mean-CVaR optimization problem in MDPs. We first derive a formula for computing the gradient of this risk-sensitive objective function. We then devise policy gradient and actor-critic algorithms that each uses a specific method to estimate this gradient and updates the policy parameters in the descent direction. We establish the convergence of our algorithms to locally risk-sensitive optimal policies. Finally, we demonstrate the usefulness of our algorithms in an optimal stopping problem.

Keywords

Cite

@article{arxiv.1406.3339,
  title  = {Algorithms for CVaR Optimization in MDPs},
  author = {Yinlam Chow and Mohammad Ghavamzadeh},
  journal= {arXiv preprint arXiv:1406.3339},
  year   = {2014}
}

Comments

Submitted to NIPS 14

R2 v1 2026-06-22T04:37:29.066Z