Expected Batch Optimal Transport Plans and Consequences for Flow Matching
The research investigates using expected batch optimal transport plans ($\pi_k$) as a shortcut for solving complex optimal transport problems in flow matching models. It proves that this approximation converges to the true plan at a rate of $O(k^{-1/2})$ and guarantees that the resulting flow is well-posed, providing theoretical backing for using large batches in practice.