Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

• URL: http://arxiv.org/abs/2609.11073v1
• Date: Thu, 10 Sep 2026 04:30:21 GMT
• Title: Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set
• Abstract summary: This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation.<n>We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law.<n>The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.
• Score: 9.492534748349316
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-α$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $α$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

Related papers

• Exact Risk-Complexity Laws for Projective Boundaries in Scenario Optimization and Distribution-Free Certification [0.0]
  Conditional violation risk follows an exact beta law, whose tail has a beta-binomial representation and whose parameter is a support, calibration, or compression dimension.<n>This paper identifies the deterministic boundary mechanism behind these formulas and derives the corresponding law when the observed boundary size is random.<n>It also yields conditional probabilistic certificates and a no-go result explaining why observed complexity alone is insufficient.
  arXiv  Detail & Related papers  (2026-09-01T14:58:38Z)
• 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)
• Tokens-per-Parameter Coverage Is Critical for Robust LLM Scaling Law Extrapolation [45.56738584872585]
  Neural scaling laws approximate a language model's loss as a power-law function of parameter count $N$ and token count $D$.<n>We show that a collinear design induces an inherent ill-conditioning in the Gauss-Newton least-squares problem.<n>We prove this for four scaling-law formalisms and derive a closed-form TPP-diversity threshold that is necessary and sufficient for well-conditioned estimation.
  arXiv  Detail & Related papers  (2026-05-08T23:00:17Z)
• Decision-Focused Federated Learning Under Heterogeneous Objectives and Constraints [45.88028371034407]
  We build on the well-known SPO+ approach and develop heterogeneity bounds for the SPO+ surrogate loss.<n>In the case of strongly convex feasible regions, sharper bounds are derived due to the stability.<n>We implement a FedAvg-style DFFL set of experiments on both polyhedral and strongly convex problems.
  arXiv  Detail & Related papers  (2026-04-21T22:22:39Z)
• 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)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Bulk-Calibrated Credal Ambiguity Sets: Fast, Tractable Decision Making under Out-of-Sample Contamination [8.826173150779145]
  Distributionally robust optimisation (DRO) minimises the worst-case expected loss over an ambiguity set.<n>We show how IP credal sets translate into DRO objectives with interpretable tolerance levels.
  arXiv  Detail & Related papers  (2026-01-29T06:37:36Z)
• Contextual Distributionally Robust Optimization with Causal and Continuous Structure: An Interpretable and Tractable Approach [2.8445258546547625]
  We introduce a framework for contextual distributionally robust optimization (DRO)<n>We first introduce the causal Sinkhorn discrepancy (CSD), an entropy-regularized causal Wasserstein distance.<n>We derive a contextual DRO model with a CSD-based ambiguity set, termed Causal Sinkhorn DRO (Causal-SDRO)<n>We propose the Soft Forest Regression (SRF) decision rule, which approximates optimal policies within arbitrary measurable function spaces.
  arXiv  Detail & Related papers  (2026-01-16T06:18:22Z)
• 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)
• Distributionally Robust Optimization with Adversarial Data Contamination [49.89480853499918]
  We focus on optimizing Wasserstein-1 DRO objectives for generalized linear models with convex Lipschitz loss functions.<n>Our primary contribution lies in a novel modeling framework that integrates robustness against training data contamination with robustness against distributional shifts.<n>This work establishes the first rigorous guarantees, supported by efficient computation, for learning under the dual challenges of data contamination and distributional shifts.
  arXiv  Detail & Related papers  (2025-07-14T18:34:10Z)
• Conformal Prediction under Levy-Prokhorov Distribution Shifts: Robustness to Local and Global Perturbations [41.94295877935867]
  We use Levy-Prokhorov (LP) ambiguity sets to model distribution shifts.<n>We show that the link between conformal prediction and LP ambiguity sets is a natural one.<n>We construct robust conformal prediction intervals that remain valid under distribution shifts.
  arXiv  Detail & Related papers  (2025-02-19T21:18:11Z)
• Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Bandits [18.982448033389588]
  Off-policy evaluation and learning are concerned with assessing a given policy and learning an optimal policy from offline data without direct interaction with the environment. To account for the effect of different environments during learning and execution, distributionally robust optimization (DRO) methods have been developed. We propose a novel DRO approach that employs the Wasserstein distance instead.
  arXiv  Detail & Related papers  (2023-09-15T20:21:46Z)
• Distributional Robustness and Regularization in Reinforcement Learning [62.23012916708608]
  We introduce a new regularizer for empirical value functions and show that it lower bounds the Wasserstein distributionally robust value function. It suggests using regularization as a practical tool for dealing with $textitexternal uncertainty$ in reinforcement learning.
  arXiv  Detail & Related papers  (2020-03-05T19:56:23Z)

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.