ArXiv

Multi-Variable Conformal Prediction: Optimizing Prediction Sets without Data Splitting

Authors
Laura Lützow, Simone Garatti, Marco C. Campi...
Categories
stat.ML, cs.LG
arXiv
https://arxiv.org/abs/2605.12341v1
PDF
https://arxiv.org/pdf/2605.12341v1

Brief

Multi-Variable Conformal Prediction (MCP) tackles the limitation of conventional conformal methods that use a scalar score and single threshold by allowing vector-valued scores and multiple calibration variables. Using scenario theory, MCP unifies prediction-set design and calibration into one optimization problem (no data split) and provides finite-sample coverage. Two variants, RemMCP and RelMCP, trade off convexity assumptions and conservatism; experiments on ellipsoidal and multi-modal sets show target coverage, smaller/comparable set sizes, and lower calibration variance. Full text on arXiv.

Why it matters

Multi-Variable Conformal Prediction (MCP) extends conformal prediction to vector-valued score functions and multiple simultaneous calibration variables, removing the need for data splitting while retaining finite-sample coverage guarantees (Lützow et al., arXiv:2605.12341v1, published 2026-05-12).

Key details

  • The paper presents two practical algorithms: RemMCP (constrained optimization with constraint removal), which generalizes split conformal, and RelMCP (iterative optimization with constraint relaxation), which handles non-convex score functions at the cost of potentially greater conservatism.
  • Empirical tests on ellipsoidal and multi-modal prediction sets show RemMCP and RelMCP meet target coverage and produce prediction-set sizes smaller than or comparable to split-baseline methods, with substantially reduced variance across calibration runs due to joint shape optimization and calibration.
Source evidence

Abstract

Conformal prediction constructs prediction sets with finite-sample coverage guarantees, but its calibration stage is structurally constrained to a scalar score function and a single threshold variable - forcing shapes of prediction sets to be fixed before calibration, typically through data splitting. We introduce multi-variable conformal prediction (MCP), a framework that extends conformal prediction to vector-valued score functions with multiple simultaneous calibration variables. Building on scenario theory as a principled framework for certifying data-driven decisions, MCP unifies prediction set design and calibration into a single optimization problem, eliminating data splitting without sacrificing coverage guarantees. We propose two computationally efficient variants: RemMCP, grounded in constrained optimization with constraint removal, which admits a clean generalization of split conformal prediction; and RelMCP, based on iterative optimization with constraint relaxation, which supports non-convex score functions at the cost of possibly greater conservatism. Through numerical experiments on ellipsoidal and multi-modal prediction sets, we demonstrate that RemMCP and RelMCP consistently meet the target coverage with prediction set sizes smaller than or comparable to those of baselines with data split, while considerably reducing variance across calibration runs - a direct consequence of using all available data for shape optimization and calibration simultaneously.