Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations (Q1785197): Difference between revisions

\noindent Considered is the following stochastic program \[ J^{\ast}=\inf_{x\in \mathbb{X}}\left\{ \mathbb{E}^{\mathbb{P}}\left[ h\left( x,\xi \right) \right] =\int_{\Xi}h\left( x,\xi \right) \mathbb{P} \left( \mathrm{d}\xi \right) \right\} \] with a feasible set \(\mathbb{X}\subseteq \mathbb{R}^{n}\), an uncertainty set \(\Xi \subseteq \mathbb{R}^{m}\) and a loss function \(h:\mathbb{R}^{n}\times \mathbb{R}^{m}\rightarrow \mathbb{\bar{R}}\) which depends both on the decision vector \(x\in \mathbb{R}^{n}\) and the random vector \(\xi \in \mathbb{R}^{m}\), whose distribution \(\mathbb{P}\) is supported on \(\Xi \). In most situations of practical interest the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, the authors construct a ball in the space of (multivariate and non-discrete) probability distributions centered at the uniform distribution on the training samples, and they seek decisions that perform best in view of the worst-case distribution within this Wasserstein ball. In this paper, the authors demonstrate that, under mild assumptions, the distributionally robust optimization problems over Wasserstain balls can in fact be reformulated as finite convex programs -- in many interesting cases even as tractable linear programs. They also show that their solutions enjoy powerful finite-sample performance guarantees. Finally, the theoretical results are exemplified in mean-risk portfolio optimization as well as uncertainty quatification.