Sign inGet started
Paper · arXiv

Generative Distributionally Robust Optimization

Generative models are increasingly adopted in distributionally robust optimization (DRO), but existing approaches trade off model compatibility and adversarial structure: methods that accept arbitrary samplers do not restrict worst-case laws to a generator family, while generator-parameterized adversaries rely on model-specific access such as likelihoods, scores, or training data. We propose 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. The key is the sampler-Sinkhorn pairing: samplers represent the conditional laws...

AuthorsZiwei Zhang, Jonathan Yu-Meng Li, Zhihao Jin
Primary categorycs.LG
Published27 July 2026
Last updated at source27 July 2026
cs.LGcs.AImath.OCstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/f21c7d40-4988-4c34-b43e-f5cd151c3a6a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.