arXiv AI
Branched Optimal Transport Amortization
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jun 5
Your GFlowNet Secretly Learns an Optimal Transport Plan
arXiv:2606. 06272v1 Announce Type: new Abstract: Generative Flow Networks (GFlowNets) are a framework for sampling structured objects via stochastic trajectories in a directed graph.
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 30
The Fundamental Limits of Valid Transport Map Estimation
arXiv:2606. 30574v1 Announce Type: new Abstract: 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.
arXiv Machine Learning
Aug 28
COFM: Consistent Optimal Transport Flow Matching via Partially Input Convex Neural Networks
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.
arXiv Machine Learning
Jun 16
Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions
arXiv:2511. 09465v4 Announce Type: replace-cross Abstract: Diffusion and flow matching approaches to generative modeling have shown promise in domains where the state space is continuous, such as image generation or protein folding & design, and discrete, exemplified by diffusion large language models.
arXiv Machine Learning
3d ago
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.