TL;DR
This paper introduces a neural network-based method using normalizing flows to approximate optimal transport maps between empirical distributions, enabling efficient transport and intermediate barycenter computation.
Contribution
It proposes a novel approach to approximate OT between empirical distributions using invertible neural networks, relaxing the Monge formulation with Wasserstein distance minimization.
Findings
Effective approximation of OT maps demonstrated on toy examples.
Method produces intermediate barycenters between distributions.
Shows good approximation of true OT in experiments.
Abstract
Optimal transport (OT) provides effective tools for comparing and mapping probability measures. We propose to leverage the flexibility of neural networks to learn an approximate optimal transport map. More precisely, we present a new and original method to address the problem of transporting a finite set of samples associated with a first underlying unknown distribution towards another finite set of samples drawn from another unknown distribution. We show that a particular instance of invertible neural networks, namely the normalizing flows, can be used to approximate the solution of this OT problem between a pair of empirical distributions. To this aim, we propose to relax the Monge formulation of OT by replacing the equality constraint on the push-forward measure by the minimization of the corresponding Wasserstein distance. The push-forward operator to be retrieved is then restricted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
