Computational and Statistical Guarantees of the c-Rectified flow

arXiv:2608.02487 · stat.ML, cs.LG, math.OC, math.PR, math.ST, stat.TH · Submitted 2026-08-03 · Read on arXiv

stat.ML, cs.LG, math.OC, math.PR, math.ST, stat.TH

Submitted: 2026-08-03

Updated: 2026-10-26

License: http://creativecommons.org/licenses/by-nc-sa/4.0/

The gist: Recently, rectified flow has emerged as a fundamental framework for large-scale image generation, powering state-of-the-art systems such as FLUX.1 and Stable Diffusion 3.

Terminology

Abstract

Recently, rectified flow has emerged as a fundamental framework for large-scale image generation, powering state-of-the-art systems such as FLUX.1 and Stable Diffusion 3. Despite its remarkable empirical success, the computational and statistical guarantees of iterative rectified flow have remained largely unexplored. We address this problem by studying c-rectified flow, a cost-aware class of rectified flow that projects velocity fields onto a gradient class while preserving endpoint marginals. The ordinary rectified flow can fail to recover the optimal transport coupling: in a Gaussian case study, the iteration converges to the optimal coupling if and only if the source and target covariance matrices commute. In contrast, under suitable compactness and uniform-integrability assumptions, iterative c-rectified flow always converges to the optimal transport coupling. We further establish quantitative one-step contraction and exponential convergence guarantees under projection-stability assumptions for both quadratic and strongly convex displacement costs. Finally, under a H"older ball assumption, we develop new minimax-optimal score estimation rates and show that, when combined with iterative c-rectified flow, they yield a rate-optimal estimator of the optimal transport for the dimension d 3 and a nearly parametric rate for d=1,2.

Sources

Related papers