Consistency Models in Generative Modeling

• Consistency models are deterministic generative models that map noisy diffusion trajectories directly to original data samples.
• They leverage probability-flow ODEs and training paradigms like distillation and self-consistency to achieve efficient sample generation across modalities.
• Advanced techniques such as adaptive discretization and flow anchoring enhance stability, reduce solver error, and validate theoretical convergence in practical applications.

A consistency model (CM) is a type of generative model framework in which a neural network is trained to deterministically map a noisy sample at any point along a diffusion trajectory directly to the original data, enabling efficient one-step or few-step synthesis. CMs have been developed both as a method of distilling pre-trained diffusion models—circumventing the computationally intensive iterative sampling typical of diffusion approaches—and as standalone frameworks with distinct training paradigms. While their initial motivation was efficient sample generation in image, audio, or inverse problems, CMs are characterized by the enforcement of trajectory-consistency properties derived from probability-flow ordinary differential equations (PF-ODEs).

1. Mathematical Foundations and Definition

A core insight underpinning CMs is the connection between the forward stochastic differential equation (SDE) used in diffusion models and its deterministic counterpart, the probability-flow ODE: $d x_t = \mu(x_t, t)\,dt + \sigma(t)\,dW_t$ induces

$$\frac{dx}{dt} = f_*(x, t) = \mu(x, t) - \frac{1}{2}\sigma^2(t)\,\nabla\log p_t(x)$$

where $p_t$ is the marginal distribution at time $t$ and $\nabla\log p_t(x)$ is the score function.

Traditional diffusion models learn a score function via denoising score matching, requiring many function evaluations to traverse the PF-ODE during generation. In contrast, CMs learn a function $f_\theta(x, t)$ that “jumps” from any noisy state $x_t$ (at arbitrary $t$) directly to the clean sample $x_0$, enforcing

$f_\theta(x_t, t) = x_0$

if $(x_t, t)$ lie on the diffusion trajectory from $x_0$.

This self-consistency property means that for any pair $(x_t, t)$ and $(x_{t'}, t')$ on the same PF-ODE trajectory, $f_\theta(x_t, t) = f_\theta(x_{t'}, t')$. In the ideal case, this corresponds to a model that is “trajectory-consistent” everywhere on the path (Song et al., 2023, Vouitsis et al., 2024, Peng et al., 4 Jul 2025, Geng et al., 2024).

2. Principal Training Objectives and Algorithms

Two dominant CM training paradigms are observed:

(a) Consistency Distillation (CD): Here, the CM is distilled from a pre-trained diffusion model by matching the outputs of a student network and a frozen teacher (either the diffusion model or a past version of itself) over successive trajectory points. The standard loss is

$$\mathcal{L}_{\rm CD} = \mathbb{E}\Bigl[\lambda(t_n)\,d(f_\theta(x_{t_n}, t_n),\; f_{\bar\theta}(\Phi(x_{t_n}, t_n, t_{n-1}), t_{n-1}))\Bigr]$$

where $d(\cdot, \cdot)$ is typically $L_2^2$ or another suitable distance, and $\Phi$ is a single solver step along the ODE (Vouitsis et al., 2024).

(b) Consistency Training (CT) from scratch: The CM is trained for self-consistency with itself, often using an approximate or Monte Carlo estimator of the score function. The loss maintains the same structure but does not require a pre-trained teacher (Song et al., 2023, Xiao et al., 2023).

Extensions include:

• Direct Consistency Models: Directly minimize the error to the ODE solution at each sampled point, requiring repeated ODE solving in the training loop and yielding lower ODE error but, counterintuitively, worse sample quality (Vouitsis et al., 2024).
• Adaptive Discretization: Use an optimization framework to adaptively select the discretization step that balances trainability (local consistency) and stability (global consistency), often solved via Gauss–Newton steps (Bai et al., 20 Oct 2025).
• Flow-Anchored and Dual-End Objective Variants: FACM injects a flow-matching anchor loss to prevent training instability and mitigate the risk of the model “losing the flow field” (Peng et al., 4 Jul 2025). DE-CM employs boundary regularizers and novel sub-trajectory selection to stabilize learning and address error accumulation (Dong et al., 11 Feb 2026).

Representative pseudocode for CD/CT training:

for each minibatch: x0 ~ pdata z ~ N(0,I) t_n, t_{n+1} ~ schedule x_{t_n} = noising(x0, z, t_n) x_{t_{n+1}} = noising(x0, z, t_{n+1}) target = f_{θ^-}(x_{t_n}, t_n) # teacher (distillation) or own EMA (CT) loss = ||f_θ(x_{t_{n+1}}, t_{n+1}) - target||^2 θ ← optimizer step update EMA θ^-

3. Theoretical Characterization and Convergence

CMs possess appealing theoretical properties. In the limit of infinite model capacity and perfect optimization, minimizing the standard consistency loss globally recovers the PF-ODE solver and achieves trajectory-level consistency (Song et al., 2023, Vouitsis et al., 2024). However, practical finite networks only provide weak supervision at later diffusion timesteps, and CMs “bootstrap” their self-consistency via an exponential moving average of previous weights.

A key theoretical finding is that reduced ODE-solver error (as measured by $$\mathcal{E} = \mathbb{E}_{x_T}[d(f_\theta(x_T,T), f_s(x_T, T, 0))]$$) does not necessarily imply improved sample quality. ODE-solver bounds quantify trajectory matching but do not control the perceptual quality of generated samples, which depends on the interplay between solver error, score approximation, and inductive biases (Vouitsis et al., 2024, Kim et al., 1 Oct 2025, Peng et al., 4 Jul 2025).

Moreover, scaling laws analogous to those in diffusion models—via Easy Consistency Tuning—have been observed, suggesting consistent returns from increasing compute or model size without drastic redesign (Geng et al., 2024).

4. Empirical Behavior, Application Domains, and Performance Limits

CMs achieve state-of-the-art quality under severe sampling budget constraints. Multi-step, distilled, and directly-trained CMs achieve the following 1- and 2-step Fréchet Inception Distance (FID) on standard image generation tasks:

Model	1-step FID (CIFAR-10)	2-step FID (CIFAR-10)
Consistency Distillation	3.55	2.93
Improved CM (iCT)	2.83	2.46
Flow-Anchored CM (FACM)	1.76 (ImageNet-256)	1.32
Dual-End CM (DE-CM)	1.70 (ImageNet-256)	1.33
Direct CM	159 (SDXL, single-step)	—

On inverse problems, plug-and-play ADMM variants with CMs as learned proximal operators achieve superior recovery with only 2–4 function evaluations compared to hundreds or thousands for diffusion-based counterparts, and are provably convergent under mild regularity assumptions (Gülle et al., 25 Sep 2025).

Applications:

• Text-to-image: CM backbones with ControlNet-style conditional adapters enable semantic and structure-conditioned synthesis with fast inference (Xiao et al., 2023).
• Audio: CM-TTS demonstrates single-step, high-fidelity neural text-to-speech with architectural variants tailored to the time-frequency domain (Li et al., 2024).
• MRI, super-resolution, inpainting: CM-based plug-and-play solvers enable rapid, high-quality reconstructions (Gülle et al., 25 Sep 2025).
• Editing and inverse design: CMs enable zero-shot and iterative data editing by alternating with measurement-constraint steps and user-specified transformations (Song et al., 2023).

5. Instabilities, Limitations, and Recent Advancements

Despite their strengths, early CMs were subject to key limitations:

• Training Instability: Continuous-time CMs without explicit flow supervision are prone to instability due to the lack of anchoring on the instantaneous velocity field—training degenerates or collapses as the model loses the correct ODE structure (Peng et al., 4 Jul 2025). Flow-anchoring, boundary regularization, and Jacobian-based stabilization (DE-CM) address this proactively (Peng et al., 4 Jul 2025, Dong et al., 11 Feb 2026).
• Sub-optimal Sample Quality with Direct Supervision: Directly minimizing ODE error via “Direct CMs” yields lower solver error but degrades sample realism by overfitting to ODE artifacts rather than optimizing for perceptual metrics (Vouitsis et al., 2024).
• Oscillatory Tangents and Slow Contraction: CM output updates (“tangents”) often point parallel to the data manifold, inducing slow convergence. Manifold feature distance (MFD) losses (AYT) train tangents to align orthogonally to the manifold, accelerating contraction and reducing oscillations (Kim et al., 1 Oct 2025).
• Discretization and Step-size Choice: Choice of time grid affects both trainability and stability; adaptive discretization via constrained optimization and Gauss-Newton steps (ADCM) provides principled step size selection and improves training efficiency (Bai et al., 20 Oct 2025).

Recent variants offer further improvement:

• Hybrid Samplers: Mix ODE-stepping and consistency updates (“mix” sampler in DE-CM) to flexibly trade off quality and efficiency at arbitrary NFE budgets (Dong et al., 11 Feb 2026).
• Curriculum and Tuning: Gradual tightening of the consistency condition and curriculum schedules (ECT) enable efficient reuse of pretrained diffusion models, drastically reducing compute requirements for state-of-the-art CMs (Geng et al., 2024).
• Plug-and-play Priors: CMs used as learned proximal operators within variational frameworks facilitate modular, high-quality plug-and-play inverse solvers with provable convergence (Gülle et al., 25 Sep 2025).

6. Practical Guidance, Generalizations, and Research Directions

Implementation Guidance:

• Always initialize from a strong diffusion (score-based or EDM) model if possible.
• Use curriculum schedules or adaptive step-size rules to avoid optimization stalling.
• Incorporate EMA targets, well-tuned loss weights, and batch normalization or dropout for regularization.
• Modular architectures (residual bottlenecks, manifold-aligned features, flow-matching heads) enhance stability and transferability (Kim et al., 1 Oct 2025, Peng et al., 4 Jul 2025, Dong et al., 11 Feb 2026).

Open Problems:

• Mechanistic understanding of why weakly-supervised trajectory consistency yields better samples than direct ODE error minimization remains incomplete (Vouitsis et al., 2024).
• Further work is required to close the gap between one-step and two-step sample quality, especially for high-resolution image and text-conditioned synthesis (Dong et al., 11 Feb 2026).
• Extending convergence guarantees and scaling laws to highly nonconvex networks and to non-image modalities is ongoing (Gülle et al., 25 Sep 2025, Geng et al., 2024).
• More robust integration of perceptual and adversarial losses, and explorations on automated step size control across tasks, are active research areas (Bai et al., 20 Oct 2025, Vouitsis et al., 2024).

Generalizations:

• The CM framework is modality-agnostic: architectural adjustments support scaling to audio, video, medical imaging, and structure-conditioned design (Li et al., 2024, Gülle et al., 25 Sep 2025).
• Plug-and-play methodology positions CMs as a unifying “proximal map prior” for diverse inverse problems and conditional generative tasks (Gülle et al., 25 Sep 2025, Xiao et al., 2023).

7. Summary Table: Core CM Variants

Model/Variant	Distillation?	Flow Anchor?	Adaptive Steps?	Auxiliary Losses	Key Innovation	Representative FID (CIFAR10)
Vanilla CM (Song et al., 2023)	Yes	No	No	No	Self-consistency over ODE	3.55 (1-step CD)
Direct CM (Vouitsis et al., 2024)	Yes	No	No	No	Direct ODE error minimization	159 (SDXL, worse sample)
FACM (Peng et al., 4 Jul 2025)	Yes	Yes	No	Cosine	Flow-matching stabilization	1.76 (1-step, ImageNet-256)
DE-CM (Dong et al., 11 Feb 2026)	Yes	Yes	Yes	N2N mapping	Sub-trajectory triangulation	1.70 (1-step, ImageNet-256)
ADCM (Bai et al., 20 Oct 2025)	Yes/No	No	Yes	No	Gauss-Newton scheduling	2.80 (1-step, CIFAR-10)
AYT (Kim et al., 1 Oct 2025)	Yes/No	No	No	Manifold-aligned	Manifold-feature tangents	2.61 (1-step, CIFAR-10)

Variant selection depends on the application demands (speed, stability, transfer, perceptual fidelity).

---

References:

• (Song et al., 2023) Consistency Models
• (Vouitsis et al., 2024) Inconsistencies In Consistency Models: Better ODE Solving Does Not Imply Better Samples
• (Peng et al., 4 Jul 2025) Flow-Anchored Consistency Models
• (Bai et al., 20 Oct 2025) Adaptive Discretization for Consistency Models
• (Kim et al., 1 Oct 2025) Align Your Tangent: Training Better Consistency Models via Manifold-Aligned Tangents
• (Dong et al., 11 Feb 2026) Dual-End Consistency Model
• (Geng et al., 2024) Consistency Models Made Easy
• (Gülle et al., 25 Sep 2025) Consistency Models as Plug-and-Play Priors for Inverse Problems
• (Xiao et al., 2023) CCM: Adding Conditional Controls to Text-to-Image Consistency Models
• (Li et al., 2024) CM-TTS: Enhancing Real Time Text-to-Speech Synthesis Efficiency through Weighted Samplers and Consistency Models