Flow-WLS: Regularized Multistep Integration for Fast Sampling in Generative Flow Matching Models

Numerical integration of the probability flow ordinary differential equation (ODE) in diffusion and Flow Matching models is fundamentally constrained by a trade-off: low-order solvers (orders 1–2) require substantial step budgets (30+ NFEs) to avoid oversmoothing, while classical explicit high-order multistep schemes (orders 4+) suffer from Adams-Bashforth instability, Runge's phenomenon, and severe noise amplification. In this work, we analyze the breakdown mechanism of high-order polynomial extrapolation in Flow Matching architectures (such as DiT / Cosmos) and introduce Flow-WLS (Weighted Least Squares / Savitzky-Golay Multistep). Instead of fitting an oscillating interpolating polynomial of degree (L-1) through past velocity evaluations, Flow-WLS constrains the trajectory approximation to a regularized low-degree parabola (d=2) fitted over extended history buffers (L=3 to 8 steps) via weighted least squares with exponential memory decay. This inverts the classic curse of multistep solvers: increasing memory depth suppresses discretization noise rather than amplifying it. Empirical evaluations on text-to-image Flow Matching models demonstrate strictly monotonic metric improvements as history expands from L=3 to L=8, achieving an SSIM of 0.8003 at only 10 NFEs (~11 seconds on a consumer GPU) with zero anatomical distortion.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-13
DOI
https://doi.org/10.5281/zenodo.23337578
Primary Topic
Generative Adversarial Networks and Image Synthesis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Flow-WLS: Regularized Multistep Integration for Fast Sampling in Generative Flow Matching Models

Iakov Savelev
Zenodo (CERN European Organization for Nuclear Research)
Generative Adversarial Networks and Image Synthesis
preprint

Flow-WLS: Regularized Multistep Integration for Fast Sampling in Generative Flow Matching Models

Iakov Savelev
preprint en

Abstract

Numerical integration of the probability flow ordinary differential equation (ODE) in diffusion and Flow Matching models is fundamentally constrained by a trade-off: low-order solvers (orders 1–2) require substantial step budgets (30+ NFEs) to avoid oversmoothing, while classical explicit high-order multistep schemes (orders 4+) suffer from Adams-Bashforth instability, Runge's phenomenon, and severe noise amplification. In this work, we analyze the breakdown mechanism of high-order polynomial extrapolation in Flow Matching architectures (such as DiT / Cosmos) and introduce Flow-WLS (Weighted Least Squares / Savitzky-Golay Multistep). Instead of fitting an oscillating interpolating polynomial of degree (L-1) through past velocity evaluations, Flow-WLS constrains the trajectory approximation to a regularized low-degree parabola (d=2) fitted over extended history buffers (L=3 to 8 steps) via weighted least squares with exponential memory decay. This inverts the classic curse of multistep solvers: increasing memory depth suppresses discretization noise rather than amplifying it. Empirical evaluations on text-to-image Flow Matching models demonstrate strictly monotonic metric improvements as history expands from L=3 to L=8, achieving an SSIM of 0.8003 at only 10 NFEs (~11 seconds on a consumer GPU) with zero anatomical distortion.

Zenodo (CERN European Organization for Nuclear Research)
Generative Adversarial Networks and Image Synthesis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.