Iterated Conditional Value-at-Risk (ICVaR)

• ICVaR is a dynamic risk measure that recursively applies the Conditional Value-at-Risk operator at each decision stage.
• It generalizes the expectation criterion by emphasizing tail risk, fostering robust planning in uncertain MDPs and POMDPs.
• ICVaR’s formulation bridges robust optimization and reinforcement learning, offering theoretical guarantees and improved risk-sensitive performance.

Iterated Conditional Value-at-Risk (ICVaR) is a dynamic risk measure designed for sequential decision problems, formalizing risk aversion by recursively applying the Conditional Value-at-Risk (CVaR) operator at each decision stage. ICVaR generalizes the standard expectation criterion to account for tail risk, enabling robust, risk-sensitive planning and reinforcement learning in both Markov Decision Processes (MDPs) and Partially Observable MDPs (POMDPs). Its formulation, analysis, and implementation offer key connections to robust optimization and distributional robustness, supporting finite- and infinite-horizon planning under uncertainty and partial observability (Pariente et al., 28 Jan 2026, Deng et al., 11 Mar 2025).

1. Conditional Value-at-Risk: Static and Dynamic Formulations

The static Conditional Value-at-Risk (CVaR) for a real random variable $Z$ with distribution $P$ and level $\alpha \in (0,1)$ is defined in several equivalent forms:

• Value-at-Risk (VaR): $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$.
• Primal (Rockafellar–Uryasev) form:

$$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$

• Dual (coherent risk) representation:

$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$

• Conditional expectation characterization: $$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$ under CDF continuity.

The “Iterated” CVaR (ICVaR) recurses the CVaR operator through the stages of a sequential process. For a finite-horizon POMDP or MDP, with belief (or state) $b_t$ at stage $t$, chosen action $a_t$, cost $P$0, discount $P$1, and policy $P$2, the recursion is

$P$3

$P$4

or, more generally,

$P$5

This Bellman-like recursion replaces the expectation with the CVaR, rendering the problem risk-averse (Pariente et al., 28 Jan 2026, Deng et al., 11 Mar 2025).

2. Risk Parameterization and Interpretation

The risk parameter $P$6 (or $P$7 in some formulations) modulates the degree of risk sensitivity:

• For $P$8, $P$9, and ICVaR reduces to the standard risk-neutral expectation.
• For $\alpha \in (0,1)$0, $\alpha \in (0,1)$1 emphasizes the worst $\alpha \in (0,1)$2-fraction of the distribution, conferring increasing risk aversion for smaller $\alpha \in (0,1)$3 by focusing on extreme losses.

In reinforcement learning and planning, the ICVaR objective enforces a stepwise “worst-$\alpha \in (0,1)$4-tail” attitude at each transition, yielding more cautious, conservative policies than the risk-neutral case (Pariente et al., 28 Jan 2026, Deng et al., 11 Mar 2025).

3. ICVaR Bellman Operators, Robustness, and Theoretical Equivalences

In the infinite-horizon MDP setting, the ICVaR action-value and value functions satisfy:

$\alpha \in (0,1)$5

where $\alpha \in (0,1)$6 are state-action pairs and $\alpha \in (0,1)$7 the transition distribution (Deng et al., 11 Mar 2025).

By virtue of the dual representation, ICVaR is equivalent to a distributionally robust MDP with an $\alpha \in (0,1)$8-rectangular uncertainty set:

$\alpha \in (0,1)$9

with the robust Bellman operator

$$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$0

This connection establishes that ICVaR can be viewed as robust dynamic programming against next-stage model perturbations with restricted probability inflation (Deng et al., 11 Mar 2025).

4. Algorithms for ICVaR: Policy Evaluation and Planning

Policy Evaluation and Finite-Sample Guarantees in POMDPs

For finite-horizon POMDPs, policy evaluation under ICVaR is achieved via Monte Carlo sampling in a particle-belief MDP (PB-MDP). Successor beliefs are sampled, and for each, the value is recursively estimated. The sample CVaR estimator is given by

$$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$1

Finite-time high-probability bounds are established for estimates $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$2:

$$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$3

with explicit expression for $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$4, and a symmetric lower bound (Pariente et al., 28 Jan 2026).

ICVaR Value Iteration with a Generative Model

In tabular discounted MDPs, with generative model access, the ICVaR-VI algorithm repeats:

$$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$5

with policy $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$6 (Deng et al., 11 Mar 2025).

Incorporation into Online Planners in POMDPs

Three prominent POMDP online planners have been extended for ICVaR objectives (Pariente et al., 28 Jan 2026):

• ICVaR Sparse Sampling: Enumerates actions at each belief, computes $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$7 for each, and selects the lowest.
• ICVaR-PFT-DPW: Implements progressive widening tailored to ICVaR, with expansions and UCB-like selection rules derived from the finite-sample bound, and full CVaR backpropagation.
• ICVaR-POMCPOW: Adapts observation widening and state sampling, using CVaR at each backup rather than expected value.

The key algorithmic difference relative to risk-neutral planners is replacement of averages and mean-based confidence bounds with CVaR estimators and ICVaR-specific bounds.

5. Sample Complexity and Robustness Results

The sample complexity of ICVaR for $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$8-optimality with high probability in tabular, discounted MDPs is nearly tight (Deng et al., 11 Mar 2025):

• Upper bound: $$\operatorname{VaR}_\alpha(Z) = \inf \{ u \in \mathbb{R}: P(Z \leq u) \geq 1-\alpha \}$$9, where $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$0 are the sizes of state and action spaces.
• When $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$1: Bound improves to $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$2.
• Lower bound: $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$3.
• Worst-Path Limit ($$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$4): Sample complexity becomes $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$5, decoupling from $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$6 and $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$7, with $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$8 the minimal nonzero transition probability.

Table: Sample Complexity of ICVaR RL

Regime	Upper Bound	Lower Bound
General $$\operatorname{CVaR}_\alpha(Z) = \min_{u \in \mathbb{R}} \left\{ u + \frac{1}{1-\alpha} \mathbb{E}[(Z-u)^{+}] \right\}.$$9	$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$0	$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$1
Large risk $$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$2	$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$3	$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$4
Worst-path $$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$5	$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$6	$$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$7

These results highlight that higher risk aversion (smaller $$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$8) increases sample complexity, reflecting the statistical challenge of robustly estimating rare tail events.

6. Benchmarking and Empirical Outcomes

Empirical evaluations in POMDP benchmarks (LaserTag, LightDark) revealed that ICVaR-optimized planners substantially reduce tail risk relative to risk-neutral planners (Pariente et al., 28 Jan 2026). The following table summarizes reported outcomes (ICVaR objective with $$\operatorname{CVaR}_\alpha(Z) = \sup_{Q \ll P,\, dQ/dP \leq 1/(1-\alpha)} \mathbb{E}_Q[Z].$$9, lower is better):

Method	LaserTag (mean ICVaR$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$0)	LightDark (mean ICVaR$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$1)
POMCPOW	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$2	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$3
ICVaR-POMCPOW	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$4	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$5
PFT-DPW	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$6	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$7
ICVaR-PFT-DPW	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$8	$$\operatorname{CVaR}_\alpha(Z) = \mathbb{E}[Z | Z > \operatorname{VaR}_\alpha(Z)]$$9

ICVaR-enhanced planners yielded up to 51% reduction in upper-tail costs, confirming the practical benefits of risk-sensitive optimization for safety-critical sequential decision-making.

7. Discussion and Open Directions

ICVaR provides a principled and tractable dynamic risk measure for sequential decision problems under uncertainty, with robust connections to distributionally robust optimization and established theoretical guarantees on convergence and sample complexity. The stepwise CVaR approach enables tuning the degree of risk aversion through $b_t$0, adapting policy robustness to application needs. Open questions include extending ICVaR approaches to problems with function approximation, optimizing over broader classes of coherent risk measures, and refining constants in sample-complexity bounds. The robust-MDP equivalence allows importation and extension of existing analysis techniques, suggesting continued synergy between robust control and risk-averse reinforcement learning (Pariente et al., 28 Jan 2026, Deng et al., 11 Mar 2025).