Pith. sign in

REVIEW 7 cited by

LAPTOP-Diff: Layer Pruning and Normalized Distillation for Compressing 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 2404.11098 v4 pith:LJ4WEIRO submitted 2024-04-17 cs.CV

classification cs.CV
keywords layerpruningdistillationproposeddiffusionmodelscompressingfeature
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the era of AIGC, the demand for low-budget or even on-device applications of diffusion models emerged. In terms of compressing the Stable Diffusion models (SDMs), several approaches have been proposed, and most of them leveraged the handcrafted layer removal methods to obtain smaller U-Nets, along with knowledge distillation to recover the network performance. However, such a handcrafting manner of layer removal is inefficient and lacks scalability and generalization, and the feature distillation employed in the retraining phase faces an imbalance issue that a few numerically significant feature loss terms dominate over others throughout the retraining process. To this end, we proposed the layer pruning and normalized distillation for compressing diffusion models (LAPTOP-Diff). We, 1) introduced the layer pruning method to compress SDM's U-Net automatically and proposed an effective one-shot pruning criterion whose one-shot performance is guaranteed by its good additivity property, surpassing other layer pruning and handcrafted layer removal methods, 2) proposed the normalized feature distillation for retraining, alleviated the imbalance issue. Using the proposed LAPTOP-Diff, we compressed the U-Nets of SDXL and SDM-v1.5 for the most advanced performance, achieving a minimal 4.0% decline in PickScore at a pruning ratio of 50% while the comparative methods' minimal PickScore decline is 8.2%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

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

  1. Importance-Aware OBS Pruning for Diffusion Models

    cs.CV 2026-07 conditional novelty 6.0 of 10

    Injecting spatial importance maps (e.g., CFG delta) into the OBS Hessian improves subject preservation in pruned diffusion models at high sparsity, but gains over the baseline are small and without error bars.

  2. CODA: Algorithm-Hardware Co-design for Edge Video Diffusion via NMP-Enabled Compute-Cache Operator Disaggregation

    cs.AR 2026-07 conditional novelty 6.0 of 10

    Disaggregating cache operators from compute and overlapping them across the two classifier-free-guidance branches turns cross-timestep caching into up to 1.80x real end-to-end speedup on edge GPUs when the cache overf...

  3. DiffSparse: Accelerating Diffusion Transformers with Learned Token Sparsity

    cs.CV 2026-04 conditional novelty 6.0 of 10

    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.

  4. ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation

    cs.CV 2025-05 conditional novelty 6.0 of 10

    ALTER jointly learns layer pruning masks and timestep-to-expert routing for diffusion UNets, cutting MACs to 26% of the 50-step baseline while keeping FID and CLIP scores near parity.

  5. One-Way Ticket:Time-Independent Unified Encoder for Distilling Text-to-Image Diffusion Models

    cs.CV 2025-05 conditional novelty 5.0 of 10

    TiUE shares one encoder pass across parallel decoder time steps in a distilled text-to-image student, improving one-step generation diversity while removing the iterative denoising loop.

  6. Memory-Efficient Visual Autoregressive Modeling with Scale-Aware KV Cache Compression

    cs.LG 2025-05 conditional novelty 5.0 of 10

    ScaleKV cuts KV cache memory for Visual Autoregressive text-to-image generation to 10% by classifying layers as drafters or refiners per scale and pruning low-attention tokens while keeping benchmark scores nearly unchanged.

  7. Efficient Text-to-Audio Generation via Pruning

    eess.AS 2026-07 conditional novelty 4.0 of 10

    L1-norm filter pruning of AudioLDM's U-Net removes 83% of parameters and 39% of MACs, with quality maintained after 1M-step finetuning, but the comparison is confounded by unequal finetuning budgets.

Pith tools