Curriculum Consistency Model (CCM)

• Curriculum Consistency Model (CCM) is an adaptive framework that employs a PSNR-based metric to standardize the learning challenge across timesteps in generative distillation.
• It dynamically calibrates teacher iteration steps to stabilize the curriculum and reduce cumulative error, thereby enhancing convergence in both image synthesis and text-to-image tasks.
• Empirical results show that CCM achieves superior single-step FID and compositional fidelity, accelerating inference and generalizing across various model architectures.

The Curriculum Consistency Model (CCM) is an adaptive framework for distilling generative models, specifically designed to optimize the sampling efficiency in diffusion and flow matching architectures. CCM employs a Peak Signal-to-Noise Ratio (PSNR)–based learning complexity metric and dynamically selects teacher iteration steps to ensure a uniform challenge across timesteps. This approach stabilizes the training curriculum, alleviates accumulated error in knowledge transfer, and demonstrably enhances convergence in both image synthesis and text-to-image tasks. The method generalizes to various model families, including Stable Diffusion XL and Stable Diffusion 3, yielding competitive single-step sampling performance and improved compositional and semantic fidelity (Liu et al., 2024).

1. Curriculum-Learning Complexity Metric via PSNR

CCM quantifies "curriculum difficulty" at each distillation step using the PSNR between student and teacher predictions. For a noisy input $x_t$, the student model $f_\theta$ outputs $x_{\mathrm{est}} = f_\theta(x_t, t, 1)$, while the teacher prediction $x_{\mathrm{target}}$ is derived from an ODE solver executing $u>t$ steps, formulated as $$x_{\mathrm{target}} = f_{\theta^-}(\mathrm{Solver}(x_t, t, u; \phi), u, 1)$$. The pixel-wise mean squared error (MSE) is:

$$\mathrm{MSE}(x_{\mathrm{est}}, x_{\mathrm{target}}) = \frac{1}{D} \| x_{\mathrm{est}} - x_{\mathrm{target}} \|_2^2,$$

where $D$ is the dimension of the image. PSNR, a decibel-scaled metric, is computed as:

$$\mathrm{PSNR}(t;u) = 10 \log_{10}\left( \frac{(2^n-1)^2}{\mathrm{MSE}(x_{\mathrm{est}}, x_{\mathrm{target}})} \right),$$

for bit-depth $n$. The Knowledge Discrepancy of the Curriculum (KDC) is then defined:

$\mathrm{KDC}_t^u = 100 - \mathrm{PSNR}(t;u),$

with higher KDC values signaling greater learning challenge.

2. Adaptive Curriculum Through Teacher Iterations

Empirical analyses reveal KDC drops as $t \rightarrow 1$ (i.e., as noise intensity diminishes). Traditional Consistency Models (CM) employ a fixed step-size $\ell = u-t$, but this results in trivial discrepancies for large $t$ (insufficient challenge) and highly divergent ones at small $t$ (overly difficult). CCM introduces an adaptive protocol, setting $u$ such that:

$$\mathrm{KDC}_t^u \approx T_{\mathrm{KDC}}, \quad \forall t \in [0, 1)$$

where $T_{\mathrm{KDC}}$ is a pre-set threshold (e.g., $60$ dB). With base step-size $s \ll 1$, the teacher iterates:

$$u \leftarrow \min(u+s, 1), \quad x_u \leftarrow \mathrm{Solver}(x_t, t, u; \phi),$$

until the KDC criterion is met. The number of steps $n = \lceil (u-t)/s \rceil$ increases where the system is less noisy, equalizing learning complexity across the trajectory.

3. CCM Training Loop and Optimization

The CCM training procedure conducts adaptive teacher iteration, target generation, and loss computation:

Initialize student f_θ, teacher EMA θ^- ← θ for training iteration = 1 … N do Sample data x1 ∼ p_data Sample t ∼ Uniform(0,1) Generate noisy state x_t via forward ODE / diffusion # 1. Student one‐step estimate x_est = f_θ(x_t, t, 1) # 2. Find KDC‐adjusted target by multi‐step teacher iteration u ← t x_curr ← x_t repeat u ← min(u + s, 1) x_curr ← Solver(x_curr, t, u; φ) x_target_candidate ← f_{θ^-}(x_curr, u, 1) KDC ← 100 – PSNR(x_est, x_target_candidate) until KDC ≥ T_KDC or u = 1 x_target^{KDC} ← x_target_candidate # 3. Compute distillation loss L_distill ← d ( x_est, x_target^{KDC} ) # 4. (Optional) Adversarial loss L_GAN ← E[log D(x1)] + E[log (1–D(x_est))] # 5. Backprop & update θ θ ← θ – η ∇_θ [ L_distill + λ_GAN L_GAN ] # 6. Update EMA teacher θ^- ← μ θ^- + (1–μ) θ (stop‐gradient on θ^-) end for

The loss function $d(\cdot, \cdot)$ may be L2, L1, or LPIPS, and the solver is commonly an Euler ODE discretization.

4. Consistency-Distillation Loss Formulation

Standard $N$-step Consistency Models utilize a loss:

$$\mathcal{L}_{CD^N} = \mathbb{E}_{n}\left[ \lambda(\sigma_n) \, d(f_\theta(x_{\sigma_{n+1}}, \sigma_{n+1}, \epsilon), f_{\theta^-}(\hat{x}_{\phi, \sigma_n}, \sigma_n, \epsilon)) \right]$$

CCM replaces the static $(\sigma_n, \sigma_{n+1})$ pair with a dynamically selected, KDC-thresholded $(t, u)$. The CCM loss is:

$$\mathcal{L}_{CCM}(\theta; \phi) = \mathbb{E}_{t \sim U[0,1)}\, \mathbb{E}_{u\,|\,\mathrm{KDC}_t^u \approx T_{\mathrm{KDC}}}\, \mathbb{E}_{x_1, x_t \mid x_1} \left[ d(f_\theta(x_t, t, 1), x_{\mathrm{target}}^{KDC}(u, 1)) \right]$$

This loss enforces a consistent discrepancy at every training point, redistributing semantic and low-level focus appropriately.

5. Empirical Performance and Generalization

CCM achieves notable improvements in both unconditional and conditional synthesis. Key empirical metrics include:

• Single-step FID on CIFAR-10: 1.64 (previous CM best ≈ 1.98)
• Single-step FID on ImageNet 64×64 (conditional): 2.18 (vs. CTM on diffusion at 1.92, CCM tested mainly on flow-matching base)
• Text-to-image (T2I) results: For SD3 (28→4 steps), original CLIP/FID: 28.09/99.61 → CCM: 32.42/32.54; for SDXL (40→4 steps), original CLIP/FID: 30.41/70.28 → CCM: 32.60/28.90
• Compositionality enhancements across T2I-CompBench metrics
• Over 70% user preference for CCM in direct sample comparison
• Inference speed: Single-step CCM matches quality achieved by 50–100 step OT-CFM, enabling 50–100× acceleration

Table 1. Select Empirical Metrics from CCM

Task	Baseline	CCM Outcome
CIFAR-10, FID (NFE=1)	≈1.98	1.64
ImageNet64, FID (NFE=1)	1.92 (CTM)	2.18
SD3 T2I, CLIP/FID	28.09/99.61	32.42/32.54
SDXL T2I, CLIP/FID	30.41/70.28	32.60/28.90

Compositionality, semantic alignment, and robustness to text and object relationships are consistently improved, narrowing the gap to full-step models.

6. Theoretical Rationale and Implications

By maintaining KDC at a constant threshold, CCM ensures that the perceived learning challenge is uniform, avoiding the extremes of overly easy or too difficult curriculum steps. In contrast, traditional CM approaches—where the distillation step $\ell$ often shrinks over time—diminish knowledge gaps and attenuate learning of pertinent semantic features. CCM expands $\ell$ at high-$t$ (low noise), increasing the strength and reducing the frequency of knowledge transfer steps. This mechanism minimizes the cumulative error prevalent in conventional multi-step distillation (“curse of consistency”). Matching a fixed PSNR discrepancy also yields robust convergence in both fine detail (near $t=1$) and essential semantics/structure (near $t=0$). The approach adapts the teacher’s forecast horizon, stabilizing the student’s progression and directly connecting curriculum learning theory with the knowledge transfer protocol in generative modeling.

A plausible implication is that CCM reframes consistency distillation via curriculum theory, offering a unified method for balancing semantic and low-level detail preservation in compressed sampling. This suggests avenues for future research in adaptive curriculum metrics and their interaction with complex generative tasks.

7. Significance and Outlook

CCM integrates a PSNR-governed curriculum-consistency metric with adaptive teacher iteration, establishing state-of-the-art single-step sampling in image generation. Extensions to high-resolution text-to-image synthesis, flow matching architectures, and challenging compositionality tasks demonstrate generalization and efficiency gains. The model’s empirical results and theoretical foundation suggest broader applicability in domains requiring balanced knowledge transfer and scalable sampling. The curriculum principle embedded in CCM may inspire subsequent work in dynamic, metric-driven distillation frameworks for generative modeling and related tasks (Liu et al., 2024).