Distributionally Robust Convex Optimization III: The Lifting Theorem — a Conic Bound on E[g(z̃)] Describes Exactly the z̃-Marginals of a Lifted Ambiguity SetResearch Paper
Distributionally robust optimization asks a decision to perform well against every probability distribution in an ambiguity set , a family of distributions consistent with partial information about an uncertain parameter . Which kinds of information an ambiguity set can encode decides which models a solver can handle.…