Supplementary Material: Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptation 1 Proofs

Neural Information Processing Systems 

In this section, we present the proofs: Duality: Theorem 1. For brevity, we shall ignore explicitly stating it in the rest of the proof. Now, we write the Lagrangian function with respect to marginal constraints. Furthermore, when the distributions lie in a metric space, we can further simplify this duality. Also, φ (x) = k ( x) and ψ ( x) = k (x) is a feasible solution in optimization (2).

Similar Docs  Excel Report  more

TitleSimilaritySource
None found