The paper investigates the computational and statistical properties of c‑rectified flow, a cost‑aware variant of rectified flow that projects velocity fields onto a gradient class while preserving endpoint marginals. It shows that ordinary rectified flow can fail to recover optimal transport couplings, whereas iterative c‑rectified flow always converges to the optimal coupling under suitable regularity and uniform‑integrability assumptions, and provides quantitative contraction and exponential convergence guarantees. Additionally, the authors derive minimax‑optimal score estimation rates that, when combined with iterative c‑rectified flow, yield rate‑optimal estimators of optimal transport in high dimensions and nearly parametric rates in low dimensions.
arXiv:2608. 02487v1 Announce Type: cross Abstract: Recently, rectified flow has emerged as a fundamental framework for large-scale image generation, powering state-of-the-art systems such as FLUX.
arXiv:2608. 07042v1 Announce Type: cross 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.
arXiv:2606. 03820v1 Announce Type: cross Abstract: We develop a quantitative approximation framework for diffusion distillation, viewing few-step sampling as error propagation under compositions of learned flow maps.
arXiv:2608. 15144v1 Announce Type: cross Abstract: Posterior sampling with a pretrained diffusion prior is governed by a conditional score whose intermediate likelihood component is generally intractable.
arXiv:2606. 30574v1 Announce Type: new Abstract: Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map.
arXiv:2606. 04695v1 Announce Type: new Abstract: High-dimensional optimal transport is seldom available in closed form.
The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.
arXiv:2607. 06723v1 Announce Type: cross Abstract: Most gradient-based optimization methods move parameters through a fixed background geometry, even when their internal states implicitly define changing notions of length, curvature, and preconditioning.
arXiv:2602. 02241v2 Announce Type: replace Abstract: Entropic optimal transport (EOT) in continuous spaces with quadratic cost is a classical tool for solving the domain translation problem.
arXiv:2505. 07124v3 Announce Type: replace Abstract: We study inverse problems where an unknown potential is observed only through samples from the measure it induces by a convex variational principle.
arXiv:2601.20250v2 Announce Type: replace Abstract: Recently, flow-based generative models have shown superior efficiency compared to diffusion models. In this paper, we study rectified flow models,...
arXiv:2606. 12120v1 Announce Type: new Abstract: Low-rank optimal transport (OT) mitigates the quadratic scaling of classical solvers, yet existing approaches rely heavily on first-order mirror-descent updates that require careful hyperparameter tuning and ignore the optimization landscape's curvature.