Diffusion Flow Matching Overview

• Diffusion Flow Matching (DFM) is a hybrid generative modeling approach that combines diffusion’s stochastic smoothing with flow matching’s deterministic transport.
• It leverages shared probability paths and generator matching to unify methodological variations, enhancing robustness and controllability.
• DFM variants—including decomposable, discrete, and drift models—demonstrate efficient low-step sampling across diverse tasks like image, language, and speech generation.

Searching arXiv for papers on Diffusion Flow Matching and related usages of the term. Diffusion Flow Matching (DFM) denotes a family of closely related ideas at the interface of diffusion models and flow matching, rather than a single universally fixed algorithm. In the most general sense, DFM refers to generative constructions that combine or relate stochastic diffusion dynamics and deterministic transport dynamics through a shared probability path or Markov-generator formalism. Recent work shows that diffusion and flow matching can be viewed as special cases of a broader Generator Matching perspective, in which a time-indexed family of distributions $(p_t)_{t\in[0,1]}$ is specified by a generator containing deterministic, stochastic, or mixed components (Patel et al., 2024). At the same time, the acronym “DFM” is also used for several task-specific extensions, including “Decomposable Flow Matching” for multiscale visual generation (Haji-Ali et al., 24 Jun 2025), “Few-Step Discrete Flow-Matching” for language generation (Monsefi et al., 24 Sep 2025), and “Drift Flow Matching” for connecting one-step drift models with iterative flow-based generation (Ma et al., 17 May 2026). This terminological plurality is itself a central feature of the literature: DFM is best understood as a hybrid regime exposed by the convergence of diffusion-style stochasticity, flow-style transport, and generator-based interpolation.

1. Conceptual definition and scope

In the Generator Matching formulation, a generative model is a Markov process $X_t$ with transition kernels $k_{t+h\mid t}(\cdot\mid x)$, whose infinitesimal behavior is summarized by the generator

$$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$

The corresponding marginal evolution is written through the dual pairing

$$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$

and governed by the Kolmogorov Forward Equation

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$

Within this view, diffusion models and flow matching differ not by belonging to disjoint paradigms, but by which terms appear in the generator (Patel et al., 2024).

For Euclidean state spaces, the generator is decomposed as

$$\mathcal{L}_t f(x) = \nabla f(x)^T u_t(x) + \frac{1}{2}\nabla^2 f(x)\cdot \sigma_t^2(x) + \int [f(y)-f(x)]Q_t(dy;x).$$

Here $u_t(x)$ is the drift / velocity field, $\sigma_t(x)$ is the diffusion coefficient, and $Q_t$ is a jump kernel. In this notation, flow matching corresponds to the first-order transport term, diffusion corresponds to the second-order stochastic term, and mixed constructions combine them (Patel et al., 2024). This is the most direct sense in which DFM “sits at the intersection” of diffusion and flow matching.

A second, more specialized theoretical usage appears in the stochastic-bridge literature, where DFM denotes a stochastic version of flow matching based on a diffusion bridge, especially a Brownian bridge (Silveri et al., 2024, Silveri et al., 15 Jun 2026). In that setting, the model learns the drift of the Markovian projection of a stochastic interpolant rather than the velocity of a deterministic path.

A third usage is application-driven. Several papers reuse the acronym DFM for conceptually related but methodologically distinct models: “Decomposable Flow Matching” for progressive multiscale generation (Haji-Ali et al., 24 Jun 2025), “Few-Step Discrete Flow-Matching” for discrete-token CTMC generation (Monsefi et al., 24 Sep 2025), and “Drift Flow Matching” for two-time transport between intermediate marginals (Ma et al., 17 May 2026). This suggests that the term now functions as an umbrella for hybridizations of flow-style transport with either stochastic diffusion, discrete denoising dynamics, or drift-based marginal correction.

2. Generator-theoretic relation between diffusion and flow matching

A central theoretical result is that diffusion models and flow matching can be converted into one another by matching their path parameterizations and stochasticity schedules (Patel et al., 2024). Diffusion models are written as stochastic Markov processes with an SDE

$X_t$0

and reverse-time sampling

$X_t$1

The parameter $X_t$2 controls inference-time stochasticity and is linked to “churn” (Patel et al., 2024).

Flow matching, by contrast, is expressed as deterministic transport. A canonical interpolation is

$X_t$3

with vector field

$X_t$4

and ODE

$X_t$5

The reverse-time probability flow ODE can also be written as

$X_t$6

with stochastic extension

$X_t$7

This formulation already contains a tunable stochastic component $X_t$8, making explicit the continuity between deterministic FM and diffusion-like sampling (Patel et al., 2024).

The conversion between the two parameterizations is given by

$X_t$9

$k_{t+h\mid t}(\cdot\mid x)$0

and

$k_{t+h\mid t}(\cdot\mid x)$1

These identities formalize the claim that diffusion and flow matching are “two sides of the same coin” once written at the level of generators and marginal paths (Patel et al., 2024).

The same bridging intuition appears in several later works. "Diff2Flow" explicitly aligns diffusion timesteps, interpolants, endpoint conventions, and prediction semantics so that a pretrained diffusion prior can be fine-tuned as an FM model (Schusterbauer et al., 2 Jun 2025). "FlowLM" uses diffusion-to-flow adaptation in language modeling by replacing the curved diffusion path with a linear interpolation

$k_{t+h\mid t}(\cdot\mid x)$2

then sampling by repeatedly predicting clean data and updating along an average-velocity direction (Zhang et al., 6 Apr 2026). These results do not make the terminology uniform, but they reinforce the same underlying claim: diffusion and flow can be reparameterizations of a shared transport problem.

3. Stochastic-bridge DFM and theoretical guarantees

In the Brownian-bridge literature, DFM is defined more narrowly as stochastic flow matching with a diffusion-induced bridge (Silveri et al., 2024). The setup starts from a base distribution $k_{t+h\mid t}(\cdot\mid x)$3, a target distribution $k_{t+h\mid t}(\cdot\mid x)$4, and a coupling $k_{t+h\mid t}(\cdot\mid x)$5. The stochastic interpolant uses the conditional law of a diffusion bridge; in the main results the reference process is $k_{t+h\mid t}(\cdot\mid x)$6-dimensional Brownian motion, yielding the explicit Brownian interpolant

$k_{t+h\mid t}(\cdot\mid x)$7

Because this interpolant is generally non-Markov, the practical model learns the drift of its Markovian projection and samples using Euler–Maruyama (Silveri et al., 2024).

The drift is estimated through the regression problem

$k_{t+h\mid t}(\cdot\mid x)$8

and the sampler uses the learned drift $k_{t+h\mid t}(\cdot\mid x)$9. Under finite-moment conditions, $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$0-integrability of scores, and an $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$1-drift approximation assumption, the paper proves a non-asymptotic KL bound of the form

$$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$2

which separates drift-estimation error from discretization error (Silveri et al., 2024).

A later refinement improves the dimensional dependence of Brownian-motion-based DFM bounds and extends the analysis to $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$3 (Silveri et al., 15 Jun 2026). Under finite-moment conditions and mild score integrability assumptions, the KL scaling improves from $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$4 to $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$5, and a $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$6 theorem is obtained under additional first-order score integrability and weak log-concavity (Silveri et al., 15 Jun 2026). In that work, the Brownian bridge interpolant is again

$$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$7

and the Markovian projection has drift

$$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$8

This line of theory makes DFM one of the better formalized hybrid regimes: it inherits bridge-based stochasticity from diffusion while retaining a flow-matching-style path construction (Silveri et al., 2024, Silveri et al., 15 Jun 2026).

A plausible implication is that stochastic-bridge DFM supplies the cleanest theoretical notion of “diffusion flow matching,” because the diffusion component is not merely an implementation option but part of the interpolant itself. However, the broader literature also uses the name for deterministic or discrete extensions, so this narrower interpretation does not exhaust actual usage.

4. Why hybridization matters: robustness, invertibility, and conditioning

One of the main motivations for DFM-type formulations is that first-order transport and second-order diffusion contribute different inductive biases. Under Generator Matching, diffusion corresponds to a second-order PDE / SDE with smoothing behavior. That smoothing stabilizes the forward process, but makes the reverse problem ill-posed: reconstructing $$k_{t+h|t} = k_{t|t} + h\mathcal{L}_t + o(h), \qquad k_{t|t}(\cdot|x)=\delta_x.$$9 from the smoothed $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$0 is sensitive to perturbations, and small errors in the learned score or drift can lead to large deviations in reverse dynamics (Patel et al., 2024). Flow matching, being first-order and transport-like, is more directly invertible and less susceptible to error amplification (Patel et al., 2024). This is the structural basis for the claim that flow matching can be more robust empirically.

The Generator Matching framework makes that comparison constructive. Because generators are linear operators and the KFE is linear, one can superpose generators

$$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$1

for $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$2, $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$3, and still satisfy the KFE (Patel et al., 2024). The paper explicitly suggests learned, state-dependent noise schedules $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$4 as a way to adaptively interpolate between flow-like transport and diffusion-like smoothing. This suggests a hybrid model can use deterministic flow in simple regions and inject more noise where geometry is complicated or regularization is needed (Patel et al., 2024).

A related but task-specific argument appears in the comparison between Diffusion Bridge and Flow Matching for transformation between arbitrary distributions (Zhu et al., 29 Sep 2025). There, Flow Matching is presented as a special case of Diffusion Bridge when $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$5 and $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$6, and the bridge drift is proved to lower the quadratic control cost: $$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$7 The paper interprets this lower cost as more stable, smoother, and more natural trajectories, especially when the source-target gap is large or data are scarce (Zhu et al., 29 Sep 2025). Although this work studies DB versus FM rather than DFM as a named model, it supports the same general point: stochastic or bridge-like guidance can stabilize pure flow transport.

Training-free conditional generation provides another angle on the hybrid theme. "Unraveling the Connections between Flow Matching and Diffusion Probabilistic Models in Training-free Conditional Generation" rewrites the FM ODE in a score-function form

$$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$8

and then incorporates conditions via posterior-sampling corrections exactly as in DPMs (Song et al., 2024). This suggests that even when FM is trained as an ODE model, diffusion-style score decompositions can remain operationally useful for conditional generation.

5. Main variants using the name DFM

The literature now contains several distinct models that explicitly use the acronym DFM. They share a transport-between-distributions viewpoint, but differ in whether the main innovation concerns stochasticity, discreteness, multiscale structure, uncertainty modeling, or drift-based refinement.

Variant	Core idea	Representative paper
Diffusion Flow Matching	Brownian-bridge or mixed diffusion-flow interpolant	(Silveri et al., 2024, Silveri et al., 15 Jun 2026)
Decomposable Flow Matching	Independent FM problems at each level of a multiscale representation	(Haji-Ali et al., 24 Jun 2025)
Few-Step Discrete Flow-Matching	Step-aware discrete CTMC flow matching for few-step text generation	(Monsefi et al., 24 Sep 2025)
Distributional Flow Matching	Gaussian distribution over velocities with NLL training	(Yang et al., 24 Oct 2025)
Drift Flow Matching	Two-time transport connecting drift models and iterative FM	(Ma et al., 17 May 2026)

“Decomposable Flow Matching” applies Flow Matching independently at each level of a user-defined multiscale representation such as a Laplacian pyramid, with one shared model predicting a velocity for each scale (Haji-Ali et al., 24 Jun 2025). On ImageNet-1K 512px, it reports a 35.2% improvement in FDD over the base architecture and 26.4% over the best-performing baseline under the same training compute (Haji-Ali et al., 24 Jun 2025). Despite the acronym, this method is not about stochastic diffusion terms; rather, it instantiates a coarse-to-fine, progressive FM framework.

“Few-Step Discrete Flow-Matching” formulates text generation as a CTMC over token sequences and makes the number of sampling steps an explicit training parameter (Monsefi et al., 24 Sep 2025). Its distinctive device is the finite-interval cumulative scalar

$$\langle p_t, f\rangle := \int f(x)\,p_t(dx) = \mathbb{E}_{x\sim p_t}[f(x)],$$9

used to calibrate large jumps. The headline result is that 8-step FS-DFM achieves perplexity parity with a 1,024-step discrete-flow baseline for generating 1,024 tokens, yielding up to 128 times faster sampling (Monsefi et al., 24 Sep 2025). Here DFM means “Discrete Flow-Matching,” not diffusion-flow hybridization in the continuous sense.

“Distributional Flow Matching” in FlowSynth replaces deterministic velocity prediction with a Gaussian velocity distribution

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$0

trained by negative log-likelihood

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$1

The purpose is uncertainty-aware trajectory sampling and test-time search for timbre consistency in instrument synthesis (Yang et al., 24 Oct 2025). This use of DFM is again not a diffusion-flow bridge in the narrow theoretical sense, but it extends flow matching by introducing a learned stochastic velocity law.

“Drift Flow Matching” learns transport from any intermediate time $$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$2 to any later time $$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$3, using a drift-style stop-gradient objective on predicted future marginals

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$4

Its stated goal is to preserve one-step efficiency while enabling multi-step refinement and test-time scaling (Ma et al., 17 May 2026). This suggests an even broader semantic drift of the acronym toward “hybrid iterative transport.”

6. Applications, empirical regimes, and recurring design patterns

Across applications, DFM-style methods are repeatedly used to reduce step count, improve conditioning, or combine complementary strengths of diffusion and flow.

In speech enhancement, FlowSE is not explicitly named a DFM method, but it is directly relevant because it derives a diffusion model from a conditional flow-matching path (Lee et al., 9 Aug 2025). The path

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$5

induces an equivalent forward SDE

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$6

with

$$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$7

FlowSE with only 5 function evaluations achieves performance comparable to BBED with NFE 60 and comparable to CRP with NFE 5, without CRP-style fine-tuning (Lee et al., 9 Aug 2025). This is an application-level illustration of the claim that a carefully chosen flow path can induce an efficient diffusion interpretation.

In image generation, several papers exploit diffusion-to-flow transfer or diffusion-guided coupling. "Diff2Flow" converts a pretrained diffusion model into an FM model by timestep rescaling, interpolant alignment, and algebraic conversion of diffusion predictions into FM velocities (Schusterbauer et al., 2 Jun 2025). "StraightFM" uses a pretrained diffusion model to provide couplings for straighter flow trajectories and supports one-step or very few-step generation (Xing et al., 2023). "Boosting Latent Diffusion with Flow Matching" splits synthesis into a low-resolution diffusion stage and a latent upsampling FM stage, allowing high-resolution generation at $$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$8 and $$\partial \langle p_t, f\rangle = \langle p_t,\mathcal{L}_t f\rangle.$$9 with reduced computational cost (Schusterbauer et al., 2023). These systems differ algorithmically, but all instantiate the same division of labor: diffusion supplies diversity or prior structure; flow supplies a straighter transport.

In language modeling, the same pattern reappears in discrete and continuous forms. FS-DFM makes few-step discrete generation first-class by conditioning on step budget and training consistency across budgets (Monsefi et al., 24 Sep 2025). FlowLM adapts a pretrained diffusion LLM into a flow-matching model with straight-line interpolation and reports strong results with 1–5 steps versus an original 2000-step diffusion sampler (Zhang et al., 6 Apr 2026).

A recurring design pattern is therefore visible across modalities. First, define a shared path between source and target distributions. Second, choose whether the path should be deterministic, stochastic, discrete, or multiscale. Third, train a model to match either a generator, a velocity, a drift, or a future marginal along that path. Fourth, exploit the resulting geometry to trade off quality against function evaluations.

7. Terminological ambiguities and future directions

The principal misconception surrounding DFM is that it names a single agreed-upon method. The current literature does not support that interpretation. In one line of work, DFM means Brownian-motion-based stochastic flow matching with KL and Wasserstein guarantees (Silveri et al., 2024, Silveri et al., 15 Jun 2026). In another, it refers to the mixed diffusion–flow regime exposed by Generator Matching (Patel et al., 2024). Elsewhere, the same acronym denotes Decomposable Flow Matching (Haji-Ali et al., 24 Jun 2025), Distributional Flow Matching (Yang et al., 24 Oct 2025), Few-Step Discrete Flow-Matching (Monsefi et al., 24 Sep 2025), or Drift Flow Matching (Ma et al., 17 May 2026). Any precise use of the term therefore requires local definition.

A second misconception is that diffusion and flow matching are fundamentally incompatible paradigms. The generator view argues the opposite: diffusion and flow are special cases of a more general Markov-generator formalism, and hybrid generators can combine deterministic transport, stochastic smoothing, and even jumps (Patel et al., 2024). The same conclusion is echoed in diffusion-to-flow alignment methods (Schusterbauer et al., 2 Jun 2025, Zhang et al., 6 Apr 2026) and in conditional-generation reformulations that rewrite FM dynamics in score-based form (Song et al., 2024).

The most technically mature future direction is likely adaptive hybridization. Generator Matching explicitly suggests learned, state-dependent noise schedules $$\mathcal{L}_t f(x) = \nabla f(x)^T u_t(x) + \frac{1}{2}\nabla^2 f(x)\cdot \sigma_t^2(x) + \int [f(y)-f(x)]Q_t(dy;x).$$0 to interpolate between flow-like and diffusion-like behavior (Patel et al., 2024). A plausible implication is that future DFM systems will treat stochasticity not as a fixed global choice but as a learned local control variable. Another active direction is stronger theory: recent Brownian-bridge results already provide KL and $$\mathcal{L}_t f(x) = \nabla f(x)^T u_t(x) + \frac{1}{2}\nabla^2 f(x)\cdot \sigma_t^2(x) + \int [f(y)-f(x)]Q_t(dy;x).$$1 guarantees with improved dimension dependence (Silveri et al., 15 Jun 2026), but the literature itself identifies open questions concerning weaker score integrability assumptions, sharper dimension dependence, and statistical analysis of drift estimation (Silveri et al., 2024, Silveri et al., 15 Jun 2026).

Taken together, these developments define DFM less as a single model family with fixed equations than as a research program: express generative transport through a shared probability path, choose the right mixture of deterministic and stochastic dynamics for the problem, and leverage that mixture for robustness, controllability, and low-step generation.