arXiv Machine Learning

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.

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
Jun 25

Entropy-Controlled Flow Matching

arXiv:2602. 22265v2 Announce Type: replace Abstract: Modern vision generators transport a base distribution to data through time-indexed measures, implemented as deterministic flows (ODEs) or stochastic diffusions (SDEs).

By Chika Maduabuchi
arXiv Machine Learning
Sep 15

Discrete Beckmann Transport Models for One-Step Language Modeling and Reasoning

Discrete Beckmann Transport Models (DBTM) are introduced as a new type of discrete diffusion and flow model that can generate language in a single step by mapping any point to a fixed point on the simplex vertices. Unlike previous approaches, DBTM eliminates the need for a pretrained teacher model and time conditioning by minimizing a conservation equation directly from data. The model can be partially trained and iterated until convergence, and it can be extended to a partial‑context interpolant that refines outputs with additional function evaluations. Experiments on language modeling and reasoning tasks show that DBTM achieves higher quality and accuracy than existing discrete diffusion and continuous flow baselines.

By Sophia Tang, Shiyi Wang
arXiv Machine Learning
Aug 3

P-Flow: Proxy-gradient Flows for Linear Inverse Problems

arXiv:2605. 08328v3 Announce Type: replace Abstract: Generative models based on flow matching have emerged as a powerful paradigm for inverse problems, offering straighter trajectories and faster sampling compared to diffusion models.

By Zehua Jiang, Fenghao Zhu, Xinquan Wang, Chongwen Huang, Zhaoyang Zhang
arXiv Machine Learning
Aug 7

Potential Matching Optimal Transport: Continuous Normalizing Flows for Exact $p$-Wasserstein Dynamics

arXiv:2608. 05666v1 Announce Type: new Abstract: We introduce Potential Matching Optimal Transport (PMOT), a potential-flow framework for general $p$-cost optimal transport with $c_p(x,y)=\|x-y\|^p$.

By Lishuo Zhang (School of Mathematical Sciences, Shanghai Jiao Tong University), Ruizhi Huang (School of Mathematical Sciences, Shanghai Jiao Tong University), Yang Yu (School of Mathematical Sciences, Shanghai Jiao Tong University), Lei Li (School of Mathematical Sciences, Shanghai Jiao Tong University, Institute of Natural Sciences, MOE-LSC, Shanghai Jiao Tong University)