Scaling Online Optimal Transport Minibatches for Flow Matching
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
A central challenge in scaling flow models is maintaining stability in training and integration. In flow matching, this stability depends critically on how source samples are paired with data. Independent random pairing introduces substantial stochasticity, motivating minibatch optimal transport (OT) to construct online source-target couplings that reduce this randomness (Tong et al., 2024). However, as applications extend to larger and higher-dimensional datasets, small minibatches can limit these benefits, while scaling the coupling to substantially larger minibatches at every iteration is computationally prohibitive. Moreover, how OT coupling affects the full stochastic gradient and integration remains theoretically unresolved. In this work, we develop a scalable online entropic OT approximation that enables substantially larger source-target couplings while preserving the benefits of OT. We close the theoretical gap for both unregularized and entropic OT by proving strict reductions in full stochastic-gradient variance and integration error relative to independent pairing, and further characterize how these improvements strengthen as the online coupling minibatch grows. Experiments on single-cell gene interpolation-flow and image-flow training validate these predictions, showing that larger online couplings consistently improve training stability and final generation performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 44 of its 58 references that are in the map. First posted on arXiv 13 Oct 2026.
Builds on
44 of 58 references.
Closest ancestors · 14
Same direction, newest first
- 2026Limit Points of Reflow with Minibatch Optimal Transport7 Aug
- 2026Expected Batch Optimal Transport Plans and Consequences for Flow Matching12 May
- 2026On the Role of Strain and Vorticity in Numerical Integration Error for Flow Matching22 Apr
- 2025Gradient Variance Reveals Failure Modes in Flow-Based Generative Models20 Oct
- 2025Longitudinal Flow Matching for Trajectory Modeling3 Oct
- 2025Flow Matching with Semidiscrete Couplings29 Sep
- 2025Flow Matching in the Low-Noise Regime: Pathologies and a Contrastive Remedy25 Sep
- 2025Weighted Conditional Flow Matching29 Jul
- 2025Path Gradients after Flow Matching15 May
- 2024Optimal Flow Matching: Learning Straight Trajectories in Just One Step19 Mar
- 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplings28 Apr
- 2023Improving and generalizing flow-based generative models with minibatch optimal transport1 Feb
2 more
Other references · 30
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2016Input Convex Neural Networkscited by 414
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
- 2019SGD: General Analysis and Improved Ratescited by 207
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2022Neural Optimal Transportcited by 126
- 2019Wasserstein-2 Generative Networkscited by 97
- 2018Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?cited by 88
- 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 87
- 2019On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithmscited by 62
18 more
- 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 51
- 2020Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networkscited by 50
- 2022Neural Optimal Transport with General Cost Functionalscited by 36
- 2021Entropic Optimal Transport: Convergence of Potentialscited by 31
- 2019On the Complexity of Approximating Multimarginal Optimal Transportcited by 28
- 2018An explicit analysis of the entropic penalty in linear programmingcited by 24
- 2022Gradients should stay on Path: Better Estimators of the Reverse- and Forward KL Divergence for Normalizing Flowscited by 23
- 2021Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithmcited by 22
- 2022Path-Gradient Estimators for Continuous Normalizing Flowscited by 11
- 2025On Fitting Flow Models with Large Sinkhorn Couplingscited by 11
- 2026FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPUcited by 11
- 2024Adaptive Non-uniform Timestep Sampling for Accelerating Diffusion Model Trainingcited by 9
- 2025Scaled-Dot-Product Attention as One-Sided Entropic Optimal Transportcited by 8
- 2025AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transportcited by 7
- 2026Flow Matching for Offline Reinforcement Learning with Discrete Actionscited by 6
- 2023Convergence Rates of the Regularized Optimal Transport : Disentangling Suboptimality and Entropycited by 5
- 2026You Need Better Attention Priorscited by 4
- 2015Complete Duality for Martingale Optimal Transport on the Linecited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching
- 2026Optimal Transport Flow Matching by Design
- 2026The Coupling Within: Flow Matching via Distilled Normalizing Flows
- 2024Minibatch Optimal Transport and Perplexity Bound Estimation in Discrete Flow Matching
- 2026Faster Inference of Flow-Based Generative Models via Improved Data-Noise Coupling
- 2026ODE-free Neural Flow Matching for One-Step Generative Modeling
- 2026Multiscale Supervised Unbalanced Optimal Transport Flow Matching
- 2026One-Sided Quantile Coupling for Flow Matching