Flow Map Distillation

• The paper introduces flow map distillation as a framework that learns a two-time map to replace iterative numerical integration with a direct state transition.
• It unifies methods like consistency models, self-distillation, and flow matching, thereby offering stable, efficient generation across various modalities.
• The approach leverages structural properties such as the semigroup relation and average-velocity approximations to provide theoretical guarantees and improved performance.

Searching arXiv for papers on flow map distillation and closely related methods. arxiv_search(query="flow map distillation consistency models flow matching") Searching for key flow-map distillation papers. Flow map distillation is a family of distillation and self-distillation methods that learns a two-time map $X_{s,t}$, $\Phi_{t\to r}$, or an equivalent parameterization that transports a state from one noise level or time index to another in one shot, thereby replacing explicit step-by-step numerical integration of an underlying probability-flow ODE. In the current literature, it functions as a unifying framework for few-step and any-step generation in diffusion and flow models, connecting consistency models, two-time flow maps, semigroup-based self-distillation, and direct map learning from stochastic interpolants (Boffi et al., 2024, Boffi et al., 24 May 2025, Sabour et al., 17 Jun 2025).

1. Mathematical object and core identities

At the center of the framework is a continuous-time dynamical system with velocity field $v(x,t)$ or $b_t(x)$, typically written as

$\frac{dx_t}{dt}=v(x_t,t),$

whose solution induces a two-time flow map. In the notation of Flow Map Matching, $X_{s\to t}(x)$ is defined so that $x_t=X_{s\to t}(x_s)$, with semigroup property $X_{u\to w}\circ X_{s\to u}=X_{s\to w}$ and inverse $X_{t\to s}=X_{s\to t}^{-1}$ (Boffi et al., 2024). Closely related formulations write

$\Phi_{t\to r}(z_t)=z_r$

for arbitrary $\Phi_{t\to r}$0, emphasizing that the learned object is a transition operator between two times rather than an endpoint-only denoiser (Gu et al., 13 May 2026).

A recurring construction uses stochastic interpolants. Flow Map Matching defines

$\Phi_{t\to r}$1

with $\Phi_{t\to r}$2, so that the marginal law of $\Phi_{t\to r}$3 follows the continuity equation associated with $\Phi_{t\to r}$4 (Boffi et al., 2024). In flow-matching LLMs and self-distillation frameworks, the same idea appears through the tangent condition

$\Phi_{t\to r}$5

or, for two-time maps,

$\Phi_{t\to r}$6

which identifies the diagonal of the map with the instantaneous velocity field (Boffi et al., 24 May 2025).

Many implementations adopt an average-velocity or Euler-like ansatz,

$\Phi_{t\to r}$7

or equivalently $\Phi_{t\to r}$8. This parameterization enforces the identity map on the diagonal and makes few-step composition straightforward (Khungurn et al., 2 May 2025, Sabour et al., 17 Jun 2025). The semigroup relation then becomes a trainable structural prior: a valid long-horizon map should decompose into shorter maps, and a valid short map should recover the underlying tangent dynamics on the diagonal.

2. Objective families and training paradigms

The foundational distillation objectives are Lagrangian Map Distillation (LMD) and Eulerian Map Distillation (EMD). LMD penalizes the mismatch in

$\Phi_{t\to r}$9

while EMD penalizes

$v(x,t)$0

Flow Map Matching further gives a direct-training objective that avoids a pre-trained teacher by enforcing invertibility and Lagrangian dynamics in expectation through interpolant samples (Boffi et al., 2024). This established the basic view of flow-map learning as a PINN-style problem over two-time operators.

Self-distillation methods refine this picture. “How to build a consistency model” formalizes diagonal flow matching together with off-diagonal self-distillation losses: Lagrangian self-distillation (LSD), Eulerian self-distillation (ESD), and Progressive self-distillation (PSD). The paper reports that LSD and ESD require temporal or spatial derivatives of the flow map, whereas PSD uses only forward evaluations and is therefore more stable for high-dimensional image synthesis (Boffi et al., 24 May 2025). “Distilling Two-Timed Flow Models by Separately Matching Initial and Terminal Velocities” introduces the Initial/Terminal Velocity Matching (ITVM) loss, decomposed into Initial Instantaneous Velocity Matching, Initial Average Velocity Matching, and Terminal Velocity Matching. Its stated purpose is to avoid higher-order automatic differentiation in the terminal term, add short-interval teacher matching at the start time, and stabilize targets with an EMA student (Khungurn et al., 2 May 2025).

Continuous-time extensions explicitly generalize consistency training. Align Your Flow introduces AYF-EMD and AYF-LMD, with discrete small-$v(x,t)$1 objectives whose limits recover flow matching when $v(x,t)$2 and continuous-time consistency loss when $v(x,t)$3 (Sabour et al., 17 Jun 2025). AnyFlow shifts the target from endpoint consistency $v(x,t)$4 to arbitrary flow-map transitions $v(x,t)$5, and adds Flow Map Backward Simulation so that the student is trained on its own composed rollouts rather than only on teacher states (Gu et al., 13 May 2026). Fake-Score-network-Free DMD combines consistency-style flow-map training with a reverse-divergence correction term, replacing the auxiliary fake-score network by a generator-induced pseudo-velocity surrogate $v(x,t)$6 (Kim et al., 19 May 2026).

A separate line replaces instantaneous supervision by interval supervision. Mean Flow Distillation defines the average velocity field

$v(x,t)$7

and matches teacher and student mean flows instead of pointwise scores or velocities (Zhao et al., 9 Jun 2026). This changes the objective from local tangent imitation to interval displacement imitation, while remaining tied to the underlying ODE.

3. Parameterization of the student map

The simplest parameterization treats the map as a linear shortcut or as an average velocity over an interval. Several papers argue that this becomes restrictive when the teacher trajectory changes direction continuously. ArcFlow makes this argument explicit and replaces straight-line few-step shortcuts by analytically integrated non-linear flow arcs. Its student velocity is parameterized as a mixture of continuous momentum processes,

$v(x,t)$8

with a closed-form transition operator

$v(x,t)$9

so that $b_t(x)$0 is updated without Euler or Runge–Kutta discretization error inside the distilled step (Yang et al., 9 Feb 2026). In that formulation, non-linearity is built directly into the student trajectory rather than recovered through more NFEs.

Other domains impose different structural constraints. Categorical Flow Maps replace unconstrained average velocities by an endpoint-based map toward the simplex,

$b_t(x)$1

so that the predicted state remains in a geometrically meaningful region for discrete data (Roos et al., 12 Feb 2026). Self-conditioned flow-map LLMs use a two-time denoiser $b_t(x)$2 and derive recovery and semigroup identities such as

$b_t(x)$3

thereby compressing both self-conditioning iterations and flow steps into a single map network (Yoo et al., 1 Jul 2026).

Stochasticity can also be part of the map. Diamond Maps introduce a Posterior Diamond Map $b_t(x)$4 conditioned on an outer noisy state $b_t(x)$5 and an inner latent state $b_t(x)$6, so that one-step posterior sampling remains stochastic rather than collapsing to a deterministic denoising trajectory (Holderrieth et al., 5 Feb 2026). F2D2 augments a flow-map student with an additional divergence head,

$b_t(x)$7

allowing few-step likelihood evaluation and sampling to be distilled jointly from the same underlying velocity field (Ai et al., 2 Dec 2025).

4. Stability, approximation, and theoretical guarantees

The theory of flow map distillation is unusually explicit about when few-step learning should work and when it should fail. Flow Map Matching proves that the true flow map is the unique global minimizer of LMD and EMD, and derives Wasserstein-type error bounds under one-sided Lipschitz conditions using Grönwall arguments (Boffi et al., 2024). “Stabilizing Consistency Training” analyzes consistency models through a flow-map lens, showing that direct training can drift toward degenerate flat solutions and that a reformulated self-distillation objective with stop-gradient avoids excessive gradient norms and yields bounded-gradient optimization (Kim et al., 30 Jan 2026).

Several papers isolate the role of composition error. “A Quantitative Approximation Framework for Flow Distillation in Diffusion Models” writes few-step generation as error propagation under compositions of learned flow maps. If $b_t(x)$8 bounds the integrated spatial Lipschitz constant, then the global error satisfies

$b_t(x)$9

The same paper derives an explicit $\frac{dx_t}{dt}=v(x_t,t),$0 for a Gaussian-mixture Ornstein–Uhlenbeck model, identifies a Lipschitz-mismatch regime in which one-step distillation is structurally unfavorable, and proposes a stability-balanced non-uniform time grid by uniform partitioning in the cumulative stability coordinate. Its experiments report end-to-end relative MSE reductions of up to $\frac{dx_t}{dt}=v(x_t,t),$1 with 8 segments compared with uniform grids (Gao et al., 2 Jun 2026).

The literature also offers positive expressivity results. ArcFlow states in Theorem 1 that with $\frac{dx_t}{dt}=v(x_t,t),$2 momentum modes one can exactly fit the teacher’s velocity at any $\frac{dx_t}{dt}=v(x_t,t),$3 sampled timesteps, using a proof via Chebyshev systems (Yang et al., 9 Feb 2026). Mean Flow Distillation proves the Mean Flow Matching Theorem: if expected average velocities match over all intervals, then the student distribution equals the teacher distribution. The same paper interprets average-velocity supervision as a temporal low-pass filter, arguing that box-car averaging suppresses the high-frequency optimization noise present in instantaneous matching (Zhao et al., 9 Jun 2026).

A central controversy concerns step-count scaling. Align Your Flow proves in a Gaussian toy setting that a slightly sub-optimal consistency model can worsen as the number of denoising-re-noising substeps grows, whereas flow maps avoid that failure mode because they move directly from $\frac{dx_t}{dt}=v(x_t,t),$4 to $\frac{dx_t}{dt}=v(x_t,t),$5 instead of repeatedly denoising to $\frac{dx_t}{dt}=v(x_t,t),$6 and re-noising (Sabour et al., 17 Jun 2025). AnyFlow makes the same point empirically for video: consistency-distilled models often degrade when given more steps, while a flow-map objective over arbitrary intervals continues to improve with larger step budgets (Gu et al., 13 May 2026). At the same time, one-step generation is not presented as universally sufficient. ArcFlow reports that $\frac{dx_t}{dt}=v(x_t,t),$7 degrades sharply, and its discussion treats $\frac{dx_t}{dt}=v(x_t,t),$8 as the practical regime where high fidelity is recovered (Yang et al., 9 Feb 2026).

5. Modalities, systems, and reported performance

Flow map distillation now spans image generation, text-to-image, video, categorical generation, language modeling, reward alignment, super-resolution, likelihood evaluation, and diffusion-based policy learning. The reported systems differ in target modality and in whether they optimize one-step, few-step, or any-step behavior.

System	Domain	Reported result
ArcFlow (Yang et al., 9 Feb 2026)	Text-to-image	2 NFEs, $\frac{dx_t}{dt}=v(x_t,t),$9 speedup, fine-tunes on less than 5% of original parameters
AnyFlow (Gu et al., 13 May 2026)	Video diffusion	Matches or surpasses consistency-based counterparts in few-step settings and improves from 4 to 32 NFEs
FreeFlow (Tong et al., 24 Nov 2025)	Image generation	FID 1.45 on ImageNet $X_{s\to t}(x)$0 and 1.49 on ImageNet $X_{s\to t}(x)$1, both with 1 sampling step
F2D2 (Ai et al., 2 Dec 2025)	CNF sampling and likelihood	Reduces NFEs for both sampling and likelihood evaluation by two orders of magnitude
Diamond Maps (Holderrieth et al., 5 Feb 2026)	Reward alignment	One-step stochastic posterior sampler enabling unbiased Monte Carlo value-function estimation

The image-generation literature provides the clearest benchmark picture. Align Your Flow reports, on ImageNet $X_{s\to t}(x)$2, a teacher FID of 1.33 for EDM2-S at 63 NFEs, autoguided teacher FID 1.01, and AYF FIDs of 2.98, 1.25, 1.15, and 1.12 for 1, 2, 4, and 8 NFEs respectively; on ImageNet $X_{s\to t}(x)$3, AYF-S reports 3.32, 1.87, and 1.70 for 1, 2, and 4 NFEs, and adversarial finetuning improves the 1-step score to 1.92 (Sabour et al., 17 Jun 2025). ArcFlow reports for FLUX.1-dev at 2 NFEs a Geneval score of 0.65, DPG-Bench 84.29, Align5000 FID 16.83, pFID 11.20, and CLIP 0.315; for Qwen-Image-20B at 2 NFEs it reports Geneval 0.85, DPG-Bench 88.46, Align5000 FID 12.40, pFID 3.78, and CLIP 0.325 (Yang et al., 9 Feb 2026).

Video and language applications emphasize scaling with step budget. AnyFlow reports VBench totals of 83.48 for a 1.3B bidirectional T2V model at 4 NFEs, 84.04 and 84.10 for a 14B bidirectional model at 4 and 32 NFEs, and 84.05 and 84.41 for a 14B causal model at 4 and 32 NFEs (Gu et al., 13 May 2026). Self-conditioned Flow Map LLMs report OpenWebText generative perplexities for FMLM$X_{s\to t}(x)$4 of 112.52, 94.74, and 75.22 at 1, 2, and 4 steps respectively, with entropy 5.37, 5.45, and 5.41 (Yoo et al., 1 Jul 2026). Categorical Flow Maps report, among other results, Text8 NLL 5.33 at one step and 4.90 at four steps, LM1B Gen-PPL 274.9 at one step and 125.2 at four steps, and binary-MNIST FID 10.1 at one step and 7.8 at four steps (Roos et al., 12 Feb 2026).

Flow maps also support tasks that standard few-step samplers do not usually cover. F2D2 preserves tractable likelihood evaluation by jointly distilling state flow and cumulative divergence, reporting CIFAR-10 teacher NLL 3.12 BPD and MeanFlow-F2D2 NLL $X_{s\to t}(x)$5 with FID $X_{s\to t}(x)$6 at 8 NFEs (Ai et al., 2 Dec 2025). Diamond Maps preserve stochasticity specifically for inference-time reward alignment, where exact or unbiased posterior sampling matters for value-function estimation and sequential Monte Carlo (Holderrieth et al., 5 Feb 2026). FlowMapSR adapts flow-map self-distillation to super-resolution and reports, for DIV2K-Val $X_{s\to t}(x)$7, FlowMapSR-2 PSNR 22.12, LPIPS 0.2554, DISTS 0.0995, FID 13.05, and NIQE 3.036 (Noble et al., 23 Jan 2026). The same flow-map perspective has also been extended beyond image generation to diffusion-based policy learning, where iSD-T is reported to match 100-step diffusion-policy success rates with 2 NFEs on Push-T and Transport (Kim et al., 30 Jan 2026).

6. Terminological scope, misconceptions, and open questions

A persistent misconception is that flow map distillation is simply another name for consistency distillation. The literature does not support that equivalence. Flow maps generalize endpoint consistency by learning $X_{s\to t}(x)$8 transitions for arbitrary pairs of times, and several papers explicitly treat consistency models as the special case $X_{s\to t}(x)$9 or $x_t=X_{s\to t}(x_s)$0 (Boffi et al., 2024, Gu et al., 13 May 2026). A related misconception is that increasing NFEs must always harm a distilled model. That statement describes the failure mode analyzed for consistency models, not a universal property of flow maps; AnyFlow and Align Your Flow are presented precisely as counterexamples (Gu et al., 13 May 2026, Sabour et al., 17 Jun 2025).

A second misconception is that deterministic one-step maps are always the correct endpoint of distillation. The current literature is more conditional. FreeFlow shows that one-step distillation can reach FID 1.45 and 1.49 on ImageNet without any external data, but the quantitative approximation framework identifies regimes where one-step compression is structurally unfavorable because dynamical amplification exceeds the student’s Lipschitz budget (Tong et al., 24 Nov 2025, Gao et al., 2 Jun 2026). ArcFlow similarly reports that 1 NFE degrades sharply while 2 NFEs suffice for high fidelity (Yang et al., 9 Feb 2026). This suggests that “how many steps are enough” is governed by geometry, stiffness, and approximation capacity rather than by a universal one-step principle.

Teacher dependence is likewise not uniform. Some systems distill from a pre-trained velocity model or a pre-trained few-step teacher, but self-distillation and data-free training are both established alternatives. Boffi-style self-distillation removes the need for a pre-trained model by pairing diagonal flow matching with off-diagonal consistency losses (Boffi et al., 24 May 2025). FreeFlow removes dependence on external data by sampling only from the prior, motivated by the risk of Teacher-Data Mismatch (Tong et al., 24 Nov 2025). FSF-DMD goes further by removing the fake-score network from DMD-style correction and, in a self-teacher variant, replacing the teacher velocity with the generator’s own diagonal prediction $x_t=X_{s\to t}(x_s)$1 (Kim et al., 19 May 2026).

Finally, the phrase “flow distillation” is not used uniformly across arXiv. “FlowDistill” refers to an LLM-to-MLP framework for traffic flow prediction based on a variational information bottleneck, teacher-bounded regression loss, and spatial-temporal regularization (Yu et al., 2 Apr 2025). “InDistill” refers to information flow-preserving knowledge distillation for model compression, with pruning and curriculum learning over layer-wise feature-map matching (Sarridis et al., 2022). These works share the language of distillation and flow, but they do not use the two-time continuous flow-map formalism that defines the generative literature summarized above.

Open problems recur across the corpus. Multiple papers point to the remaining one-step gap relative to strong teachers, the sensitivity of derivative-based objectives in high dimensions, the need for better grids or curricula in stiff late-time regimes, and the possibility of extending flow-map methods further into video, 3D, scientific generative modeling, and other conditional settings (Sabour et al., 17 Jun 2025, Gao et al., 2 Jun 2026). A plausible implication is that future progress will depend less on a single canonical loss than on matching the map parameterization, supervision granularity, and stability mechanism to the geometry of the underlying trajectory.