Two lightweight, training-free algorithms are proposed, CAT-OV and CAT-OT that adapt step-sizes at inference time based on a novel connection between Flow Matching sampling and gradient flow that outperform existing step-size heuristics in image quality metrics across four text- to-image Flow Matching models.
Abstract
Flow Matching has emerged as a leading framework for generative modeling, powering state-of-the-art systems such as FLUX and Stable Diffusion 3.5. However, the iterative nature of its ODE-based sampling process creates a fundamental efficiency bottleneck: the quality of generated samples is highly sensitive to the choice of step-sizes, and current models typically require 20 to 30 steps for good quality. In this work, we propose two lightweight, training-free algorithms, CAT-OV and CAT-OT that adapt step-sizes at inference time based on a novel connection between Flow Matching sampling and gradient flow. Our algorithms are computed efficiently by not requiring additional neural function evaluations. Specifically, CAT-OT estimates curvature over time via a finite-difference approximation of the time-derivative of the vector field, while CAT-OV approximates curvature over the state space via a gradient of the vector field. Under suitable conditions, both methods have truncation error bounds of constant order. Empirically, CAT-OV and CAT-OT outperform existing step-size heuristics in image quality metrics across four text- to-image Flow Matching models, reducing the number of generation steps required to reach comparable quality by up to 40%.
This paper analyzes the local Taylor expansion of a continuous denoiser to motivate a strict invariance condition required for optimal, singlestep generation: the conservation of target identity, and demonstrates that solving this condition via the Method of Characteristics analytically yields the straight-line traject...
We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the target is singular, i.e.\ supported on a lower-dimensional data manifold. We also show that the one-step generative map associated with this...
Cheuk-Kit Lee, Florentin Coeurdoux, Yuyuan Chen et al.· 4 citations
Flow-TAG is presented--a data-driven framework based on a generative flow model with a 1D U-Net backbone capable of mapping the geometry of a curve to the optimal parametrization for cubic B-splines that exhibits superior parameterization performance, robustness to noise in the input data, and strong generalization cap...
Roman Pavelkin, L. A. Zavala-Mondragón, Fons van der Sommen· 0 citations
A unified stagewise geometric theory of attraction and absorption is established for both continuous dynamics and explicit Euler discretization of flow matching and CFG across continuous and discrete sampling.
This work introduces FlowSGS, a flow-based posterior sampling method using Split Gibbs Sampling (SGS) to decompose the posterior into a likelihood step and a prior step and provides a form for the prior step that uses SI's reverse-time SDE, and shows connections to previous PnP methods.
Tianao Li, Xin-Hui Qian, Emma Alexander· 0 citations
SNaP is introduced, a one-step MeanFlow posterior sampler for linear inverse problems with Gaussian noise, which produces diverse, high-quality samples with one network evaluation per draw, 30 to 2250 $\times$ faster than iterative samplers.
Shirin Shoushtari, Edward P. Chandler, Xiao Shi et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.