Skip to content

CAT-Flow: Curvature-Adaptive sTeps for Flow Matching

Sep 2026 · 0 citations · 46 references
Computer Science

TL;DR

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%.

View source

Similar papers

Preprint Aug 2026

A Lagrangian View of Flow Matching

Modern explicit-time generative models, such as Flow Matching [Lipman et al., 2023] and Rectified Flow [Liu et al., 2023], are typically derived top-down via Optimal Transport and the continuity equation. This standard Eulerian approach focuses on the macroscopic transport of probability mass. In this paper, we present...

P. Milanfar · 0 citations
Preprint Aug 2026

Beckmann Transport Models: From Autonomous Flows to One-Step Maps

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
Preprint Sep 2026

Flow-TAG: Flow-based conditional latent transport for accurate spline approximation and data compression

Robust curve fitting is essential in computer-aided design for transforming noisy, discrete data into accurate geometric models that ensure numerical stability across engineering workflows. B-spline models have become the industry standard for this task, offering a flexible and reliable framework characterized by local...

Roman Pavelkin, L. A. Zavala-Mondragón, Fons van der Sommen · 0 citations
Preprint Sep 2026

FlowSGS: Improving Flow Matching Priors for Inverse Imaging with Stochastic Interpolants

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
Preprint Sep 2026

SNaP: One-Step Posterior Sampling for Noisy Inverse Problems

Diffusion and flow-matching models can produce high-quality posterior samples for inverse problems, but typically require tens to thousands of network evaluations per draw. MeanFlow enables one-step generation, yet applying it to inverse problems leaves no intermediate steps at which to enforce measurement consistency....

Shirin Shoushtari, Edward P. Chandler, Xiao Shi et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 7, 2026

Discovering the value of humanistic inquiry

Students in MIT’s Concourse program delve deeply into the human condition, debate challenging questions, and learn to develop judgment about issues that can’t be quantified.

Microsoft Research Blog Oct 7, 2026

Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses

Training AI agents with reinforcement learning can be challenging because their tools, context, and decision-making are managed by complex frameworks. Agent Lightning connects existing agents to RL training, making it easier to improve them without rebuilding them. The post Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses appeared first on Microsoft Research.

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