arXiv Machine Learning By Fanghui Song, Zhongjian Wang, Jiebao Sun

COFM: Consistent Optimal Transport Flow Matching via Partially Input Convex Neural Networks

Read the original on arXiv Machine Learning →

The paper introduces COFM, a framework for consistent optimal transport flow matching that uses partially input convex neural networks (PICNN) to parameterize the transport potential. By adding a Hamilton‑Jacobi residual to the training objective, COFM enforces dynamical consistency and supports both one‑step transport and multi‑step ODE sampling without costly inner optimization. Experiments on benchmark datasets show that COFM achieves competitive performance while reducing L^2‑UVP by over 2× and cutting computational time by about 9× compared to state‑of‑the‑art models.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 15

A Variational Optimal Transport Operator on Incompressible Flow

The paper introduces the Variational Incompressible Optimal Transport (VIOT) operator, a generative neural operator that predicts divergence‑free velocity fields for incompressible density transport. VIOT combines a stream‑function representation, a regularized transport objective, and a Fourier Neural Operator backbone to amortize the solve across new source‑target pairs and grid resolutions. Experiments on 2D and 3D benchmarks show that VIOT produces full transport trajectories in seconds, achieving roughly a $10^4 imes$ speedup over per‑instance baselines that require hours of optimization.

By Jinjin He, Shenyifan Lu, Sinan Wang, Zhiqi Li, Duowen Chen, Bo Zhu
arXiv Machine Learning
Oct 9

Barron Optimal Transport I: Generative Modeling

The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.

By Evan Dogariu, Joan Bruna
arXiv Machine Learning
Sep 29

Distribution-Conditioned Transport

The paper introduces Distribution‑Conditioned Transport (DCT), a framework that learns transport maps conditioned on embeddings of source and target distributions, allowing generalization to unseen distribution pairs. DCT supports semi‑supervised learning for distributional forecasting by leveraging distributions observed at only one condition. It is agnostic to the transport mechanism and is demonstrated on synthetic benchmarks and four biological applications, including batch effect transfer in single‑cell genomics and modeling T‑cell receptor sequence evolution.

By Nic Fishman, Gokul Gowri, Paolo L. B. Fischer, Marinka Zitnik, Omar Abudayyeh, Jonathan Gootenberg