Wasserstein Flow Matching: Generative modeling over families of distributions
Doron Haviv, Aram-Alexandre Pooladian, Dana Pe'er, and Brandon Amos

TL;DR
Wasserstein Flow Matching (WFM) introduces a novel approach to generative modeling over families of distributions using Wasserstein geometry, enabling high-dimensional distribution generation with theoretical guarantees and versatile computational methods.
Contribution
WFM is the first algorithm to generate distributions in high dimensions by lifting flow matching onto families of distributions using Wasserstein geometry.
Findings
Successfully generates 2D and 3D shapes.
Generates high-dimensional cellular microenvironments.
Combines optimal transport theory with attention mechanisms.
Abstract
Generative modeling typically concerns transporting a single source distribution to a target distribution via simple probability flows. However, in fields like computer graphics and single-cell genomics, samples themselves can be viewed as distributions, where standard flow matching ignores their inherent geometry. We propose Wasserstein flow matching (WFM), which lifts flow matching onto families of distributions using the Wasserstein geometry. Notably, WFM is the first algorithm capable of generating distributions in high dimensions, whether represented analytically (as Gaussians) or empirically (as point-clouds). Our theoretical analysis establishes that Wasserstein geodesics constitute proper conditional flows over the space of distributions, making for a valid FM objective. Our algorithm leverages optimal transport theory and the attention mechanism, demonstrating versatility…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis
