Skip to content
Preprint

Local-discrepancy ambiguity sets for distributionally robust optimization

Oct 2026 · 0 citations · 28 references
Mathematics

TL;DR

A new class of data-driven ambiguity sets for distributionally robust optimization (DRO) that aim to enhance the local inference accuracy of an unknown distribution are introduced, where the support of the distribution is partitioned into predefined regions and transport cost constraints are imposed locally to each region.

Abstract

In this paper, we introduce a new class of data-driven ambiguity sets for distributionally robust optimization (DRO) that aim to enhance the local inference accuracy of an unknown distribution. Building on optimal transport-based discrepancy measures, we depart from the conventional paradigm of monolithic ambiguity balls, which rely on a single global transport budget to capture distributional uncertainty. Instead, we introduce local-discrepancy ambiguity sets, where the support of the distribution is partitioned into predefined regions and transport cost constraints are imposed locally to each region. This added flexibility allows for a more refined characterization of plausible distributions by preventing highly imbalanced transport across regions. As a result, the proposed approach can yield less conservative and more robust decisions, particularly in settings where decisions depend on the local properties of the sample space. We further derive tractable reformulations of the resulting DRO problems and demonstrate through simulations that our method can outperform traditional Wasserstein ambiguity sets in terms of decision quality.

View source

Similar papers

#machine learning Preprint Oct 2026

Calibrating Ambiguity Set via Diagnostic Transport for Distributionally Robust Optimization

Distributionally robust optimization (DRO) protects decisions against distributional uncertainty by optimizing over an ambiguity set, but poorly aligned set geometry can require large radii and yield overly conservative decisions. We introduce diagnostic-transport DRO (DT-DRO), which uses held-out calibration data to a...

Wen-Bin Zhou, Elizabeth Cucuzzella, Shi-Xiang Zhu · 0 citations
Preprint Sep 2026

On the Relevance of Incorporating Decision Dependence in Distributional Ambiguity

Most existing studies on distributionally robust optimization (DRO) with a decision-dependent ambiguity set focus on the computational and theoretical challenges posed by this class of problems. In this paper, we adopt a combined modeling and computational perspective to understand the trade-offs between modeling fidel...

Hamed Rahimian, Sanjay Mehrotra · 0 citations
Preprint Sep 2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Conformal-DRO is proposed, which uses nested conformal regions to construct an ambiguity set for the future latent law, which covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism.

Lu-Hao Zhang, Shi-Xiang Zhu · 1 citation
Preprint Oct 2026

Adaptive Scenario Generation for KL-DRO Around a Learned Density Model

Distributionally robust optimization (DRO) hedges data-driven two-stage stochastic programs against error in the distribution estimated from a finite record, and standard ambiguity sets differ in how they treat realizations absent from that record. A divergence ball around the empirical distribution contains only rewei...

Aron Brenner, Saurabh Amin · 0 citations
Preprint Oct 2026

A Unifying View of Distributionally Robust Optimization for Probability Smoothing via Maximum Entropy

The probability smoothing problem seeks estimators that assign positive probability to all categories, including those unobserved in a finite sample. In our previous work, we established that the estimator derived from distributionally robust optimization (DRO) with a $q$-norm ambiguity set ($q$-DRO) satisfies the axio...

Kota Kurihara, Yuya Yamakawa, Yoichi Izunaga · 0 citations
Open access Oct 2026

Optimize-via-Estimate: How to Make Finite-Sample Corrections for Sampling Uncertainty in Data-Driven Optimization

We propose a novel procedure for correcting for the effects of sampling and parameter uncertainty in data-driven convex optimization. We consider the data-driven setting wherein the distribution lies in a parametric family with unknown parameter. The decision-maker possesses a historical data set, from which solves a p...

G. Loke, Tao-Zeng Zhu, Rui-Ting Zuo · 1 citation

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