paper-with-me

Papers

Wasserstein-regularized Conformal Prediction under General Distribution Shift

2025-01-23 · Rui Xu, Chao Chen, Yue Sun, Parvathinathan Venkitasubramaniam, Sihong Xie

Conformal prediction yields a prediction set with guaranteed $1-\alpha$ coverage of the true target under the i.i.d. assumption, which may not hold and lead to a gap between $1-\alpha$ and the actual coverage. Prior studies bound the gap using total variation distance, which cannot identify the gap changes under distribution shift at a given $\alpha$. Besides, existing methods are mostly limited to covariate shift,while general joint distribution shifts are more common in practice but less researched.In response, we first propose a Wasserstein distance-based upper bound of the coverage gap and analyze the bound using probability measure pushforwards between the shifted joint data and conformal score distributions, enabling a separation of the effect of covariate and concept shifts over the coverage gap. We exploit the separation to design an algorithm based on importance weighting and regularized representation learning (WR-CP) to reduce the Wasserstein bound with a finite-sample error bound.WR-CP achieves a controllable balance between conformal prediction accuracy and efficiency. Experiments on six datasets prove that WR-CP can reduce coverage gaps to $3.1\%$ across different confidence levels and outputs prediction sets 38$\%$ smaller than the worst-case approach on average.

📄 PDF Abstract BibTeX arXiv:2501.13430

Code (0)

등록된 구현이 없습니다.

Tasks

Conformal PredictionPredictionRepresentation Learning

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Conformal Graph Prediction with Z-Gromov-Wasserstein Distances

2026-03-02 · Gabriel Melo, Thibaut de Saivre, Anna Calissano, Florence d'Alché-Buc arxiv

Supervised graph prediction addresses regression problems where the outputs are structured graphs. Although several approaches exist for graph-valued prediction, principled uncertainty quantification remains limited. We …

Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Models

2023-05-26 · NeurIPS 2023 11

Wasserstein distributionally robust estimators have emerged as powerful models for prediction and decision-making under uncertainty. These estimators provide attractive generalization guarantees: the robust objective obt…

Decision MakingDecision Making Under Uncertainty

Wasserstein Adversarially Regularized Graph Autoencoder

2021-11-09 · Huidong Liang, Junbin Gao

This paper introduces Wasserstein Adversarially Regularized Graph Autoencoder (WARGA), an implicit generative algorithm that directly regularizes the latent distribution of node embedding to a target distribution via the…

ClusteringLink PredictionNode Clustering

Conformal online model aggregation

2024-03-22 · Matteo Gasparin, Aaditya Ramdas

Conformal prediction equips machine learning models with a reasonable notion of uncertainty quantification without making strong distributional assumptions. It wraps around any black-box prediction model and converts poi…

Conformal PredictionmodelModel SelectionPrediction+1

An Uncertainty-Aware Pseudo-Label Selection Framework using Regularized Conformal Prediction

2023-08-30 · Matin Moezzi

Consistency regularization-based methods are prevalent in semi-supervised learning (SSL) algorithms due to their exceptional performance. However, they mainly depend on domain-specific data augmentations, which are not u…

Conformal PredictionPseudo Label