Pith. sign in

REVIEW 11 cited by

Structural Pruning for Diffusion Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.10924 v3 pith:UCFNUPMX submitted 2023-05-18 cs.LG cs.AIcs.CV

Structural Pruning for Diffusion Models

classification cs.LG cs.AIcs.CV
keywords modelsdiffusiondiff-pruninggenerativemethodprunedtrainingacross
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Generative modeling has recently undergone remarkable advancements, primarily propelled by the transformative implications of Diffusion Probabilistic Models (DPMs). The impressive capability of these models, however, often entails significant computational overhead during both training and inference. To tackle this challenge, we present Diff-Pruning, an efficient compression method tailored for learning lightweight diffusion models from pre-existing ones, without the need for extensive re-training. The essence of Diff-Pruning is encapsulated in a Taylor expansion over pruned timesteps, a process that disregards non-contributory diffusion steps and ensembles informative gradients to identify important weights. Our empirical assessment, undertaken across several datasets highlights two primary benefits of our proposed method: 1) Efficiency: it enables approximately a 50\% reduction in FLOPs at a mere 10\% to 20\% of the original training expenditure; 2) Consistency: the pruned diffusion models inherently preserve generative behavior congruent with their pre-trained models. Code is available at \url{https://github.com/VainF/Diff-Pruning}.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Drift-AR: Single-Step Visual Autoregressive Generation via Anti-Symmetric Drifting

    cs.CV 2026-03 unverdicted novelty 7.0

    Drift-AR achieves 3.8-5.5x speedup in AR-diffusion image models by using entropy to enable entropy-informed speculative decoding and single-step (1-NFE) anti-symmetric drifting decoding.

  2. DisCa: Accelerating Video Diffusion Transformers with Distillation-Compatible Learnable Feature Caching

    cs.CV 2026-02 unverdicted novelty 7.0

    DisCa replaces heuristic feature caching with a lightweight learnable neural predictor compatible with distillation, achieving 11.8× acceleration on video diffusion transformers with preserved generation quality.

  3. Drift-AR: Single-Step Visual Autoregressive Generation via Anti-Symmetric Drifting

    cs.CV 2026-03 conditional novelty 6.5

    Per-position AR prediction entropy jointly drives speculative AR decoding and an anti-symmetric single-step drift decoder, yielding 3.8–5.5× faster hybrid visual generation without distillation.

  4. High-Fidelity Two-Step Image Generation via Teacher-Aligned End-to-End Distillation

    cs.CV 2026-06 unverdicted novelty 6.0

    Z-Image Turbo++ narrows the quality gap to 8-step generation via three distillation techniques tailored for the 2-step regime.

  5. OFA-Diffusion Compression: Compressing Diffusion Model in One-Shot Manner

    cs.CV 2026-04 conditional novelty 6.0

    OFA-Diffusion Compression trains diffusion models once to yield multiple size-specific compressed subnetworks via restricted candidate spaces, importance-based channel allocation, and reweighting.

  6. DiffSparse: Accelerating Diffusion Transformers with Learned Token Sparsity

    cs.CV 2026-04 conditional novelty 6.0

    A learnable cost predictor plus dynamic programming allocates layer-wise token sparsity for diffusion transformers, removing forced full steps and cutting ~54% compute on PixArt-α without quality loss.

  7. LESA: Learnable Stage-Aware Predictors for Diffusion Model Acceleration

    cs.CV 2026-02 conditional novelty 6.0

    A learned, stage-segmented KAN predictor for feature caching accelerates diffusion transformers by 5-6.25x while preserving more image/video fidelity than prior training-free forecasters.

  8. 2ndMatch: Finetuning Pruned Diffusion Models via Second-Order Jacobian Matching

    cs.GR 2025-06 unverdicted novelty 6.0

    2ndMatch finetunes pruned diffusion models via second-order Jacobian matching inspired by Finite-Time Lyapunov Exponents to reduce the quality gap with dense models on image generation tasks.

  9. TMP: Tree-structured Mixed-policy Pruning for Large-scale Image Generation and Editing

    cs.CV 2026-06 unverdicted novelty 5.0

    TMP is a pruning framework that reduces HunyuanImage-3.0 from 80B to 20B parameters (75% reduction) and Z-Image turbo from 6B to 4B with limited quality degradation.

  10. ResilPhase: Plug-and-Play Phase Mapping and Noise-Resilient Macro-Trajectory Extrapolation for Diffusion Acceleration

    cs.AI 2026-06 unverdicted novelty 5.0

    ResilPhase accelerates DiT inference via stable ODE macro-trajectory extrapolation with derivative-free barycentric Lagrange extrapolator and bounded phase mapping, claiming SOTA fidelity at high acceleration ratios o...

  11. Dynamic Video Generation: Shaping Video Generation Across Time and Space

    cs.CV 2026-05 unverdicted novelty 5.0

    DVG dynamically selects content-aware spatio-temporal acceleration strategies for diffusion-based video generation, delivering up to 7x speedup with near-lossless quality on models like HunyuanVideo.