Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization

Published 30 Apr 2022 in math.OC, cs.LG, and stat.ML | (2205.00362v4)

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.

Authors (3)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)
  1. Aliprantis CD, Border K (2006) Infinite Dimensional Analysis: A Hitchhiker’s Guide (Springer Science & Business Media).
  2. Aubin JP, Frankowska H (2009) Set-valued analysis (Springer Science & Business Media).
  3. Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Mathematics of Operations Research 44(2):565–600.
  4. Föllmer H, Schied A (2010) Convex and coherent risk measures. Encyclopedia of Quantitative Finance 355–363.
  5. Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with wasserstein distance. Mathematics of Operations Research 48(2):603–655.
  6. Kallenberg O (1997) Foundations of modern probability, volume 2 (Springer).
  7. Luenberger DG (1997) Optimization by vector space methods (John Wiley & Sons).
  8. Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Mathematical Programming 171(1-2):115–166.
  9. Rockafellar RT (1970) Convex analysis. Number 28 in Princeton Mathematical Series (Princeton university press).
  10. Shapiro A (2001) On duality theory of conic linear problems. Semi-infinite programming, 135–165 (Springer).
  11. Shapiro A (2017) Interchangeability principle and dynamic equations in risk averse stochastic programming. Operations Research Letters 45(4):377–381.
  12. Shreve SE, Bertsekas DP (1979) Universally measurable policies in dynamic programming. Mathematics of Operations Research 4(1):15–30.
  13. Xie W (2021) On distributionally robust chance constrained programs with Wasserstein distance. Mathematical Programming 186(1):115–155.
  14. Yang I (2017) A convex optimization approach to distributionally robust markov decision processes with Wasserstein distance. IEEE control systems letters 1(1):164–169.
  15. Yang Z, Gao R (2022) Wasserstein Regularization for 0-1 Loss. Optimization Online preprint.
  16. Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with Wasserstein metric. Operations Research Letters 46(2):262–267.
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 6 likes about this paper.