Pith. sign in

REVIEW 1 cited by

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.00362 v4 pith:TRMBEYEJ submitted 2022-04-30 math.OC cs.LGstat.ML

classification math.OCcs.LGstat.ML
keywords distributionallyrobustdualityoptimizationmeasurableanalysisgeneralholds
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a general duality result for Wasserstein distributionally robust optimization that holds for any Kantorovich transport cost, measurable loss function, and nominal probability distribution. Assuming an interchangeability principle inherent in existing duality results, our proof only uses one-dimensional convex analysis. Furthermore, we demonstrate that the interchangeability principle holds if and only if certain measurable projection and weak measurable selection conditions are satisfied. To illustrate the broader applicability of our approach, we provide a rigorous treatment of duality results in distributionally robust Markov decision processes and distributionally robust multistage stochastic programming. Additionally, we extend our analysis to other problems such as infinity-Wasserstein distributionally robust optimization, risk-averse optimization, and globalized distributionally robust counterpart.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Two-Stage Distributionally Robust Optimization: Intuitive Understanding and Algorithm Development from the Primal Perspective

    math.OC 2024-12 conditional novelty 6.0 of 10

    A column-generation-based C&CG algorithm from the primal perspective solves two-stage DRO exactly and empirically much faster, including problems with infeasible recourse and non-convex ambiguity sets.

Pith tools