Pith. sign in

REVIEW 2 cited by

Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1506.02188 v1 pith:4CBXW2ZS submitted 2015-06-06 cs.AI math.OC

classification cs.AImath.OC
keywords cvarapproachdecisionmdpsrisk-sensitivealgorithmcontributionerror
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. History-Dependent Recursive Preferences in Markov Decision Processes

    math.OC 2026-07 conditional novelty 6.0 of 10

    History-dependent recursive preferences have a canonical minimal preference-augmented state and Bellman recursion when certainty-equivalent richness and separability axioms hold.

  2. Semismooth Newton Methods for Risk-Averse Markov Decision Processes

    math.OC 2025-01 conditional novelty 6.0 of 10

    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.

Pith tools