Skip to content
Preprint

Harnessing Heterogeneous Data for Conditional Optimization via Optimal Transport

Jul 2026 · 0 citations
Mathematics

TL;DR

A distributionally robust framework based on optimal transport (OT) for harnessing such heterogeneous data in conditional optimization and demonstrating the value of the framework through a conditional assortment problem using demand and product-feature data from multiple stores is demonstrated.

Abstract

Conditional optimization tailors decisions to contextual or event information, but its practical use is often limited by the difficulty of learning the relevant conditional distribution from finite samples of a target joint distribution. This challenge is especially acute when target joint data are scarce or unavailable, or when few observations fall in the conditioning region of interest. Related joint data may be available from multiple sources, such as different stores, markets, populations, or operating environments, but these sources may be biased relative to the target distribution and cannot be pooled naively. We develop a distributionally robust framework based on optimal transport (OT) for harnessing such heterogeneous data in conditional optimization. The framework constructs ambiguity sets over joint distributions using OT distances to empirical source distributions and optimizes worst-case conditional performance over plausible target laws. We propose three OT ambiguity sets that capture different ways of using heterogeneous sources: enforcing simultaneous source consistency, aggregating source discrepancies through weights, and centering the ambiguity set at an OT barycenter. We derive tractable reformulations, establish feasibility conditions, discuss parameter choices, and characterize the relationships among the formulations, revealing trade-offs between robustness, information aggregation, and computational complexity. We demonstrate the value of the framework through a conditional assortment problem using demand and product-feature data from multiple stores.

View source

Similar papers

Preprint Jul 2026

Learning the Center and Radius of Wasserstein Ambiguity Sets for Data-Driven Decision Making

A more flexible framework in which a predictive model determines the nominal distribution and a separate model estimates a data-dependent radius is developed, which treats calibration as a practical mechanism for reliable decision making rather than a universal guarantee of improved optimization performance.

Junjie Guo · 1 citation
Preprint Aug 2026

A Primal Perspective on Distributionally Robust Optimization: An Investigation on Modeling and Solution Strategies

It is shown that BiCS is applicable to standard DRO, almost-sure DRO, DRO with various chance constraints, and DRO with ambiguity sets strengthened by local information, and demonstrates superior performance, including solving cases where the examined compact reformulations are unavailable or computationally difficult.

Yiqi Tian, Bo Zeng · 0 citations
Book Open access Aug 2026

Causal Structure-guided Distributionally Robust Optimization under Domain Shifts

Causal Structure-guided DRO (CS-DRO) is proposed, which estimates a directed acyclic graph (DAG) that encodes the predictive relationships between representations and labels, serving as a proxy for causal structure shared across source domains.

Seonggyeom Kim, Eunjung Choi, Dong-Kyu Chae · 0 citations
Jul 2026

Generative Distributionally Robust Optimization

This work proposes Generative Distributionally Robust Optimization (GDRO), a principled framework that accepts any sampleable conditional generator as the nominal model and restricts worst-case laws to a chosen conditional generator family.

Zi-Wei Zhang, Jonathan Yu-Meng Li, Zhihao Jin · 0 citations
Jul 2026

Weak-to-Strong Learning in Decision Making

A decision-aware weak-to-strong (W2S) framework that leverages both labeled and unlabeled data to improve contextual stochastic optimization and establishes a non-asymptotic upper bound on the excess decision risk of W2S and a complementary lower bound for a strong-only benchmark.

Jingwei Ji, Renyuan Xu · 0 citations

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