arXiv Machine Learning

Multimarginal flow matching with optimal transport potentials

arXiv:2606. 05327v1 Announce Type: new Abstract: Flow matching (FM) has emerged as a powerful framework for learning dynamic transport maps between two empirical distributions.

Hugging Face Trending Papers
Jun 29

The Fundamental Limits of Valid Transport Map Estimation

Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint.

arXiv Machine Learning
Aug 4

Beckmann Transport Models: From Autonomous Flows to One-Step Maps

arXiv:2608. 01692v1 Announce Type: new Abstract: We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the target is singular, i.

By Lee Cheuk-Kit, Florentin Coeurdoux, Peter Potaptchik, Yilun Du, Michael Samuel Albergo, Eric Vanden-Eijnden
arXiv Machine Learning
Jun 8

Drifting Models for Surrogate Flow Modeling

arXiv:2606. 07481v1 Announce Type: new Abstract: While Computational Fluid Dynamics (CFD) provides high-fidelity flow fields for optimizing indoor environments, its computational cost limits rapid exploration.

By Chris R. Jung, Markus D\"orr, Natalie J\"ungling, Jennifer Niessner, Adam T. M\"uller, Nicolaj C. Stache