Skip to content

Conformal Prediction for Distribution-to-Distribution Regression

Nov 2026 · 0 citations · 72 references
Computer Science

TL;DR

This work proposes a new conformal framework that operates in an orthogonal basis space, producing interpretable prediction sets while preserving coverage guarantees and develops an adaptive variant with asymptotic conditional coverage under mild assumptions.

Abstract

Conformal Prediction (CP) provides a model-agnostic framework for constructing finite-sample prediction sets with coverage guarantees and has become a tool for reliable decision-making in high-risk settings. Recent advances have extended Split Conformal Prediction to increasingly complex learning problems, including multilabel, high-dimensional, and functional outputs. In this work, we study CP for Distribution-to-Distribution Regression, a setting of growing interest across many application domains. We show that a naive application of Split CP yields prediction sets that, while marginally valid, are non-interpretable, e.g., lacking a well-defined volume or a tractable sampling procedure, and of limited practical value. To overcome this, we propose a new conformal framework that operates in an orthogonal basis space, producing interpretable prediction sets while preserving coverage guarantees. We further develop an adaptive variant with asymptotic conditional coverage under mild assumptions. Empirical results on synthetic and real-world datasets validate the effectiveness of the proposed approach. The code is publicly available at https://github.com/tuanhacs/conformal_d2d.

View source

Similar papers

Scaling Full Conformal Image Classifiers

Targeted Full Conformal Prediction (T-FCP) is introduced, which uses a lightweight inductive conformal predictor to prune unlikely labels and applies FCP only to the remaining candidates, reducing computation while retaining the formal guarantee of the combined conformal procedure.

Julio Silva-Rodríguez, E. Konukoglu · 0 citations
Book Open access Nov 2026

Cavity-Calibrated Prediction Sets

Cavity-Calibrated Prediction Sets (CCPS) are introduced, which prove distribution-free marginal and joint coverage guarantees and establish a correlation-decay condition under which cavity scores converge to true leave-one-out scores.

Ze-Hua Cheng, Wei Dai, Jia-Hao Sun · 0 citations
#machine learning Preprint Oct 2026

Minimum Volume Optimal Transport for Multivariate Conformal Prediction

Optimal transport (OT) enables multivariate conformal prediction (CP) to construct flexible prediction sets that reflect the underlying complex distributional geometry while retaining distribution-free coverage guarantees. Existing OT-based methods typically rely on a fixed Euclidean transport cost, which can be subopt...

Chu-Chen Zhang, Hao-Jie Ren, Zhao-Jun Wang et al. · 0 citations
#machine learning Preprint Oct 2026

Conformal Prediction Sets Quantify Information Gain: A Theoretical Perspective

This work introduces a family of generalized information measures based on the size and coverage of conformal prediction sets and formally relate conformal prediction to classical information-theoretic quantities and justifies using set-size reduction as an information gain metric.

Kevin B. Zhang, Stephen Bates · 0 citations
Preprint Sep 2026

Conformal Coverage of Time Series: Validity and Inference

Conformal prediction provides marginal coverage guarantees, yet practitioners may wonder if the observed coverage is truly abnormal or consistent with sampling variation. Inference for realized coverage has received comparatively little attention, especially for time series. We study split conformal prediction with adj...

Percy S. Zhai, M. Cheng, Wei-Biao Wu · 0 citations
Preprint Sep 2026

Retrieving predictive densities from conformal predictive distributions

Conformal prediction intervals are used to construct marginally well-calibrated regions around point predictions. Recent work has focused on extending these ideas to conformal predictive distributions, whose marginal probability integral transform (PIT) follows a Unif[0, 1] distribution. In this work, we investigate ho...

Dan Andrei Tudor, D. Kurowicka, Balint Negyesi et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.