Computational and Statistical Guarantees of the \textit{c}-Rectified flow

• URL: http://arxiv.org/abs/2608.02487v1
• Date: Mon, 03 Aug 2026 16:53:29 GMT
• Title: Computational and Statistical Guarantees of the \textit{c}-Rectified flow
• Abstract summary: We study textitc-rectified flow, a cost-aware class of rectified flow that projects velocity fields onto a gradient class while preserving endpoint marginals.<n>We establish quantitative one-step contraction and exponential convergence guarantees under projection-stability assumptions for both quadratic and strongly convex displacement costs.<n>We show that, when combined with iterative textitc-rectified flow, they yield a rate-optimal estimator of the optimal transport for the dimension (d ge 3) and a nearly parametric rate for (d=1,2)
• Score: 4.787815288113813
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• 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 \textit{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 \textit{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ölder ball assumption, we develop new minimax-optimal score estimation rates and show that, when combined with iterative \textit{c}-rectified flow, they yield a rate-optimal estimator of the optimal transport for the dimension \(d \ge 3\) and a nearly parametric rate for \(d=1,2\).

Related papers

• Limit Points of Reflow with Minibatch Optimal Transport [5.12067518301035]
  Rectified flows are generative models that learn a time-dependent vector field steering a probability curve between two probability distributions.<n>We study the behavior of this iteration and characterize its limit points.<n>Such $N$-cyclically monotone couplings enjoy favorable structural and stability properties such as rectifiability and straightness.
  arXiv  Detail & Related papers  (2026-08-07T09:51:33Z)
• Riemannian MeanFlow for One-Step Generation on Manifolds [54.09734511705173]
  Flow Matching enables simulation-free training of generative models.<n>MeanFlow can be extended to manifold-valued generation where velocities lie in location-dependent tangent spaces.<n>Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
  arXiv  Detail & Related papers  (2026-03-11T12:41:46Z)
• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• Statistical Properties of Rectified Flow [0.7136933021609079]
  Rectified flow is a method for defining a transport map between two distributions.<n>We study structural properties of the rectified flow, including existence, uniqueness, and regularity.<n>We are able to establish convergence at faster rates than the ones for the usual nonparametric regression and density estimation.
  arXiv  Detail & Related papers  (2025-11-05T05:09:12Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• On the Relation between Rectified Flows and Optimal Transport [6.493334597338973]
  Rectified flow matching aims to straighten the learned transport paths, yielding more direct flows between distributions.<n>Recent claims suggest that rectified flows, when constrained such that the learned velocity field is a gradient, can yield solutions to optimal transport problems.<n>We present several counterexamples that invalidate earlier equivalence results in the literature, and we argue that enforcing a gradient constraint on rectified flows is, in general, not a reliable method for computing optimal transport maps.
  arXiv  Detail & Related papers  (2025-05-26T09:01:53Z)
• Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows [40.884514919698596]
  Flow matching has emerged as a powerful framework for generative modeling.<n>We prove that higher-order flow matching preserves worst case optimality as a distribution estimator.
  arXiv  Detail & Related papers  (2025-03-12T05:07:07Z)
• On the Wasserstein Convergence and Straightness of Rectified Flow [54.580605276017096]
  Rectified Flow (RF) is a generative model that aims to learn straight flow trajectories from noise to data.<n>We provide a theoretical analysis of the Wasserstein distance between the sampling distribution of RF and the target distribution.<n>We present general conditions guaranteeing uniqueness and straightness of 1-RF, which is in line with previous empirical findings.
  arXiv  Detail & Related papers  (2024-10-19T02:36:11Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• The Convex Geometry of Backpropagation: Neural Network Gradient Flows Converge to Extreme Points of the Dual Convex Program [26.143558180103334]
  We study non- subgradient flows for two-layer ReLULU networks from a convex implicit geometry and duality perspective. We show that we can identify the problem of non- subgradient descent via primal-dual correspondence.
  arXiv  Detail & Related papers  (2021-10-13T04:17:08Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.