Policy-Coupled Risk-Averse Conformal Prediction

• The paper pioneers integrating conformal prediction with policy-driven action, ensuring that realized outcomes meet risk-averse coverage criteria.
• It introduces a two-stage procedure that approximates population-optimal prediction sets with finite-sample guarantees using outcome models and importance weighting.
• The framework accommodates both utility-quantile and worst-case loss formulations, extending to applications like medical diagnostics and energy arbitrage.

Policy-Coupled Risk-Averse Conformal Prediction (PC-RACP) denotes a class of conformal decision procedures in which prediction sets are constructed for downstream action selection, and validity is defined relative to the policy induced by those sets rather than independently of action. In the counterfactual formulation, the central validity notion is policy-coupled coverage—coverage of the realized outcome under the action induced by the prediction sets themselves—and the resulting framework admits a two-stage procedure that approximates the population-optimal sets with rigorous finite-sample coverage (Zheng et al., 2 Jul 2026). Closely related decision-theoretic work shows that prediction sets are optimal for decision makers who wish to optimize their value at risk, and that a simple max–min decision policy is optimal for such risk-averse agents (Kiyani et al., 4 Feb 2025).

1. Formal setting and scope

In its most explicit form, PC-RACP is formulated for single-stage counterfactual decision problems in the potential-outcomes framework. Features are $X \in \mathcal{X}$, actions belong to a finite action set $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$, and each action $a$ has a potential outcome $Y(a)\in\mathcal{Y}$. A policy $\pi:\mathcal{X}\to\mathcal{A}$ induces the realized outcome $Y(\pi(X))$, and decision quality is measured by a bounded utility $u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$ (Zheng et al., 2 Jul 2026).

Risk aversion is encoded through a utility certificate $\eta:\mathcal{X}\to(-\infty,u_{\max}]$ satisfying

$$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$

The associated risk-averse objective is

$$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$

and the direct optimization problem is

$\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$0

equivalently

$\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$1

This is the population RA-DPO formulation; it treats risk aversion as a high-probability lower bound on realized utility rather than an expected-utility objective (Zheng et al., 2 Jul 2026).

A broader reading of PC-RACP includes non-counterfactual settings in which the “policy” is a selection or abstention rule. In Selective Conformal Risk Control, the policy is “predict iff $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$2,” and the controlled quantity is the expected loss conditioned on selected cases, together with a minimum selection rate $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$3. The same architecture separates when to act from how to predict, which is why SCRC can be viewed as a specialization or extension of policy-coupled risk-averse conformal prediction (Xu et al., 14 Dec 2025).

2. Policy-coupled coverage and decision-theoretic optimality

Given action-indexed prediction sets $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$4, the set-induced risk-averse policy is

$\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$5

The central coverage notion is then

$\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$6

which the counterfactual paper calls policy-coupled coverage (PCC) (Zheng et al., 2 Jul 2026).

This notion is stronger than merely building per-action sets with

$\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$7

because per-action marginal coverage does not ensure that the set for the actually chosen action covers the realized outcome under the policy. The same paper distinguishes PCC from universal policy coverage,

$\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$8

and shows that PCC is the decision-relevant validity notion for the set-induced policy (Zheng et al., 2 Jul 2026).

For a fixed collection $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$9, define the ambiguity set

$a$0

Under this ambiguity set, the set-induced max–min rule is minimax-optimal: $a$1 Moreover, under PCC the quantity $a$2 itself is a valid utility certificate: $a$3 This establishes prediction sets as a lossless interface between uncertainty and action for the induced policy (Zheng et al., 2 Jul 2026).

The same decision-theoretic logic appears in the single-outcome RAC framework. There, prediction sets are shown to be optimal for decision makers who wish to optimize their value at risk, and the optimal policy for mapping a prediction set $a$4 to an action is the max–min rule

$a$5

The RAC paper further proves an equivalence between direct risk-averse policy optimization and optimization over prediction sets with marginal coverage (Kiyani et al., 4 Feb 2025).

3. Population-optimal prediction sets

The counterfactual theory derives the optimal prediction sets explicitly. For a scalar random variable $a$6, the relevant tail functional is the upper quantile

$a$7

with $a$8. For each $a$9, action $Y(a)\in\mathcal{Y}$0, and coverage parameter $Y(a)\in\mathcal{Y}$1, define

$Y(a)\in\mathcal{Y}$2

$Y(a)\in\mathcal{Y}$3

If the conditional coverage level $Y(a)\in\mathcal{Y}$4 is fixed, then the optimal per-action sets are utility super-level sets,

$Y(a)\in\mathcal{Y}$5

and they satisfy

$Y(a)\in\mathcal{Y}$6

Hence the global optimization reduces to choosing a measurable coverage-allocation function $Y(a)\in\mathcal{Y}$7: $Y(a)\in\mathcal{Y}$8 Under a uniqueness assumption for the pointwise maximizer, there exists $Y(a)\in\mathcal{Y}$9 such that

$\pi:\mathcal{X}\to\mathcal{A}$0

and the population-optimal sets are

$\pi:\mathcal{X}\to\mathcal{A}$1

The associated optimal policy is

$\pi:\mathcal{X}\to\mathcal{A}$2

with certificate

$\pi:\mathcal{X}\to\mathcal{A}$3

(Zheng et al., 2 Jul 2026).

A complementary line of work replaces the VaR-style certificate objective by a worst-case expected-loss objective. For a fixed set $\pi:\mathcal{X}\to\mathcal{A}$4, the robust loss functional is

$\pi:\mathcal{X}\to\mathcal{A}$5

where $\pi:\mathcal{X}\to\mathcal{A}$6 and $\pi:\mathcal{X}\to\mathcal{A}$7. The minimax-optimal policy for a fixed prediction-set map $\pi:\mathcal{X}\to\mathcal{A}$8 is then

$\pi:\mathcal{X}\to\mathcal{A}$9

and ROCP calibrates sets intended to minimize this robust risk while maintaining finite-sample marginal coverage (Wang et al., 1 Feb 2026). This shows that PC-RACP is compatible with both utility-quantile and worst-case expected-loss interpretations of risk aversion.

4. Finite-sample conformal construction

PC-RACP implements the population theory through a two-stage procedure on logged data $Y(\pi(X))$0, split into training, learning, and calibration subsets. On the training split, one fits outcome models $Y(\pi(X))$1 and, if needed, a behavior policy $Y(\pi(X))$2. These induce plug-in quantiles

$Y(\pi(X))$3

as well as

$Y(\pi(X))$4

and

$Y(\pi(X))$5

On the learning split, one chooses

$Y(\pi(X))$6

and defines $Y(\pi(X))$7 and the learned policy $Y(\pi(X))$8 (Zheng et al., 2 Jul 2026).

Calibration is then restricted to points whose logged action matches the learned policy,

$Y(\pi(X))$9

For $u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$0 and $u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$1, define

$u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$2

with importance weights

$u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$3

At the test point, $u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$4, and the conformal calibration parameter is

$u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$5

The final prediction sets are

$u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$6

and for $u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$7,

$u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$8

The induced max–min policy satisfies $u:\mathcal{A}\times\mathcal{Y}\to\mathbb{R}$9, and the finite-sample guarantee is

$\eta:\mathcal{X}\to(-\infty,u_{\max}]$0

(Zheng et al., 2 Jul 2026).

A strengthened finite-sample variant appears in the action-conditional framework AC-RAC. There the constraint is

$\eta:\mathcal{X}\to(-\infty,u_{\max}]$1

and the corresponding action-conditional conformal formulation requires

$\eta:\mathcal{X}\to(-\infty,u_{\max}]$2

AC-RAC calibrates action-specific thresholds through pinball-loss minimization over action-specific nonconformity scores, and yields finite-sample action-conditional validity for every action in a finite discrete action space (Zhu et al., 4 Jun 2026).

5. Related formulations and generalizations

Several adjacent frameworks illuminate what counts as “policy coupling,” what kind of risk is being controlled, and how far conformal calibration can be pushed.

Framework	Controlled quantity	Policy coupling
SCRC	Conditional risk on selected samples and minimum selection rate	Selection/abstention rule
CLCP	Per-instance loss threshold with probability $\eta:\mathcal{X}\to(-\infty,u_{\max}]$3	Loss encodes policy cost
ROCP	Worst-case expected loss under coverage-based ambiguity	Action chosen from set
AC-RAC	Action-conditional coverage and utility guarantee	Conditioning on chosen action
Anytime-valid CRC	$\eta:\mathcal{X}\to(-\infty,u_{\max}]$4, conditional risk $\eta:\mathcal{X}\to(-\infty,u_{\max}]$5 with probability $\eta:\mathcal{X}\to(-\infty,u_{\max}]$6	Sequential deployment

Selective Conformal Risk Control formulates the Selective Conformal Classification Problem

$\eta:\mathcal{X}\to(-\infty,u_{\max}]$7

subject to

$\eta:\mathcal{X}\to(-\infty,u_{\max}]$8

where

$\eta:\mathcal{X}\to(-\infty,u_{\max}]$9

Here the policy is the selection indicator $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$0, the system abstains on high-uncertainty cases, and risk is controlled conditional on acting. SCRC-T gives exact finite-sample guarantees through a transductive symmetric selection rule, whereas SCRC-I provides PAC-style guarantees using calibration data only (Xu et al., 14 Dec 2025).

Conformal Loss-Controlling Prediction replaces expected-risk control by pointwise loss control. Given nested predictors $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$1 and a bounded monotone loss $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$2, CLCP chooses $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$3 so that

$$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$4

Because the loss can be class-dependent, spatial, or otherwise policy-driven, CLCP functions as a risk-averse conformal layer for per-instance policy constraints rather than long-run average constraints (Wang et al., 2023).

Conformal Risk Control for non-monotonic losses generalizes CRC to bounded losses $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$5 with multidimensional parameters $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$6. The guarantee is expressed through algorithmic stability: if a practical algorithm $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$7 is $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$8-stable with respect to a reference algorithm $$P\bigl(u(\pi(X),Y(\pi(X)))\ge \eta(X)\bigr)\ge 1-\alpha.$$9, and the reference controls risk at level $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$0, then

$$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$1

This is directly relevant when the “policy” itself is a multidimensional parameter vector, as in multigroup debiasing or other structured decision rules (Angelopoulos, 23 Feb 2026).

Anytime-Valid Conformal Risk Control adds a time-uniform safety layer. For bounded monotone loss $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$2, it constructs $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$3 so that

$$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$4

and under known distribution shift it provides the analogous guarantee under $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$5 via importance weights. This suggests a sequential version of PC-RACP in which the prediction layer remains valid over a cumulatively growing calibration stream (Hultberg et al., 4 Feb 2026).

6. Empirical domains, interpretation, and limitations

In the counterfactual simulations and the Hillstrom email-marketing experiment, PC-RACP delivers higher utility than existing approaches while maintaining valid coverage, and the paper explicitly reports that ignoring the counterfactual structure of the decision problem is suboptimal for both validity and utility (Zheng et al., 2 Jul 2026). In the synthetic study, PC-RACP hits the nominal line $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$6 closely and achieves the highest average utility certificate across all $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$7; in Hillstrom, coverage is close to $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$8 and the method is less conservative than RAC in both set sharpness and action choice (Zheng et al., 2 Jul 2026).

Outside the counterfactual setting, the same design pattern appears in several application domains. RAC demonstrates a substantially improved trade-off between safety and utility in medical diagnosis and recommendation systems while maintaining the safety guarantee (Kiyani et al., 4 Feb 2025). AC-RAC is reported as the only method achieving valid conditional coverage across all actions on COVID-19 chest X-rays and MovieLens, with slightly larger prediction sets than marginal RAC but markedly lower critical errors (Zhu et al., 4 Jun 2026). In electricity-price arbitrage, conformal PID control yields long-run coverage around $$\nu(\pi,P):=\max\Bigl\{\mathbb{E}_P[\eta(X)] : \eta \text{ satisfies the certificate constraint}\Bigr\},$$9, and the risk-averse policy based on conformal intervals attains almost the same profit as the point-forecast policy with less than $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$00 of its purchases under a good forecaster, while turning a large loss into positive profit under a bad forecaster (Alghumayjan et al., 2024). In selective classification, SCRC-T and SCRC-I achieve target coverage and risk levels on CIFAR-10 and DRD, with nearly identical performance and superior computational practicality for the inductive variant (Xu et al., 14 Dec 2025).

A common misconception is that per-action marginal coverage suffices for counterfactual decision making. The counterfactual theory rejects this: the relevant target is coverage of the realized outcome under the action induced by the prediction sets themselves, and per-action coverage does not imply that property (Zheng et al., 2 Jul 2026). A related misconception is that conformal uncertainty is merely a reporting layer. In PC-RACP, the prediction sets determine the action through a max–min policy, and the risk measure is defined on the induced action–outcome pair rather than on predictions alone (Kiyani et al., 4 Feb 2025).

The framework also has clear limitations. The counterfactual PC-RACP theory is single-stage, uses a finite action space, assumes i.i.d. logged data, and requires a known or estimated behavior policy for importance weighting; finite-sample coverage is robust, but utility efficiency depends on the quality of the nuisance models used to approximate $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$01, $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$02, and $\mathcal{A}=\{a_1,\dots,a_{|\mathcal{A}|}\}$03 (Zheng et al., 2 Jul 2026). AC-RAC likewise relies on a finite discrete action space (Zhu et al., 4 Jun 2026). SCRC and CLCP retain the standard exchangeability assumptions of conformal methods (Xu et al., 14 Dec 2025, Wang et al., 2023). This suggests that PC-RACP is best understood as a principled conformal design pattern whose exact statistical guarantee depends on the deployment regime: marginal, action-conditional, selection-conditional, off-policy, or sequential.