Perturbation Duality for Robust and Distributionally Robust Optimization: Short and General Proofs
Louis L. Chen, Jake Roth, Johannes O. Royset

TL;DR
This paper introduces perturbation duality as a unifying framework for robust and distributionally robust optimization, simplifying proofs and broadening applicability beyond traditional methods.
Contribution
It applies perturbation duality to derive dual formulations in RO and DRO without restrictive assumptions, unifying existing approaches and simplifying proofs.
Findings
Established dual representation for DRO framework with optimal transport and moment constraints.
Provided a unified characterization of the primal-worst equals dual-best principle.
Simplified recent results with concise, general proofs using perturbation duality.
Abstract
Duality is a foundational tool in robust and distributionally robust optimization (RO and DRO), underpinning both analytical insights and tractable reformulations. The prevailing approaches in the literature primarily rely on saddle-point arguments, Lagrangian techniques, and conic duality. In contrast, this paper applies perturbation duality in the sense of Fenchel--Rockafellar convex analysis and demonstrates its effectiveness as a general and unifying methodology for deriving dual formulations in RO and DRO. We first apply perturbation duality to a recently proposed DRO framework that unifies phi-divergence and Wasserstein ambiguity sets through optimal transport with conditional moment constraints. We establish the associated dual representation without imposing compactness assumptions previously conjectured to be necessary, instead introducing alternative conditions motivated by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
