mlsanityData to 14 Oct 2026

Expected Batch Optimal Transport Plans and Consequences for Flow Matching

arXiv 2605.12174 ↗First posted 12 May 2026cs.LG math.PRcited by 6

On the map: Diffusion models → Flow matching, time series and science

Abstract (arXiv)

Solving optimal transport (OT) on random minibatches is a common surrogate for exact OT in large-scale learning. In flow matching (FM), this surrogate is used to obtain OT-like couplings that can straighten probability paths and reduce numerical integration cost. Yet, the population-level coupling induced by repeated minibatch OT remains only partially understood. We formalize this coupling as the expected batch OT plan overlineπk, obtained by averaging empirical OT plans over independent minibatches of size k. We then establish its large-batch consistency and, in the semidiscrete case relevant to generative modeling, derive rates for both the transport-cost bias and the convergence of overlineπk to the OT plan. For FM, this yields a population coupling whose induced velocity field is regular enough to define a unique flow from the source to the discrete target. We finally quantify how OT batch size interacts with numerical integration in a tractable two-atom model and in synthetic and image experiments.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 2 of its 39 references that are in the map. First posted on arXiv 12 May 2026.

Builds on

2 of 39 references.

Closest ancestors · 1

Same direction, newest first

  1. 2026Tessellations of Semi-Discrete Flow Matching8 May

Other references · 1

  1. 2021Minibatch optimal transport distances; analysis and applicationscited by 65

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 6.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Optimal Transport Flow Matching by Design
  2. 2026Flow Matching from Viewpoint of Proximal Operators
  3. 2025Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching
  4. 2024Minibatch Optimal Transport and Perplexity Bound Estimation in Discrete Flow Matching
  5. 2025The Curse of Conditions: Analyzing and Improving Optimal Transport for Conditional Flow-Based Generation
  6. 2026ODE-free Neural Flow Matching for One-Step Generative Modeling
  7. 2026Beyond Transport Cost: Routing Differences between Flow Matching and Optimal Transport
  8. 2024Optimal Flow Matching: Learning Straight Trajectories in Just One Step