Limit Points of Reflow with Minibatch Optimal Transport
Antonin Chambolle, Johannes Hertrich
Abstract
Rectified flows, also called flow matching or stochastic interpolants, are generative models that learn a time-dependent vector field steering a probability curve between two probability distributions, usually referred to as latent and target distributions. Reflow accelerates inference by iteratively straightening the trajectories induced by this vector field. We study the asymptotic behavior of this iteration and characterize its limit points. First, we define weak rectified couplings which always exist. Next, when rectified flow updates are alternated with minibatch optimal transport steps of fixed batch size, we show that any limit is N-cyclically monotone, where N is the batch size. Such N-cyclically monotone couplings enjoy favorable structural and stability properties such as rectifiability and straightness. Finally, restricting velocities to gradient fields and assuming additional support conditions, we prove that reflow limits coincide with the optimal transport map between the endpoint distributions.
Create a lesson
Related papers
Extreme least singular values of random row submatrices with bounded-density subgaussian entries
Xiufan Yang, Shu Wen, Yitzchak Shmalo
A pathwise Ito formula for weakly differentiable functions
Anna Ananova, Rama Cont
Unified framework for asymptotically uniform iterative construction of generalised random graphs with local constraints
Ivan Kryven, Rik Versendaal, Mike de Vries
Negative association of Busemann functions in exponential last-passage percolation
Erik Bates, Xiao Shen
Sharp asymptotics for the tree-completion time in cylindrical Hastings--Levitov(0)
Xiao-Ming Fu, Tianyang Sun, Yuxuan Zong
Pairwise edge correlations in random minimum spanning trees: a universal bound and complete-graph negative correlation
Anish Gupta