A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization IV: On a Polish Space, the Maximum-Transport-Cost Worst-Case Loss Equals E[sup{f(x) : c(X̂, x) ≤ ρ}]Research Paper
In Wasserstein distributionally robust optimization (DRO) a decision is evaluated against the worst distribution within an optimal-transport ball around a nominal distribution . For a Wasserstein distance of finite order , the ball constrains an average transport cost. The case is different. The -Wasserstein distance …