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:2606. 08953v1 Announce Type: new Abstract: Modern generative models often define an entire probability path from a simple prior to the data law, rather than only an endpoint map.
By Lei Luo, Yingzhen Zhang, Jian Yang
arXiv:2505. 06589v2 Announce Type: replace-cross Abstract: Modern machine learning repeatedly manipulates probability measures: empirical datasets, generated samples, latent distributions, class-conditional laws, particle systems, weights of wide networks and attention patterns.
By Gabriel Peyr\'e
arXiv:2608. 07042v1 Announce Type: cross Abstract: Rectified flows, also called flow matching or stochastic interpolants, are generative models that learn a time-dependent vector field steering a probability curve between two probability distributions, usually referred to as latent and target distributions.
By Antonin Chambolle, Johannes Hertrich
arXiv:2604. 04342v2 Announce Type: replace Abstract: Many data-driven decision problems are formulated using a nominal distribution estimated from historical data, while performance is ultimately determined by a deployment distribution that may be shifted, context-dependent, partially observed, or stress-induced.
By Xiuyuan Cheng, Yunqin Zhu, Yao Xie
arXiv:2606. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.
By Shimon Malnick, Matan Rusanovsky, Ohad Fried, Shai Avidan
arXiv:2606. 24987v1 Announce Type: cross Abstract: Optimal transport (OT) has become a central language for comparing probability measures, but exact balanced OT is often both too rigid for data with missing, created, or destroyed mass and subject to unfavorable high-dimensional sample complexity.
By Francisco Andrade, Gabriel Peyr\'e, Clarice Poon
arXiv:2608. 02487v1 Announce Type: cross Abstract: Recently, rectified flow has emerged as a fundamental framework for large-scale image generation, powering state-of-the-art systems such as FLUX.
By Leda Wang, Zhehao Xu, Qiang Liu, Harrison H. Zhou
arXiv:2607. 19332v1 Announce Type: new Abstract: Generative models have undergone many generations of evolution, from VAEs/GANs to diffusion/flow matching.
By Chirag Vashist, Ke Li
arXiv:2606. 02515v1 Announce Type: new Abstract: Optimal transport (OT) provides a principled framework for mapping between probability distributions.
By Yeganeh Marghi, Kelly Jin, Uygar S\"umb\"ul
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:2606. 14023v1 Announce Type: cross Abstract: Optimal Transport has become recently a powerful method for domain adaptation by aligning source and target distributions.
By Brian Britos, Mathias Bourel