A Unified Perspective on Conformal Prediction and Wasserstein Distributionally Robust Optimization for Uncertainty Quantification

• URL: http://arxiv.org/abs/2608.29789v1
• Date: Sun, 30 Aug 2026 13:34:39 GMT
• Title: A Unified Perspective on Conformal Prediction and Wasserstein Distributionally Robust Optimization for Uncertainty Quantification
• Abstract summary: Uncertainty from finite data is central to machine learning, optimization, and automation systems.<n>We develop a unified probabilistic perspective on Conformal prediction (CP) and distributionally robust optimization (DRO)<n>CP uses a closed-form, distribution-free level correction, while DRO uses a value-space correction whose certified radius depends on properties of the unknown distribution.
• Score: 8.298172883321103
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Uncertainty quantification from finite data is central to machine learning, optimization, and automation systems, where decisions must remain reliable under limited samples and test-time distribution shift. Conformal prediction (CP) and distributionally robust optimization (DRO) offer two complementary approaches: CP constructs data-dependent prediction sets with distribution-free finite-sample validity under exchangeability, while DRO optimizes worst-case performance over an ambiguity set around an empirical distribution. We develop a unified probabilistic perspective on CP and DRO by viewing both as ways to turn finite calibration data into a data-dependent quantile estimator that a test score falls below with high probability. From this perspective, CP and DRO correct the empirical quantile along two coordinates of the same family of estimators: CP inflates the quantile level, whereas DRO shifts the quantile value through an ambiguity radius. Both methods provide the same calibration-conditional guarantee for the true distribution, requiring the target coverage to hold with high probability over the calibration sample. Their constructions differ, however: CP uses a closed-form, distribution-free level correction, while DRO uses a value-space correction whose certified radius depends on properties of the unknown distribution and additionally guarantees coverage uniformly over the ambiguity set. This distinction emerges in the tails of the score distribution. Because CP relies on sparse upper-tail order statistics of the calibration samples, its level inflation barely moves the estimator when those samples are dense near the target quantile but overshoots when they are sparse, whereas a well-chosen DRO radius corrects in value space and may avoid this overshoot.

Related papers

• Characterizing Heterogeneous Rates in Finite Mixture Estimation via Partial Optimal Transport [88.55403215843967]
  Voronoi-based partial optimal transport (VPOT) for obtaining refined local and global convergence guarantees for the maximum likelihood estimator of the mixing measure.<n>Results hold in arbitrary fixed dimension without requiring mixing proportions to be uniformly bounded away from zero or prior knowledge of the true number of mixture components.
  arXiv  Detail & Related papers  (2026-09-15T04:32:53Z)
• Beyond Marginal Validity: Finite-Sample Guarantees for Localized Conformal Prediction [25.59471163637912]
  Conformal prediction endows arbitrary black-box predictors with finite-sample, distribution-free marginal coverage.<n>We provide finite-sample guarantees for the realized localized set that jointly control conditional validity and oracle efficiency.<n>We analyze data-split learned scores: when the score targets a pivotal score, uniform local guarantees decompose into fixed-score calibration and uniform score-estimation errors.
  arXiv  Detail & Related papers  (2026-08-06T15:59:57Z)
• Robust Chance-Constrained Optimization using a Continuous Parameter Space Wasserstein-2 Ambiguity Set of Gaussian Mixtures [0.0]
  We study distributionally robust linear chance-constrained problems in which uncertainty is modeled by a Gaussian mixture model (GMM)<n>We develop an adaptive cutting-surface algorithm, which endogenously determines the locations of mixture components receiving mass.<n>A case study using the electric-vehicle charging-station energy-allocation problem demonstrates the framework's practical value.
  arXiv  Detail & Related papers  (2026-07-19T01:10:05Z)
• Density-Ratio Losses for Post-Hoc Learning to Defer [61.81110533670321]
  We study post-hoc Learning to Defer (L2D) through the lens of ideal distributions.<n>We define deferral via the density-ratio between a model's and an expert's ideals.<n>Deferral decisions are then made by thresholding the scorer, allowing deferral rates to be adjusted without retraining.
  arXiv  Detail & Related papers  (2026-05-19T08:56:23Z)
• Fair regression under localized demographic parity constraints [9.082079838093371]
  We introduce a novel ($ell$, Z)-fair predictor, which imposes groupwise CDF constraints of the form F f |S=s (z m ) = $ell$ m for prescribed pairs.<n> Experiments on synthetic and real datasets illustrate an interpretable fairness-accuracy trade-off, enabling targeted corrections at decision-relevant quantiles or thresholds.
  arXiv  Detail & Related papers  (2026-03-26T09:21:05Z)
• Co-optimization for Adaptive Conformal Prediction [9.881784717196675]
  We propose a framework that learns prediction intervals by jointly optimizing a center $m(x)$ and a radius $h(x)$.<n>Experiments on synthetic and real benchmarks demonstrate that CoCP yields consistently shorter intervals and achieves state-of-the-art conditional-coverage diagnostics.
  arXiv  Detail & Related papers  (2026-03-02T10:43:19Z)
• LEC: Linear Expectation Constraints for False-Discovery Control in Selective Prediction and Routing Systems [95.35293543918762]
  Large language models (LLMs) often generate unreliable answers, while uncertainty methods fail to fully distinguish correct from incorrect predictions.<n>We address this issue through the lens of false discovery rate (FDR) control, ensuring that among all accepted predictions, the proportion of errors does not exceed a target risk level.<n>We propose LEC, which reinterprets selective prediction as a constrained decision problem by enforcing a Linear Expectation Constraint.
  arXiv  Detail & Related papers  (2025-12-01T11:27:09Z)
• Beyond Uncertainty Sets: Leveraging Optimal Transport to Extend Conformal Predictive Distribution to Multivariate Settings [0.14504054468850666]
  Conformal prediction (CP) constructs uncertainty sets for model outputs with finite-sample coverage guarantees.<n>We show that optimal assignment is piecewise-constant across a fixed polyhedral partition of the score space.<n>This allows us to characterize the entire prediction set tractably, and provides the machinery to address a deeper limitation of prediction sets.
  arXiv  Detail & Related papers  (2025-11-19T05:59:01Z)
• Multivariate Conformal Prediction via Conformalized Gaussian Scoring [44.99833362998488]
  We estimate conditional density $mathbbP_Y|X$ and conformalize its level sets.<n>We show how to construct conformal sets with missing output values, refine conformal sets as partial information about $Y$ becomes available, and construct conformal sets on transformations of the output space.
  arXiv  Detail & Related papers  (2025-07-28T15:55:29Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• On the Practicality of Differential Privacy in Federated Learning by Tuning Iteration Times [51.61278695776151]
  Federated Learning (FL) is well known for its privacy protection when training machine learning models among distributed clients collaboratively. Recent studies have pointed out that the naive FL is susceptible to gradient leakage attacks. Differential Privacy (DP) emerges as a promising countermeasure to defend against gradient leakage attacks.
  arXiv  Detail & Related papers  (2021-01-11T19:43:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.