Conformal Calibration for Multi-modal Regression with Missing Modalities

Ilia Azizi

Department of Operations, HEC Lausanne, University of Lausanne, Switzerland

BegooAI, Switzerland

arXiv (soon) Paper (soon) Code

Published at the Symposium on Conformal and Probabilistic Prediction with Applications (COPA 2026)

Abstract

Prediction intervals for multi-modal regression with tabular variables, text, images, or other input sources are difficult to calibrate when those sources disagree or one is missing. A single global quantile averages these regimes together instead of calibrating to the modality pattern observed at test time. We address this through a modality-aware conformal calibration layer. The layer trains or reuses one predictor per modality, computes a disagreement score from the modality-specific predictions, and uses that score in split conformal calibration under a strict split protocol. We use the score in two complementary ways. First, a continuous weighted method reallocates interval width across examples while preserving the usual marginal split-conformal guarantee. Second, a Mondrian (stratified) method calibrates within disagreement or modality-availability groups fixed before final calibration, giving group guarantees under joint exchangeability of the final-calibration and test examples. Across four multi-modal datasets, the weighted layer matches or improves the marginal conformal baseline in 59 of 60 paired interval continuous ranked probability score (CRPS) comparisons and 52 of 60 width comparisons while keeping empirical coverage near the 95% target. In missing-modality stress tests, regime-Mondrian calibration recovers up to 20.2 percentage points of coverage in the hardest masked regimes. The result is a simple, model-agnostic reliability layer for multi-modal regression systems.

1

Overview

2 min

Models that predict from tables, text, and images together usually get one global correction to turn their outputs into 95% prediction intervals. That single correction quietly fails exactly where multi-modal models are fragile, when the sources contradict each other or one source is missing. We add a small, model-agnostic calibration layer that measures how much single-modality predictors disagree. Standard conformal machinery then turns that signal into intervals that put width where the difficulty actually is, without losing the formal coverage guarantee.

Example

Our running example throughout the page is Swiss apartment listings (SRED; Azizi and Rudnytskyi, 2022). Each listing brings three information sources: the table (size, rooms, location), the written description, and the photos plus a satellite view.

Pick a listing below to see what happens to the intervals.

Tabular (all 4 fields)

Tabular fields for the selected listing
rooms
living space
latitude
longitude

Text (header and description)

Images (montage and satellite)

Photo montage of the listing, the image encoder's first input Satellite view of the listing, the image encoder's second input

Both image fields are used. DINOv2 embeds the photo montage and the satellite view separately, and the two embeddings are mean-pooled into one image block.

Tabular model
Text model
Image model
Spread of the reads
d(x), log units
Width vs. marginal

Contributions

2

The problem

1 min

The running example predicts log(rent) from the three sources introduced in the Overview. Standard practice, split conformal prediction (Vovk et al., 2005; Lei et al., 2018), computes one number, a quantile of the calibration errors, and pads every interval with it. That guarantees 95% coverage on average. But “on average” hides three very different regimes:

We ask whether we can keep the distribution-free guarantee while making the calibration aware of the modality situation of each test point.

3

The core idea: disagreement as a signal

2 min

Train one cheap auxiliary predictor per modality: g1 sees only the table, g2 only the text, g3 only the images. Each predicts the rent alone. Then define the disagreement score d(x) as the standard deviation of the available source predictions, meaning how spread out their estimates are.

d(x) = sd{ ŷ1, ŷ2, …, ŷK }

Here sd uses the average across the K available predictions (the divisor is K), which gives the values shown below.

Sources agree → small d(x)

7.57 / 7.60 / 7.63  ⇒  d(x) = 0.02

All three views of the listing tell the same story. Trustworthy regime.

Sources conflict → large d(x)

6.85 / 7.60 / 7.90  ⇒  d(x) = 0.44

The image predictor sees something the others don't. Risky regime, so the interval should widen.

It is a useful calibration covariate because it is observable at test time (no labels needed), cheap, and model-agnostic. It works identically whether the main predictor is XGBoost (Chen and Guestrin, 2016), a neural network, or an SEMF-derived decoder-output ensemble. We feed d(x) into two standard conformal constructions, described in § 4 and § 5 and summarized by our overview figure.

Figure 1 of the paper. Top, the calibration layer: three per-modality predictors feed the disagreement score, a fixed base predictor supplies the interval, and one calibration step follows, weighted CQR or Mondrian. Bottom, a worked example with three regimes.
Figure 1 of the paper. The worked example in its bottom band is the same one the live demo in § 4 reproduces, with the same quantiles and intervals.
What exactly does each model output? (the numbers d(x) is computed on)

Each auxiliary predictor gk outputs one plain number: its own guess of the target, in target units. In the experiments these are plain XGBoost regressors, one per modality. For a SRED listing:

  • tabular  tabular variables (size, rooms, location…) → g1 → “log(rent) ≈ 7.60”
  • text  description → frozen text encoder (E5 / MiniLM) → embedding vector → g2 → “7.90”
  • image  photos → frozen DINOv2 → embedding vector → g3 → “6.85”

The raw text and pixels are never fed to gk directly. A frozen pretrained encoder turns them into a feature vector first, and the regressor maps that vector to a rent guess. Then d(x) = sd{7.60, 7.90, 6.85} ≈ 0.44, in the same units as the target. Think of three appraisers, each reading only one part of the dossier, each writing down a rent estimate: disagreement is the spread of the three numbers. No labels, no intervals, no probabilities involved.

Keep two roles separate (a common confusion). The base predictor, the model being calibrated, is a different object. It outputs the interval (ℓ, u). That interval comes from a single point prediction ŷ (then ℓ = u = ŷ), from a pair of fitted 2.5% / 97.5% quantiles, or from an SEMF ensemble of latent-propagated decoder outputs summarized into an interval. The gk's never produce the interval. They exist only to produce d(x).

4

Disagreement-weighted intervals

5 min

Take any base interval (ℓ(x), u(x)), from a quantile model or from a point prediction with ℓ = u. The quantile case is conformalized quantile regression (Romano et al., 2019). Instead of padding every example equally, scale the padding by a disagreement-dependent factor:

aγ(x) = 1+γ·d(x)2 Calibrated interval = [ ℓ(x) − q̂·aγ(x),  u(x) + q̂·aγ(x) ]

Here is the usual split-conformal quantile, but computed on non-negative normalized scores ei+ = max{ei, 0} and si = ei+ / aγ(Xi) (Papadopoulos et al., 2008). Clipping rules out a structural inversion in which a negative quantile would make greater disagreement cause a stronger contraction. The hyperparameter γ ≥ 0 is chosen on a separate tuning split and fixed before final calibration. This keeps the same marginal coverage target while allowing padding to vary with disagreement; in our experiments, width generally moves from low-disagreement examples toward conflicted ones.

Why a base interval at all? Do my models have to output intervals?

No, they don't. Conformal prediction never invents a prediction. It corrects one. So the wrapper needs some prediction rule to correct, called the base predictor, and it accepts that rule in any of three forms:

  • A point predictor (plain XGBoost). Output: one number ŷ. We treat it as the degenerate interval ℓ = u = ŷ, so the conformal layer builds the entire interval around it: [ŷ − q̂·aγ, ŷ + q̂·aγ].
  • A quantile predictor (XGBoost trained at the 2.5% and 97.5% levels). Output: a rough interval. Fitted quantiles carry no guarantee. Standard signed CQR may stretch or shrink them; our disagreement-weighted rule clips scores at zero and therefore only expands them.
  • An ensemble-output base (the SEMF-derived diagnostic). It samples latent variables and retains 50 decoder outputs, whose empirical quantiles form a rough interval. These are latent-propagated decoder outputs, not draws from the full response distribution, because the cached run omitted SEMF's conditional-response draw.

The base predictor decides the interval's location and shape (where it sits, whether it is asymmetric, whether it is already wider in noisy regions). The conformal layer decides its size, so that 95% coverage is guaranteed. A quantile or ensemble-output base is worth having because it adapts the shape to each x. With a point base, all the width has to come from the padding. The experiments use all three base-output types, and that is exactly what “predictor-agnostic” means here.

Is the base predictor a separate model, and must it be multi-modal? It is separate because it is the model you would deploy anyway, and the wrapper never trains or modifies it. It only needs to be multi-modal in a minimal sense. No fusion architecture is required, and the main base predictor in the experiments is one XGBoost trained on all features concatenated (the tabular columns and the cached embeddings side by side as one wide table). What genuinely must be per-modality are the auxiliaries, because d(x) is the spread of their predictions. In the missing-modality experiments the base should consume all modalities, since the interesting failure is a model that relied on images suddenly receiving zeros. A tabular-only base would not care, and there would be nothing to repair.

One listing end to end (who produces what)

Illustrative numbers. SRED, with an XGBoost point predictor as the base.

  1. Train once, on the fit split (6,498 listings). The base predictor is one XGBoost trained on all features together: the tabular columns plus the cached text embedding plus the cached image embedding. The auxiliaries g1, g2, g3 are three plain XGBoost regressors trained on one modality each.
  2. Calibrate once, on the calibration split (1,999 listings). The base predictor makes a rent guess ŷi for each calibration listing. The error is ei = |yi − ŷi|. The marginal recipe takes the 95th-percentile error, say q̂ = 0.40. The weighted recipe first divides each error by that listing's aγ(Xi), then takes the quantile, giving say q̂ = 0.31 (smaller, because dividing by a scale ≥ 1 shrinks the scores).
  3. Predict for a new listing. 3.5 rooms, 80 m², Lausanne, five photos. Base predictor: ŷ = 7.62. One number, no interval. Auxiliaries: 7.60 / 7.90 / 6.85, so d = 0.44 and aγ = 1+8·0.442 = 1.60.
  4. Build the interval. Baseline (marginal): 7.62 ± 0.40 → [7.22, 8.02], the same padding as every other listing. Weighted: 7.62 ± 0.31·1.60 = 7.62 ± 0.50 → [7.12, 8.12], wider because the sources conflict. A peaceful listing with d = 0.02 would instead get 7.62 ± 0.31, narrower than the baseline's ± 0.40.

Notice what the base predictor produced: only the number 7.62. Everything interval-shaped came from the calibration layer. The baseline and weighted method use the same fitted model, prediction, and calibration listings; they differ in score normalization, the resulting quantile, and the padding applied to each test point.

Model count for this point-base example. With 3 modalities, four regressors are trained: three auxiliaries (one per modality, each outputting a point guess) and one base predictor on all modalities. More generally the wrapper needs K auxiliary prediction rules plus one base prediction system; a quantile system can itself contain several fitted quantile models. Nothing else in the layer is trained: q̂ is a sorted quantile of calibration errors, γ comes from a small grid search on the tuning split, and the Mondrian groups are just labels.

What is e exactly? (the error that q̂ is a quantile of)

It is the letter e, not an epsilon, and it is not noise. For one calibration listing, ei answers a single question: how far did the true label land outside the base interval?

ei = max{ ℓ(Xi) − Yi,  Yiu(Xi) }

With base interval [7.40, 7.80] and true log(rent) y:

  • Truth above it, y = 8.05e = 0.25. The interval missed by 0.25 on top.
  • Truth below it, y = 7.10e = 0.30. Missed by 0.30 underneath.
  • Truth inside it, y = 7.60e = −0.20. Negative means covered with slack to spare.
  • Point predictor (ℓ = u = ŷ) → e = |y − ŷ|, the plain absolute error.

Compute ei for every calibration listing (their true rents are known), sort the values, and take the ⌈(n+1)(1−α)⌉-th smallest, roughly the 95th percentile. That number is , the padding that would have been just enough for 95% of the calibration set. The disagreement-weighted rule makes two linked changes: clip to ei+ = max{ei, 0}, then divide by aγ(Xi). The quantile is therefore taken over non-negative, disagreement-normalized errors.

The worked example from Figure 1

Base interval [7.40, 7.80], γ = 8, with Figure 1's quantiles of 0.25 global and 0.20 weighted.

d(x)
0.02
Scale aγ
1.00
Calibrated interval
[7.20, 8.00]
Width
0.80
Width vs. global
−11%

The dashed teal line is the base interval from the model. The faint gray bar is the global CQR interval, whose raw-score quantile is 0.25. The violet bar is the disagreement-weighted interval, built from the smaller scaled-score quantile 0.20. These are Figure 1's numbers: at d = 0.02 the weighted interval is [7.20, 8.00], 11% narrower than the global one, and at d = 0.44 it is [7.08, 8.12], about 15% wider (the figure caption reports 16%, computed from the rounded endpoints). "Width vs. global" is a per-example comparison, not an improvement score. Positive means this example's interval is wider than the one-size-fits-all interval, a cost paid deliberately where the sources conflict. The method's gain lives in the average, where width moves to conflicted examples and the mean width and CRPS improve while empirical coverage stays near the 95% target.

Why the form 1+γ·d2?
  • γ = 0 recovers a scale-free pure-expansion rule. The scale becomes 1. For a point-prediction base interval (ℓ = u), this is ordinary absolute-residual split conformal. For an interval base, it is clipped CQR. It has the same endpoints as signed CQR whenever the signed calibration quantile is non-negative and does not contract the base interval otherwise.
  • Never below 1. A purely multiplicative scale like γ·d can hit zero and collapse the normalized score. This form is bounded below, so no example gets a degenerate scale.
  • Identifiable one-parameter family. The natural two-parameter form λ0+λ1d2 is redundant: multiplying the scale by any constant is absorbed by q̂. Setting λ0 = 1 removes that redundancy, and γ plays the role of λ10.
5

Group-wise Mondrian calibration

4 min

Mondrian coverage in simple words. Ordinary conformal coverage is a promise about the average: “95% of all future listings land inside their intervals.” An average can hide a failing group, the way a school can boast a 95% pass rate overall while one class passes only 75% of its students. Mondrian coverage upgrades the promise: name your groups in advance (full, no text, no image, tabular only) and guarantee 95% inside each group separately. The recipe is almost disappointingly simple. Run the usual calibration once per group, so each group's padding comes from its own peers. A no-photo listing is padded like other no-photo listings, not like the average listing. The name comes from the Mondrian taxonomies of Vovk et al. (2005); the labelled boxes evoke Piet Mondrian's grids.

Disagreement weighting keeps a marginal guarantee. Sometimes a stakeholder needs coverage for a named group. For example, listings without photos may still need 95% coverage. For that you need a stronger construction (Vovk et al., 2005; Vovk, 2012; Boström and Johansson, 2020). Split the calibration set into pre-declared groups and compute one conformal quantile h per group. We use two grouping rules:

Missing modalities are the headline use, not the only one. The same construction repairs the high-disagreement bin (marginal calibration averages 0.923 coverage there; per-bin calibration brings it to about 0.948), and another diagnostic applies it to the decoder-output ensemble's own predicted-uncertainty bins with the same effect (high-uncertainty coverage 0.922 → 0.955). The recipe requires a group rule fixed before final calibration, a label observable at test time without the outcome, enough in-group calibration examples for a finite interval, and joint exchangeability of the final-calibration and test examples conditional on the fixed pre-calibration pipeline. Care about a named group, use Mondrian. Care about smooth average efficiency, use the weighted scale.

Here is the missing-modality case end to end. It is discrete (a modality is there or it isn't), which is why this demo has switches rather than a slider:

  1. The base predictor still runs. The absent modality's embedding block is filled with zeros (the stress-test convention), so it still produces an interval, just a worse-informed one.
  2. No disagreement value is invented for the absent source. The example instead gets a regime label from what is observed, e.g. “no image”.
  3. Calibration examples with the same pattern form the group. Their errors are typically larger, and their quantile h is therefore larger.
  4. The test interval uses the padding of its own group. A no-photo listing is padded like other no-photo listings, not like the average listing. At test time the whole algorithm is a lookup: check what the listing has, fetch that pattern's padding.

Our cross-dataset stress table implements this as eight separate fixed-mask experiments: each row applies one deterministic mask to every final-calibration and test example in that run. It is not a single mixed-missingness sample partitioned after the fact. A deployment with several naturally occurring patterns would need representative final-calibration examples from each pattern under the same fixed pipeline.

A useful analogy is measuring with one eye closed. You can still see, but less precisely, so an honest margin of error must be larger. The layer finds out how much larger by rehearsing. It closes the same eye on the calibration listings, where the true rents are known, measures how much worse the guesses get, and turns exactly that damage into the new padding.

Knock out a modality

SRED illustration, base interval [7.40, 7.80], full-regime q̂ = 0.20.

Available at test time:
Regime
Full
Global interval
[7.20, 8.00]
Its real coverage
94.8%
Regime interval
[7.20, 8.00]
Its real coverage
94.8%

All modalities are present, so the regime quantile equals the global one, because the full regime is exactly what the global quantile was calibrated on.

The masked-regime coverage numbers are our five-seed SRED means from Table 2; the full state uses the released full-regime mean (94.8%, rounded). The displayed base interval and padding sizes are illustrative, with masked paddings drawn to scale with the reported width changes (+26%, +46%, +83%).

How the two methods divide the work: weighted = continuous, efficiency-oriented, marginal guarantee. Mondrian = discrete, guarantee-oriented, per-group validity. They are complementary, not competing, and we evaluate them in those distinct roles.
6

Understanding the propositions

4 min

For a reader who wants to inspect the math, there are exactly two propositions. Both are standard split-conformal exchangeability arguments applied to the new scores, and the paper is upfront about that. What is specific to this paper is the careful statement of when they apply.

Proposition 1 · weighted validity

Claim: the disagreement-weighted interval covers with probability ≥ 1−α, marginally, conditional on everything fixed before calibration.

Needs: (a) base interval, source predictors, preprocessing, and γ all fixed before the final calibration set is touched; (b) calibration and test points exchangeable.

Proof shape: conditioning makes all functions fixed → the n+1 normalized scores are exchangeable → the test score exceeds the k-th order statistic (k = ⌈(n+1)(1−α)⌉) with probability ≤ α. Rank argument, nothing exotic.

Proposition 2 · per-group validity

Claim: the Mondrian interval covers ≥ 1−α within each group h, a genuinely conditional statement.

Needs: (a) the group rule H fixed using only pre-calibration data; (b) all n+1 final-calibration and test examples jointly exchangeable conditional on 𝒟pre; (c) enough calibration points in the group, otherwise h = +∞ (an honest infinite interval).

Proof shape: condition on the full membership vector. Because the fixed membership event is invariant to permutations within stratum h, joint exchangeability implies exchangeability of the in-stratum scores. Apply the rank argument there, then average over membership vectors.

The load-bearing requirement is strict data separation. We use a four-way split: fit (train all predictors) → tune (choose γ, bin edges, every data-driven decision) → final calibration (scores and quantiles only) → test. We collect everything decided before final calibration into an object called 𝒟pre and condition on it. That is the entire trick that makes “we tuned γ” compatible with the guarantee.

Subtleties worth knowing before someone finds them
  • Signed CQR scores can be negative. Standard CQR and our unscaled Mondrian variant may therefore contract an overconservative base interval. The weighted method specified here instead uses e+, so its q̂ is non-negative, greater disagreement cannot cause a stronger contraction, and an ordered base interval stays non-empty.
  • Empirical scope. Every cross-dataset weighted final quantile was non-negative, so the non-negative specification produces the reported endpoints. The SEMF-derived SRED results are presented as empirical diagnostics rather than formal proposition instances.
  • What is not claimed: coverage conditional on a specific x (impossible distribution-free, Barber et al., 2021), and no training-conditional claim. Prop 2 gives group-conditional coverage, the strongest honest middle ground.
  • Pooling small strata is an engineering fallback, and we explicitly note that the group guarantee is lost when you do it.
  • Some SRED rows are labelled “diagnostics”: results reusing saved SEMF outputs also reuse validation information for model selection and are therefore not claimed as formal instances of the propositions.
7

Results

4 min

Four multi-modal regression datasets, five seeds, frozen pretrained encoders (DINOv2 for images, E5 / MiniLM for text): SRED (Swiss rents, tab+text+img; Azizi and Rudnytskyi, 2022), Mercari (product prices, tab+text; Mercari, 2018), Pawpularity (pet-photo popularity, tab+img; PetFinder.my, 2021), IMDB-WIKI (age from face+name, tab+text+img; Rothe et al., 2018).

59 / 60
interval CRPS: weighted matches or beats marginal
descriptive paired count · no repeated-seed significance test claimed
52 / 60
interval width: matches or beats marginal
strict reductions: 39/60 width, 46/60 CRPS
+20.2 pp
biggest coverage repair under a missing modality
IMDB-WIKI no-image: 0.753 → 0.955
What is “the baseline” in these comparisons?

The baseline is the same fitted model under the standard calibration rule. In every paired comparison (the 60 runs above, and the chart below) the base predictor is trained once and its predictions are reused on both sides. Only the calibration rule applied on top changes:

  • Marginal baseline: the standard recipe. One global q̂ from the whole calibration split, and every test example gets the same padding.
  • Weighted / Mondrian (ours): the same predictions and the same calibration listings, but the padding is scaled by d(x), or computed per group.

That is what makes the 60 comparisons clean: same fitted model, same splits, same seed on both sides, so any difference is attributable to the calibration layer alone. The baseline "produces" intervals of the same shape and location as the method's. Only their widths differ.

The shortest way to say it: the marginal comparator removes the disagreement-dependent scale, while the Mondrian comparator removes the group split (one pooled q̂ instead of one q̂h per group). There is one sign nuance. Our weighted specification clips scores at zero, so γ = 0 is the pure-expansion marginal rule. It coincides with the usual signed CQR comparator whenever the signed final quantile is non-negative (as it was in every cross-dataset weighted run), but unlike signed CQR it cannot contract when that quantile is negative.

Concretely, the nine rows of the SRED table are 3 trained base predictors × 3 calibration rules. Each trio of rows shares one fitted model (XGBoost point, augmented SEMF, or XGBoost quantile) and compares three ways of computing the padding from the same calibration errors: marginal (the baseline), disagreement-weighted, and disagreement-Mondrian. Mondrian is one of our two proposed methods, not a baseline. Whether a row says "split conformal" or "CQR" only reflects the base model's output format (point vs interval) and applies identically to baseline and method.

Two other comparison points appear once each and should not be confused with the main baseline: the pooled quantile in the missing-modality table (one quantile over all masked calibration examples together, a deliberately blunt sanity check), and the point-accuracy baselines (XGBoost on concatenated features, MLP, cross-attention) in the R² table, which exist to scope the point-prediction claim and play no role in the calibration claims.

Per-dataset paired results (Table 1: marginal → weighted, five seeds)
Per-dataset paired results for marginal and weighted calibration
DatasetPICPMPIWInterval CRPSMatch/improve (MPIW, CRPS)
SRED (Tab+Txt+Img)0.943 → 0.9420.714 → 0.6890.103 → 0.10215/15 · 15/15
Mercari (Tab+Txt)0.950 → 0.9502.439 → 2.4390.373 → 0.3739/15 · 15/15
Pawpularity (Tab+Img)0.953 → 0.95284.426 → 83.02012.791 → 12.71714/15 · 14/15
IMDB-WIKI (Tab+Txt+Img)0.952 → 0.95140.616 → 40.4646.489 → 6.47814/15 · 15/15

Each row averages over three base predictors (XGBoost point, XGBoost quantile, source-wise quantile) and five seeds. Arrows compare marginal → weighted calibration for the same fitted base predictor and seed. The last column counts runs where weighted calibration matches or improves the metric.

Four real listings from the test split

The same four listings as in the Overview, now picked by outcome. Gray is the marginal interval, violet the disagreement-weighted one, and the dashed line the realized rent (SRED, seed 0, XGBoost point base).

Real rent
Tabular read
Text read
Image read
d(x), log units

The same four listings as a table, with provenance
Four real SRED test listings with source predictions and calibrated intervals
ListingRoomsŷ tabŷ textŷ imaged(x)Real rentMarginalWeighted

Values are log(rent). CHF equivalents appear in the Overview example. Regenerated with the repository pipeline (run_predagn_ablation.py, SRED, seed 0, XGBoost point base). Aggregates of this rerun match the released seed-0 artifact to the second decimal. On this seed the weighted layer trims mean width from 0.523 to 0.513 log units while coverage moves 0.947 → 0.942 against the 0.95 target: five conflicted listings are newly covered, ten calm ones newly missed. Width moves to where the sources disagree. The guarantee remains marginal; it does not promise coverage within either subset of listings.

The headline chart: coverage repair when a modality goes missing

The same trained model is evaluated under a fixed missing-modality mask. Reusing its full-regime quantile (gray) can fall far below the 95% target when the masked modality carried information; recalibrating on final-calibration examples under that same mask (violet) restores coverage toward the target. Hover or focus a chart row, or use the table below, for exact values and the width cost.

One global quantile Regime-Mondrian ┄ 0.95 target

Coverage before/after is Table 2. The repair is not free. The hardest regimes pay real width (SRED tabular-only +83%, IMDB-WIKI no-image +127%). As we write in the paper, “The larger intervals in the masked regimes are not a failure of calibration. They reveal uncertainty that the full-regime quantile was not entitled to suppress.”

Numbers as a table (Table 2: all eight stress regimes)
Coverage and width changes for all eight missing-modality stress regimes
RegimeGlobal PICPPooled PICPRegime PICPGainWidth cost

Pooled = one quantile over all masked calibration examples together. Gain (regime vs. global) is our five-seed mean of unrounded per-seed changes, so it can differ by 0.1 pp from a value recomputed from the rounded coverage columns.

Where the method does nothing, and why that's fine

Mercari is nearly neutral on average (width 2.439378 → 2.439120 before rounding). The mechanism needs the source predictors to induce a reliability ordering. When that ordering is weak, d(x) carries little useful signal. This is not an automatic test-set no-harm guarantee. Six of the 15 Mercari runs became slightly wider, while 9 matched or improved. We report the nearly neutral average as an informative negative result.

The point-prediction table also shows that strong neural fusion leads on SRED, Mercari, and IMDB-WIKI, while homogeneous XGBoost leads on Pawpularity. The claim is deliberately about the calibration wrapper, not about winning point accuracy.

8

Limitations and scope

2 min

What we claim, and the caveats we disclose.

Validity and evaluation scope

  • The finite-sample guarantees require every learned or tuned choice to be fixed before final calibration, followed by jointly exchangeable final-calibration and test examples. The cross-dataset benchmark uses separate fit, tune, final-calibration, and test splits.
  • Calibration groups need enough data. At a 95% target, each protected Mondrian group needs at least 19 final-calibration examples even to form the finite split-conformal quantile.
  • The missing-modality experiments zero standardized feature blocks in final calibration and evaluation. They are controlled stress tests, not evidence about naturally occurring or informative missingness.
  • NCIW uses test labels and is therefore an evaluation diagnostic. Interval CRPS here scores a uniform distribution over the reported interval, not a complete predictive distribution.

Method limits and next steps

  • The scalar disagreement score gives each available source equal weight. It can miss cross-modal dependence and differences in source reliability; correlated or substitute predictors can agree while all are wrong.
  • Its behavior depends on the number and redundancy of the available sources. We therefore keep the source set fixed in the continuous experiments and handle missing modalities with a separate regime rule.
  • Fixing γ = 1 on a pre-specified standardized scale removes only the dedicated scale-selection step. Base-predictor tuning remains, while richer learned scales require sufficient independent tuning data.
  • Priorities for future work are cross-fitting, reliability-weighted disagreement, systematic studies of source count and redundancy, natural missingness, and deployment-time corruption.

The SRED analyses based on saved SEMF-derived outputs are wrapper diagnostics rather than formal proposition instances; the theoretical claims do not depend on that base predictor's internal training details.

9

Questions & answers

FAQ
What exactly is the contribution? It looks like standard conformal prediction.

The contribution is what is plugged into the standard conformal machinery. It is an observable, model-agnostic covariate (source-wise disagreement, modality availability) that no one had used as the calibration variable for multi-modal regression, together with the strict separation of fitting, tuning, final calibration, and testing that makes it valid, and 60 paired runs plus 8 stress tests showing it matters. The closest prior work (Bose et al., 2024) needs internal neural features. This layer works for XGBoost, neural nets, or SEMF alike.

Walk me through the proof of Proposition 1.

Three moves: (1) condition on 𝒟pre, meaning everything fitted or tuned beforehand, so ℓ, u, d, aγ are fixed functions. (2) the n calibration scores and the test score sn+1 = e+/aγ are then exchangeable, so the standard exchangeable-rank bound applies. (3) coverage fails only if the test score exceeds the k-th smallest calibration score with k = ⌈(n+1)(1−α)⌉, which has probability at most α. Ties only make it conservative. This is the standard split-conformal argument (Lei et al., 2018).

γ is tuned on data. Doesn't that invalidate the guarantee?

No: γ is selected on a separate tuning split and fixed before the final calibration set is ever scored. That is exactly what conditioning on 𝒟pre formalizes. What would break it: tuning γ on the same labels used for q̂. We state this explicitly.

Why 1+γd2 and not something simpler like γ·d?

Three reasons. At γ = 0, the scale is 1 and the method recovers the pure-expansion marginal rule (the same endpoints as signed CQR whenever its quantile is non-negative). The scale is bounded below by 1, so no example gets a collapsing normalization. Finally, it is the identifiable parametrization of λ0+λ1d2: multiplying the whole scale by a constant is absorbed by q̂, so fixing the intercept at 1 removes a redundant degree of freedom.

What happens when a group has almost no calibration points?

If mh = ⌈(nh+1)(1−α)⌉ exceeds nh, the quantile is +∞, an honest infinite interval rather than a fake finite one. In practice, we suggest pooling small groups, while noting that this forfeits the group-level guarantee.

Doubling the interval width to fix coverage: is that a win?

The narrow intervals were invalid: 75% actual coverage sold as 95%. Width is the honest price of missing information. And the blunt alternative (one pooled quantile over all masked data) over-pays where it isn't needed. IMDB-WIKI no-text gets inflated to 99.8% coverage at more than twice the regime-calibrated width, while regime-Mondrian leaves that easy regime nearly unchanged.

How does this relate to SEMF, and what is the disclosed bug?

SEMF (Azizi et al., 2025) is the origin story and one of the base predictors, but the layer is model-agnostic. The cached runs retain 50 latent-propagated decoder outputs per example; they omit SEMF's conditional-response draw and are therefore not samples from the full predictive distribution. Appendix C also discloses a row-ordering artifact that can misalign non-constant E-step weights with replicated training rows. No conformal claim depends on either internal training detail.

Did you train a separate model for each missing-modality case? What does this cost?

No retraining. One full-modality base predictor is trained per dataset and seed. Each Table 2 row is a separate fixed-mask experiment. The same absent-modality embedding block is zeroed for every final-calibration and test example in that run, and the model itself is never touched. The corresponding calibration errors are then sorted once to obtain that mask's quantile. The encoders are frozen and their embeddings cached; after predictor fitting, the calibration layer itself consists mainly of rescaling scores and taking quantiles.

Where does the method fail?

When the source predictors induce a weak reliability ordering, d(x) offers little useful signal. Mercari is nearly neutral on average, though individual runs can still become slightly wider. The score is also a scalar from point predictions, so it can miss richer cross-modal structure. Learned modality-aware scales are a natural direction for future work.

Is it assumed that the per-modality models are good? What if one gives bad predictions?

No accuracy assumption on the auxiliaries is needed for validity. Once they and γ are fixed before final calibration, they define a fixed score function and the usual rank argument applies. Their quality does affect sharpness. A wild source prediction raises d(x) and the local scale, but finite tuning and calibration do not turn this into a test-set efficiency guarantee. The tuning grid includes γ = 0, so the tuner has a marginal-rule option; it is not an automatic no-harm switch. What helps is an informative ordering. Examples with larger source disagreement should tend to have larger base-interval errors.

What happens if the modalities disagree systematically, everywhere?

If disagreement is constant, the weighted method is algebraically identical to the pure-expansion marginal rule. With constant scale A, every normalized score is ei+/A, its calibrated quantile is the marginal quantile of the non-negative scores divided by A, and multiplying by A restores exactly the same padding. More generally, multiplying the entire scale function by a constant is absorbed by q̂. Rescaling d itself is instead absorbed by retuning γ. The method can improve efficiency only when variation in disagreement usefully tracks variation in error size.

How much do the trained models actually matter?

Two separate levers. The base predictor is the sharpness lever: on SRED, switching the base predictor moves mean interval width by about 0.31 (1.87 for the point model vs 2.17 for the quantile model), while switching the calibration rule on a fixed model moves it by 0.01 to 0.07 depending on the base predictor. The calibration layer is the honesty lever: model quality alone gives no distribution-free 95% coverage guarantee. In the reported stress test, applying a full-regime quantile after masking images misses the target by about 20 percentage points on IMDB-WIKI. No calibration rule can rescue a hopeless model's width. The auxiliaries matter through the reliability ordering their disagreement induces, not through point accuracy alone.

Why are there no significance tests, and when would Bonferroni be relevant?

The coverage results need no hypothesis test. The propositions are finite-sample guarantees under their stated exchangeability conditions. For efficiency, we report paired counts descriptively rather than attach naïve repeated-seed tests. Base predictors within a dataset–seed cell share splits and source predictions, and five seeds from each of four datasets are not independent draws of datasets; Bonferroni does not repair that dependence. A different use of the union bound applies when protecting a pre-specified batch of B future intervals. Calibrating each at miscoverage α/B controls the probability of any batch error by α without assuming independence. Using α/|ℋ| is only the special case of one future interval per stratum. Ordinary per-stratum validity itself requires no multiplicity correction.

How does the number of modalities K matter, and what about substitute modalities?

Mechanically, a one-source-against-the-rest conflict of size Δ produces d = Δ·K1/K, which is 0.50Δ, 0.47Δ, and 0.43Δ for K = 2, 3, and 4. This mild dilution as K grows can be absorbed by retuning γ. With K = 1, d(x) is zero and the weighted rule reduces to its γ = 0 behavior; with K = 0, disagreement is undefined and a deployment needs a pre-specified fallback or abstention rule. What matters is the information structure, not only the count. Highly similar source predictions add little variation to d, while distinctive sources can create informative conflicts. Mercari's nearly neutral average is consistent with a weak reliability ordering, but does not prove that its modalities are redundant. Likewise, the zero-mask stress test measures sensitivity to those artificial masks, not a general causal measure of modality substitutability. With large K, availability regimes can multiply up to 2ᴷ and leave fewer calibration examples per protected regime.

Can intervals cross or overlap?

Three separate cases. Fitted base quantiles can cross. The cross-dataset pipeline sorts each fitted quantile triple as part of the fixed rule before calibration. The SRED diagnostic retained its fitted quantile pair without rearrangement, but its final endpoints were checked to be ordered; a crossed calibration pair still defines a valid score and tends to inflate it. The weighted interval specified here cannot cross when the base interval is ordered, because e+ makes q̂ non-negative and padding only expands. Negative-q̂ contraction, including a possible empty endpoint representation, belongs to signed CQR or the unscaled signed Mondrian variant, whose set-based definition remains valid. Intervals for different examples may overlap without issue, and each Mondrian example receives exactly one pre-declared group quantile.

Does the idea extend to classification?

Our paper is regression only (a real-valued target and intervals), but both methods have natural classification analogues. Conformal classification replaces intervals with label sets. Score each class with, for example, one minus its predicted probability, and the calibrated set contains the true label 95% of the time. The Mondrian construction carries over unchanged. Calibrate label sets within each modality-availability regime, exactly as in the regression case. The disagreement score needs a new definition of d(x), because per-modality classifiers output probability vectors rather than one number. Natural candidates are the spread of per-modality probabilities for the predicted class, an entropy or divergence between the modality distributions, or simply the disagreement rate among modality votes. Working that out, and showing it helps, would be new material: a natural extension, not a claim of our paper.

10

Pocket glossary

reference
Conformal prediction
Distribution-free recipe turning any predictor plus held-out data into intervals with guaranteed finite-sample coverage.
Split conformal
The practical variant: fit on one split, compute error quantile q̂ on a calibration split, pad test predictions with it.
Exchangeability
The only distributional assumption: calibration and test examples' joint law is order-invariant (weaker than i.i.d.).
CQR
Conformalized quantile regression (Romano et al., 2019). Base model outputs quantiles (ℓ, u). Score e = max{ℓ−y, y−u} measures how far outside you fell.
Non-conformity score
The per-example error the quantile is taken over. The weighted score here is e+ / 1+γd2, where e+ = max{e, 0}.
Mondrian CP
Separate calibration quantile per pre-declared category. The name comes from Vovk et al. (2005); the per-group validity result used here follows Vovk (2012).
PICP / MPIW
Empirical coverage (want ≈ 0.95) / mean interval width (want small, given coverage).
Interval CRPS
Proper score combining coverage and sharpness in one number, computed as a uniform distribution over the interval (Gneiting et al., 2007).
Marginal vs conditional
Guaranteed on average vs guaranteed for each x. Exact conditional is impossible distribution-free. Groups are the honest middle.
SRED
Swiss Real Estate Dataset (Azizi & Rudnytskyi, 2022): ≈11,000 Swiss apartment rental listings with tabular attributes, description text, and photos. The target is log monthly rent.
SEMF
Supervised Expectation–Maximization Framework (Azizi et al., 2025). The cached diagnostic used here retains latent-propagated decoder outputs, not samples from the full predictive response distribution.
NCIW
Coverage-normalized interval width (Azizi et al., 2026): rescales test intervals to exactly 95% empirical coverage before comparing widths. It peeks at test labels, so it is a diagnostic, not a deployable metric.
𝒟pre
Everything decided before final calibration (models, γ, bin edges). The propositions hold conditional on it.
11

References

bibliography

Selected works this page draws on, taken from our full bibliography.

Angelopoulos, A. N. and Bates, S. (2023). Conformal prediction: A gentle introduction. Foundations and Trends in Machine Learning, 16(4):494–591. [link]

Azizi, I. and Rudnytskyi, I. (2022). Improving real estate rental estimations with visual data. Big Data and Cognitive Computing, 6(3):96. [link]

Azizi, I., Boldi, M.-O., and Chavez-Demoulin, V. (2025). SEMF: Supervised expectation-maximization framework for predicting intervals. In Proceedings of the Fourteenth Symposium on Conformal and Probabilistic Prediction with Applications, PMLR 266:250–281. [link]

Azizi, I., Bodik, J., Heiss, J., and Yu, B. (2026). CLEAR: Calibrated learning for epistemic and aleatoric risk. In The Fourteenth International Conference on Learning Representations. [link]

Barber, R. F., Candès, E. J., Ramdas, A., and Tibshirani, R. J. (2021). The limits of distribution-free conditional predictive inference. Information and Inference: A Journal of the IMA, 10(2):455–482. [link]

Bose, A., Ethier, J., and Guinand, P. (2024). Conformal prediction for multimodal regression. arXiv:2410.19653. [link]

Boström, H. and Johansson, U. (2020). Mondrian conformal regressors. In Proceedings of the Ninth Symposium on Conformal and Probabilistic Prediction and Applications, PMLR 128:114–133. [link]

Chen, T. and Guestrin, C. (2016). XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. [link]

Gneiting, T., Balabdaoui, F., and Raftery, A. E. (2007). Probabilistic forecasts, calibration and sharpness. Journal of the Royal Statistical Society: Series B, 69(2):243–268. [link]

Lei, J., G'Sell, M., Rinaldo, A., Tibshirani, R. J., and Wasserman, L. (2018). Distribution-free predictive inference for regression. Journal of the American Statistical Association, 113(523):1094–1111. [link]

Mercari, Inc. (2018). Mercari Price Suggestion Challenge. Kaggle competition. [link]

Oquab, M., Darcet, T., Moutakanni, T., Vo, H., Szafraniec, M., Khalidov, V., Fernandez, P., Haziza, D., Massa, F., El-Nouby, A., et al. (2024). DINOv2: Learning robust visual features without supervision. Transactions on Machine Learning Research.

Papadopoulos, H., Gammerman, A., and Vovk, V. (2008). Normalized nonconformity measures for regression conformal prediction. In Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 64–69.

PetFinder.my (2021). PetFinder.my Pawpularity Contest. Kaggle competition. [link]

Reimers, N. and Gurevych, I. (2019). Sentence-BERT: Sentence embeddings using Siamese BERT-networks. In Proceedings of EMNLP-IJCNLP 2019, 3982–3992. [link]

Reimers, N. and Gurevych, I. (2020). Making monolingual sentence embeddings multilingual using knowledge distillation. In Proceedings of EMNLP 2020, 4512–4525. [link]

Romano, Y., Patterson, E., and Candès, E. J. (2019). Conformalized quantile regression. In Advances in Neural Information Processing Systems, 32:3538–3548. [link]

Rothe, R., Timofte, R., and Van Gool, L. (2018). Deep expectation of real and apparent age from a single image without facial landmarks. International Journal of Computer Vision, 126(2–4):144–157. [link]

Vovk, V., Gammerman, A., and Shafer, G. (2005). Algorithmic Learning in a Random World. Springer.

Vovk, V. (2012). Conditional validity of inductive conformal predictors. In Proceedings of the Asian Conference on Machine Learning, PMLR 25:475–490. [link]

Wang, L., Yang, N., Huang, X., Yang, L., Majumder, R., and Wei, F. (2024). Multilingual E5 text embeddings: A technical report. arXiv:2402.05672. [link]