The estimation of optimal transport maps (a.k.a. Monge maps) is a central problem in optimal transport literature. Recent observations reveal that the flow map of the Wasserstein gradient flow of the relative entropy closely approximates—though does not exactly equal—the Monge map between a given source distribution and a Gaussian target. In this work, we demonstrate how the evolution equation governing this flow map can be corrected to form a constrained gradient flow that provably converges to the true Monge map.When the maps are parametrized as gradients of convex models (e.g. […]

Constant Bourdrez : "Learning To Sample From Diffusion Models Via Inverse Reinforcement Learning" Hanna Benarroch : "Certified Per-instance Unlearning using Individual Sensitivity Bounds"