Statistical Properties of Rectified Flow
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
Rectified flow (Liu et al., 2022; Liu, 2022; Wu et al., 2023) is a method for defining a transport map between two distributions, and enjoys popularity in machine learning, although theoretical results supporting the validity of these methods are scant. The rectified flow can be regarded as an approximation to optimal transport, but in contrast to other transport methods that require optimization over a function space, computing the rectified flow only requires standard statistical tools such as regression or density estimation, which we leverage to develop empirical versions of transport maps. We study some structural properties of the rectified flow, including existence, uniqueness, and regularity, as well as the related statistical properties, such as rates of convergence and central limit theorems, for some selected estimators. To do so, we analyze the bounded and unbounded cases separately as each presents unique challenges. In both cases, we are able to establish convergence at faster rates than those for the usual nonparametric regression and density estimation.
Key facts. Cited by 11 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 16 of its 101 references that are in the map. First posted on arXiv 5 Nov 2025.
Builds on
16 of 101 references.
Closest ancestors · 3
Same direction, newest first
- 2025On the Relation between Rectified Flows and Optimal Transport26 May
- 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transport29 Sep
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow7 Sep
Other references · 13
- 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 939
- 2023Inversion by Direct Iteration: An Alternative to Denoising Diffusion for Image Restorationcited by 165
- 2022Let us Build Bridges: Understanding and Extending Diffusion Generative Modelscited by 103
- 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 83
- 2021Generative Modeling with Optimal Transport Mapscited by 82
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 68
- 2021Minibatch optimal transport distances; analysis and applicationscited by 65
- 2023Iterative α-(de)Blending: a Minimalist Deterministic Diffusion Modelcited by 46
- 2021An Optimal Transport Approach to Estimating Causal Effects via Nonlinear Difference-in-Differencescited by 7
- 2024Dimension-independent rates for structured neural density estimationcited by 5
- 2024Language Rectified Flow: Advancing Diffusion Language Generation with Probabilistic Flowscited by 4
- 2017Optimal Transport for Deep Joint Transfer Learningcited by 3
1 more
Built on by
Citing papers per year: 2025: 1; 2026: 10.
11 papers.
- 2026Low-Dimensional Adaptation of Rectified Flow: A Diffusion and Stochastic Localization Perspectivecited by 3
- 2026A Kinetic Energy Perspective of Flow Matchingcited by 3
- 2026Is Flow Matching Just Trajectory Replay for Sequential Data?cited by 3
- 2026Tessellations of Semi-Discrete Flow Matchingcited by 3
- 2025On The Hidden Biases of Flow Matching Samplerscited by 2
- 2026Total Variation Rates for Riemannian Flow Matchingcited by 2
- 2026Limit Points of Reflow with Minibatch Optimal Transportcited by 1
- 2026The Fundamental Limits of Valid Transport Map Estimationcited by 0
- 2026Computational and Statistical Guarantees of the textitc-Rectified flowcited by 0
- 2026Sample complexity bounds for categorical Markov random fields via Discrete Diffusionscited by 0
- 2026When do explicit penalties improve flow matching?cited by 0
- 2026When do explicit penalties improve flow matching?11 Oct 2026
- 2026Sample complexity bounds for categorical Markov random fields via Discrete Diffusions1 Oct 2026
- 2026Limit Points of Reflow with Minibatch Optimal Transport7 Aug 2026
- 2026Computational and Statistical Guarantees of the textitc-Rectified flow3 Aug 2026
- 2026The Fundamental Limits of Valid Transport Map Estimation29 Jun 2026
- 2026Tessellations of Semi-Discrete Flow Matching8 May 2026
- 2026Is Flow Matching Just Trajectory Replay for Sequential Data?9 Feb 2026
- 2026A Kinetic Energy Perspective of Flow Matching8 Feb 2026
- 2026Total Variation Rates for Riemannian Flow Matching5 Feb 2026
- 2026Low-Dimensional Adaptation of Rectified Flow: A Diffusion and Stochastic Localization Perspective21 Jan 2026
- 2025On The Hidden Biases of Flow Matching Samplers18 Dec 2025
Similar, not cited
Close in wording, no citation either way
- 2026Order-Optimal Sample Complexity of Rectified Flows
- 2024On the Convergence and Straightness of Rectified Flow
- 2025Flow Diverse and Efficient: Learning Momentum Flow Matching via Stochastic Velocity Field Sampling
- 2025Balanced conic rectified flow
- 2023Formulating Discrete Probability Flow Through Optimal Transport
- 2025Rectified Flows for Fast Multiscale Fluid Flow Modeling
- 2026Expressivity of Bi-Lipschitz Normalizing Flows: A Score-Based Diffusion Perspective
- 2024Rectified Diffusion: Straightness Is Not Your Need in Rectified Flow