Skip to content
Preprint

Limit Points of Reflow with Minibatch Optimal Transport

Aug 2026 · 1 citation · 41 references
Mathematics Computer Science

TL;DR

Reflow accelerates inference by iteratively straightening the trajectories induced by this vector field, and it is proved that reflow limits coincide with the optimal transport map between the endpoint distributions.

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. Reflow accelerates inference by iteratively straightening the trajectories induced by this vector field. We study the asymptotic behavior of this iteration and characterize its limit points. First, we define weak rectified couplings which always exist. Next, when rectified flow updates are alternated with minibatch optimal transport steps of fixed batch size, we show that any limit is $N$-cyclically monotone, where $N$ is the batch size. Such $N$-cyclically monotone couplings enjoy favorable structural and stability properties such as rectifiability and straightness. Finally, restricting velocities to gradient fields and assuming additional support conditions, we prove that reflow limits coincide with the optimal transport map between the endpoint distributions.

View source

Similar papers

#machine learning Preprint Sep 2026

Retimed Bellman Flows: Escaping the Impossible Triangle of Velocity Bootstrapping

ReBF constructs a provably conditionally unbiased velocity target that preserves the Bellman fixed point and contracts under Wasserstein distances and outperforms existing flow critics across 38 challenging OGBench and D4RL offline reinforcement learning tasks.

Bo-Yang Xu, Sheng-Zhe Chen, Hao Yan · 0 citations
#machine learning Preprint Oct 2026

Ideal Paths for Approximating Logistic Gradient Descent Trajectories at Large Initialization

Modern training on a new task often starts from a previously trained model rather than from scratch, raising the question of how this initialization affects the subsequent training trajectory. Classical implicit-bias results characterize the direction selected by prolonged training, but this direction alone does not pr...

Jun-Jie Xiao, Hui-Wen Jia · 0 citations
#machine learning Preprint Oct 2026

Scaling Online Optimal Transport Minibatches for Flow Matching

A central challenge in scaling flow models is maintaining stability in training and integration. In flow matching, this stability depends critically on how source samples are paired with data. Independent random pairing introduces substantial stochasticity, motivating minibatch optimal transport (OT) to construct onlin...

P. Chen, Sergey Levine · 0 citations
#machine learning Preprint Sep 2026

Improving Function Space Flow Matching with Kernel Optimal Transport

Generative models for function-valued data, such as time series and solutions of partial differential equations, must learn distributions over infinite-dimensional spaces. Functional Flow Matching (FFM) extends Flow Matching to this setting, learning a velocity field whose flow transports a Gaussian prior to the data d...

Fred Xu, Thomas Markovich, Barbora Barancikova et al. · 0 citations
#machine learning Preprint Sep 2026

One-Step Generative Modeling via Unbalanced Optimal Transport

Drifting models enable one-step generation by amortizing distribution transport into training, but this efficiency places greater demands on the transport field estimated at each update. In large-scale training, the field is computed from finite mini-batches of generated and real samples, which provide only imperfect a...

Yi-Rong Shen, Mengfei Xia, Jun-Peng Jing et al. · 0 citations
Preprint Aug 2026

Manifold Drift in Flow Preference Optimization: A Root Cause of Reward Hacking

Preference optimization is a standard alignment method for generative models, yet extending it to continuous-time dynamics remains non-trivial. In flow matching, reward-driven updates modify transport trajectories without an inherent constraint to the pretrained data manifold and can move terminal samples off the pretr...

Yan-Sen Han, Shengyi Liao, Yuan-Xing Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.