Conformal Risk Sharing Framework

• Conformal Risk Sharing is a method that redistributes uncertain costs among agents by setting finite-sample, distribution-free per-agent caps.
• It employs a one-parameter linear mixing policy to balance tail-risk reduction with participation guarantees via structured pooling.
• The framework uses split conformal calibration and order statistics to certify capped obligations without relying on parametric models.

Conformal Risk Sharing is a framework for redistributing uncertain costs across a group of $n$ agents so as to reduce extreme individual burdens, certify a high-confidence cap on each agent’s future obligation without parametric assumptions, and ensure that no agent is made materially worse off relative to bearing their own cost (Kazlauskaite, 4 Jun 2026). The framework is introduced in “Conformal Risk Sharing: Certified Cost Allocation with Participation Guarantees” and is formulated as a finite-sample decision problem under exchangeability: from observed joint-loss blocks, select a redistribution rule, calibrate per-agent obligation caps, and deploy the rule only when aggregate harm is bounded (Kazlauskaite, 4 Jun 2026).

1. Certified allocation problem

The paper formalises the setting through $B$ exchangeable blocks of joint losses $\tilde x_1,\dots,\tilde x_B$, where each $\tilde x_b\in\mathbb{R}_+^n$ is drawn from an unknown distribution $P$, and agent $i$’s raw loss in block $b$ is $\tilde x_{b,i}$ (Kazlauskaite, 4 Jun 2026). A linear allocation policy $A\in\mathbb{R}^{n\times n}$ redistributes total cost within each block according to

$$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$

Feasibility is enforced by requiring $B$0 to be row-stochastic,

$B$1

so conservation and nonnegativity are built into the admissible policy class (Kazlauskaite, 4 Jun 2026). The baseline no-pooling policy is $B$2.

For any policy $B$3, the random obligation of agent $B$4 is denoted $B$5, and the target risk functional is the $B$6-quantile

$B$7

identified in the paper as Value-at-Risk at level $B$8 (Kazlauskaite, 4 Jun 2026). The resulting Certified Allocation Problem is to use the finite sample $B$9 to jointly select a policy $\tilde x_1,\dots,\tilde x_B$0 and per-agent caps $\tilde x_1,\dots,\tilde x_B$1 satisfying four requirements (Kazlauskaite, 4 Jun 2026).

The first requirement is per-agent tail validity: $\tilde x_1,\dots,\tilde x_B$2 for each $\tilde x_1,\dots,\tilde x_B$3, distribution-free (Kazlauskaite, 4 Jun 2026). The second is aggregate efficiency: $\tilde x_1,\dots,\tilde x_B$4 with weights $\tilde x_1,\dots,\tilde x_B$5 and $\tilde x_1,\dots,\tilde x_B$6 (Kazlauskaite, 4 Jun 2026). The third is participation, expressed as bounded harm: $\tilde x_1,\dots,\tilde x_B$7 where $\tilde x_1,\dots,\tilde x_B$8 is a materiality threshold and $\tilde x_1,\dots,\tilde x_B$9 is a budget fraction (Kazlauskaite, 4 Jun 2026). The fourth requirement is conservation of total cost, already enforced through $\tilde x_b\in\mathbb{R}_+^n$0 (Kazlauskaite, 4 Jun 2026).

This formulation makes participation an explicit deployability condition rather than an informal desideratum. A common misunderstanding is to treat risk pooling as beneficial whenever aggregate exposure falls. The framework rejects that view: a pool is not credible if some participants face materially larger certified liabilities and therefore have reason to leave (Kazlauskaite, 4 Jun 2026).

2. Policy class, pooling structure, and sharing intensity

Conformal Risk Sharing restricts attention to a one-parameter family of linear mixing policies

$\tilde x_b\in\mathbb{R}_+^n$1

where $\tilde x_b\in\mathbb{R}_+^n$2 is a fixed or pre-trained base rule encoding the pooling structure (Kazlauskaite, 4 Jun 2026). Examples listed in the paper include uniform pooling with $\tilde x_b\in\mathbb{R}_+^n$3, a spatial locality kernel, and a data-driven variance-optimal doubly-stochastic matrix (Kazlauskaite, 4 Jun 2026). The scalar $\tilde x_b\in\mathbb{R}_+^n$4 governs pooling intensity: $\tilde x_b\in\mathbb{R}_+^n$5 corresponds to no pooling and $\tilde x_b\in\mathbb{R}_+^n$6 to full base-rule pooling (Kazlauskaite, 4 Jun 2026).

Because both $\tilde x_b\in\mathbb{R}_+^n$7 and $\tilde x_b\in\mathbb{R}_+^n$8 are row-stochastic, $\tilde x_b\in\mathbb{R}_+^n$9 is row-stochastic as well (Kazlauskaite, 4 Jun 2026). This preserves feasibility while reducing the policy search space to a single interpretable control parameter. In practice, the paper describes a two-part design step: one may first learn $P$0 from training data via a variance-minimisation proxy, and then grid-search over $P$1 to trade off aggregate tail-risk reduction against proxy harm (Kazlauskaite, 4 Jun 2026).

The policy class is deliberately simple. It does not attempt to solve a fully unconstrained high-dimensional redistribution problem; instead, it combines a structured pooling graph or matrix with a scalar intensity parameter (Kazlauskaite, 4 Jun 2026). This suggests that interpretability is treated as part of the mechanism design: the base rule specifies who pools with whom, while $P$2 specifies how strongly the pool operates.

The paper’s design also separates structural choice from statistical certification. That separation is technically important, because the later conformal guarantee is attached to the selected policy after fitting and selection have been completed on non-calibration data (Kazlauskaite, 4 Jun 2026).

3. Split conformal calibration and certified caps

The certification step uses a random split of the $P$3 blocks into a training set $P$4, a validation set $P$5, and a calibration set $P$6 of size $P$7 (Kazlauskaite, 4 Jun 2026). Policy fitting and $P$8-selection use only $P$9. Once a candidate $i$0 is fixed, the calibration set is reserved for one-shot conformal calibration (Kazlauskaite, 4 Jun 2026).

For each agent $i$1, the calibration obligations $i$2 are computed and the certified cap is defined as the $i$3-th smallest calibration obligation,

$i$4

Under the block-exchangeability assumption—stated as the calibration blocks together with a fresh block being exchangeable conditional on $i$5—the paper proves the per-agent tail certificate

$i$6

for each $i$7 (Kazlauskaite, 4 Jun 2026). Accordingly, $i$8 is a finite-sample, distribution-free $i$9-upper bound on agent $b$0’s future obligation (Kazlauskaite, 4 Jun 2026).

The paper also states a system-level extension. For any fixed scalar functional $b$1, such as total cost or maximum obligation, one may form an order-statistic certificate $b$2 on $b$3 satisfying

$b$4

(Kazlauskaite, 4 Jun 2026). This lifts the certification principle from per-agent obligations to system-level summaries.

The guarantee is distribution-free in the specific sense stated in the paper: no assumptions on $b$5 beyond block exchangeability are required (Kazlauskaite, 4 Jun 2026). This places the method squarely within the conformal paradigm, where finite-sample validity arises from exchangeability and rank-based order statistics rather than parametric tail modeling. Related work on the conformal/scenario interface makes the same methodological point in a different language, showing that exchangeability-based arguments can also recover classical scenario mean-violation laws and modular risk-allocation rules (Calafiore, 19 Mar 2026).

4. Train–select–certify pipeline and deployment logic

The algorithmic workflow is described as a three-stage split designed to avoid using calibration data in policy selection and thereby preserve valid coverage (Kazlauskaite, 4 Jun 2026).

In Stage 1, the base rule $b$6 may optionally be fit on $b$7, for example as a variance-optimal doubly-stochastic matrix (Kazlauskaite, 4 Jun 2026). In Stage 2, for $b$8, the method evaluates empirical $b$9-quantiles of $\tilde x_{b,i}$0 over $\tilde x_{b,i}$1, computes proxy harm, and selects

$\tilde x_{b,i}$2

subject to proxy harm not exceeding

$\tilde x_{b,i}$3

(Kazlauskaite, 4 Jun 2026). In Stage 3, the held-out calibration set $\tilde x_{b,i}$4 is used to compute conformal caps $\tilde x_{b,i}$5 and $\tilde x_{b,i}$6 by order statistics and to evaluate certified harm

$\tilde x_{b,i}$7

If the certified harm is at most $\tilde x_{b,i}$8, the policy $\tilde x_{b,i}$9 is deployed with certificates $A\in\mathbb{R}^{n\times n}$0; otherwise the mechanism reverts transparently to the baseline $A\in\mathbb{R}^{n\times n}$1 with certificates $A\in\mathbb{R}^{n\times n}$2 (Kazlauskaite, 4 Jun 2026).

This revert-to-baseline rule is central to the participation guarantee. The paper states that if the certified harm budget is violated, the mechanism does not partially deploy or soften the criterion; it reverts to $A\in\mathbb{R}^{n\times n}$3 (Kazlauskaite, 4 Jun 2026). In that sense, participation is enforced ex post on the same calibration sample that produces the caps.

The logic parallels broader conformal risk-budgeting ideas. Related work on modular composition shows that when multiple blockwise certificates are available, one can combine them into joint guarantees through a union-bound allocation

$A\in\mathbb{R}^{n\times n}$4

or, under independence, through a multiplicative alternative (Calafiore, 19 Mar 2026). Conformal Risk Sharing does not use that blockwise composition rule directly, but the comparison suggests a common design vocabulary: risk is allocated under exchangeability, and deployment is conditioned on explicit certificate checks.

A second misconception is that conformal certification alone resolves all equity or site-heterogeneity issues. Related federated CRC results show that naive pooling can protect the average site while violating coverage at vulnerable sites, whereas shrinkage or local corrections alter the trade-off between coverage and efficiency (Shahid, 18 Jun 2026). This suggests that, in cost-sharing settings with substantial heterogeneity, the choice of pooling structure $A\in\mathbb{R}^{n\times n}$5, weights $A\in\mathbb{R}^{n\times n}$6, and harm budget $A\in\mathbb{R}^{n\times n}$7 is likely to be as consequential as the calibration step itself.

5. Empirical behaviour on synthetic and real-world data

The paper evaluates the framework on synthetic heavy-tailed data, E-OBS precipitation data, and an energy cooperative dataset, with results reported in terms of coverage, aggregate certified caps, top-decile caps, and PASS rate (Kazlauskaite, 4 Jun 2026).

Setting	Main findings	Notes
Synthetic heavy-tailed data	Coverage $A\in\mathbb{R}^{n\times n}$8; aggregate certified caps $A\in\mathbb{R}^{n\times n}$9 lower; top-decile caps $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$0 lower	PASS rate $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$1; under time splits PASS $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$2
E-OBS precipitation	Coverage mean $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$3, 5th $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$4; global pooling aggregate $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$5 lower; top-decile $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$6 lower	PASS $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$7; local pooling more conservative
Energy cooperative	Coverage near nominal $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$8; aggregate $$x_b(A)=\tilde x_b A,\qquad x_{b,i}(A)=\sum_{j=1}^n \tilde x_{b,j}A_{ji}.$$9 to $B$00; top-decile $B$01 to $B$02	PASS $B$03; weak dependence makes harm constraint slack

In the synthetic study, blocks are zero-inflated Pareto mixtures on a grid with spatial dependence (Kazlauskaite, 4 Jun 2026). Under random splits with $B$04 large enough for exchangeability, empirical per-agent coverage is approximately $B$05 for nominal $B$06, the 5th percentile is at least $B$07, global pooling reduces aggregate certified caps by about $B$08, and top-decile caps by about $B$09 (Kazlauskaite, 4 Jun 2026). The PASS rate is approximately $B$10, which the paper interprets as confirming active participation constraints (Kazlauskaite, 4 Jun 2026). Under time splits, coverage is similar but $B$11 is more conservative and PASS equals $B$12 (Kazlauskaite, 4 Jun 2026).

In the E-OBS precipitation experiment, there are 1120 grid cells observed over 75 years, with annual trigger losses described as heavy-tailed and spatially dependent (Kazlauskaite, 4 Jun 2026). Under random splits, coverage has mean $B$13 and 5th percentile $B$14, while the identity baseline has $B$15 (Kazlauskaite, 4 Jun 2026). Global pooling cuts aggregate certified caps by about $B$16 and top-decile caps by about $B$17, with PASS approximately $B$18 (Kazlauskaite, 4 Jun 2026). Local neighbourhood pooling is more conservative, reducing aggregate caps by $B$19 and top-decile caps by $B$20, with coverage around $B$21 and PASS $B$22 (Kazlauskaite, 4 Jun 2026). Under time-ordered splits, calibration validity degrades with window size because of nonstationarity, motivating periodic re-certification (Kazlauskaite, 4 Jun 2026).

In the energy cooperative experiment, the data comprise 153 households over 69 weeks, and weekly excess-demand losses are described as idiosyncratic and weakly correlated (Kazlauskaite, 4 Jun 2026). Under random splits, coverage is near nominal $B$23 and PASS equals $B$24 (Kazlauskaite, 4 Jun 2026). With a tight budget $B$25, the selected $B$26 yields aggregate cap reduction of $B$27 and top-decile reduction of $B$28 (Kazlauskaite, 4 Jun 2026). With a more permissive $B$29, $B$30 yields aggregate reduction of $B$31 and top-decile reduction of $B$32 (Kazlauskaite, 4 Jun 2026). The paper attributes this to weak dependence, stating that pooling nearly Pareto-improves all agents, so the harm constraint is slack (Kazlauskaite, 4 Jun 2026).

Across all reported settings, the framework delivers certified, distribution-free guarantees on each agent’s future obligation without assuming any parametric model and includes an explicit governance-driven participation check so that the pool only operates when no one is made materially worse off (Kazlauskaite, 4 Jun 2026).

6. Relation to conformal risk allocation and adjacent literatures

Conformal Risk Sharing sits at the intersection of conformal prediction, risk control, and mechanism design for redistribution under uncertainty (Kazlauskaite, 4 Jun 2026). Its core contribution is not merely the use of conformal calibration, but the combination of conformal calibration with a cost-allocation mechanism and an explicit participation test (Kazlauskaite, 4 Jun 2026).

A nearby line of work studies how conformal prediction connects to scenario optimization. “Bridging Conformal Prediction and Scenario Optimization: Discarded Constraints and Modular Risk Allocation” derives the classical mean-violation law

$B$33

under exchangeability and stable reconstruction, and introduces a modular composition rule for distributing risk across coordinates, constraints, or time steps (Calafiore, 19 Mar 2026). That paper’s blockwise perspective is not a cost-sharing model, but it supplies a formal language for risk budgeting that is conceptually adjacent to the weighted aggregate criteria and participation budgets used in Conformal Risk Sharing (Calafiore, 19 Mar 2026). This suggests a broader methodological family in which exchangeability-based certificates are paired with explicit allocation of tolerable risk across components.

Another adjacent line is conformal risk control in heterogeneous multi-site deployments. “When Calibration Fails the Vulnerable Hospital: Federated Conformal Risk Control via Risk-Curve Shrinkage” shows that pooled calibration can preserve marginal guarantees while violating target performance at individual institutions, and that shrinkage-based blending of local and global calibration curves can materially change the trade-off between protection and efficiency (Shahid, 18 Jun 2026). In that paper, naive pooled CRC violates coverage at $B$34 institutions while per-site local CRC restores coverage but inflates set size, motivating a shrinkage-based federated protocol (Shahid, 18 Jun 2026). The relevance to Conformal Risk Sharing is indirect but clear: both settings concern finite-sample, distribution-free guarantees under heterogeneity, and both treat aggregate validity as insufficient when subgroup or participant-level protection matters.

The main conceptual distinction is that Conformal Risk Sharing certifies future financial obligations after redistribution, whereas the related works focus on prediction-set violation rates or scenario constraints rather than cost allocation itself (Kazlauskaite, 4 Jun 2026, Calafiore, 19 Mar 2026, Shahid, 18 Jun 2026). Its participation guarantee therefore has a different normative role: it is a deployability criterion tied to incentives to remain in the pool.

7. Interpretation, limitations, and practical implications

The framework’s principal assumptions are finite data, block exchangeability, and a held-out calibration phase that is not used for policy selection (Kazlauskaite, 4 Jun 2026). Its validity guarantee is distribution-free only to that extent: the calibration blocks together with a future block must be exchangeable in law, conditional on the selected policy $B$35 (Kazlauskaite, 4 Jun 2026). The precipitation experiment explicitly reports that under time-ordered splits, calibration validity degrades with window size because of nonstationarity, and this motivates periodic re-certification (Kazlauskaite, 4 Jun 2026). A plausible implication is that operational deployments in nonstationary environments would need a re-certification schedule rather than a one-time calibration.

The participation guarantee is also limited in a precise way. The paper does not claim that no agent can ever be worse off in realized cost; instead, it certifies that no agent faces more high-confidence liability than allowed, through the bounded-harm test on calibrated caps (Kazlauskaite, 4 Jun 2026). This matters because the guarantee operates on certified upper obligations, not on realized ex post outcomes for every block.

The framework is flexible in how pooling structure is encoded. The base rule $B$36 may be uniform, local, or data-driven, and the weights $B$37, materiality threshold $B$38, and budget fraction $B$39 define a governance layer over statistical certification (Kazlauskaite, 4 Jun 2026). This suggests that Conformal Risk Sharing is as much a decision architecture as a calibration method: statistical validity enters through split conformal order statistics, while acceptability enters through explicit efficiency and participation constraints.

In that sense, the paper’s contribution is to convert a vague intuition—share rare extreme losses unless doing so harms some members too much—into a certified allocation problem with a train–select–certify pipeline, per-agent finite-sample caps, and a transparent fallback to the identity allocation when harm budgets are violated (Kazlauskaite, 4 Jun 2026).