TL;DR
This paper introduces a theoretical framework linking flow path straightness to sampling efficiency in generative models, demonstrating how minimizing curvature can enable high-fidelity, single-step sampling.
Contribution
It establishes the first Wasserstein convergence bound related to flow straightness and provides conditions under which rectified flow achieves perfect straightness and optimal coupling.
Findings
Introducing the Piecewise Straightness parameter $oldsymbol{_{2,T}}$
Proving bounds that connect flow curvature to sampling error
Identifying conditions for perfect straightness in rectified flow
Abstract
Flow Matching has become a cornerstone of modern generative models like Stable Diffusion 3, largely due to the efficiency of its Rectified Flow (RF) variant. The success of RF hinges on iteratively learning straight trajectories, pushing generation towards fewer sampling steps. However, the theoretical link between path geometry and sampling efficiency has been underexplored. This paper fills this gap by introducing a novel \textit{Piecewise Straightness} parameter, . We establish the first Wasserstein convergence bound that explicitly links the discretization error of \textit{any} general flow-model to , proving that minimizing curvature is the key to achieving high-fidelity, one-step sampling. Building on this theory, we establish the first theoretical framework to analyze the straightness of RF. We begin by offering intuitive geometric arguments for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFluid Dynamics and Turbulent Flows · Navier-Stokes equation solutions
