A semismooth Newton framework for risk-averse MDPs produces three provably convergent solution methods and shows that risk-averse policy iteration is a semismooth Newton method.
Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approach
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper we address the problem of decision making within a Markov decision process (MDP) framework where risk and modeling errors are taken into account. Our approach is to minimize a risk-sensitive conditional-value-at-risk (CVaR) objective, as opposed to a standard risk-neutral expectation. We refer to such problem as CVaR MDP. Our first contribution is to show that a CVaR objective, besides capturing risk sensitivity, has an alternative interpretation as expected cost under worst-case modeling errors, for a given error budget. This result, which is of independent interest, motivates CVaR MDPs as a unifying framework for risk-sensitive and robust decision making. Our second contribution is to present an approximate value-iteration algorithm for CVaR MDPs and analyze its convergence rate. To our knowledge, this is the first solution algorithm for CVaR MDPs that enjoys error guarantees. Finally, we present results from numerical experiments that corroborate our theoretical findings and show the practicality of our approach.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Semismooth Newton Methods for Risk-Averse Markov Decision Processes
A semismooth Newton framework for risk-averse MDPs produces three provably convergent solution methods and shows that risk-averse policy iteration is a semismooth Newton method.