pith. sign in

arxiv: 2402.02834 · v2 · pith:2LMYFHYInew · submitted 2024-02-05 · 💻 cs.LG · cs.CL

Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods

classification 💻 cs.LG cs.CL
keywords pruningdepthwidthllmsmodelslargewhileinference
0
0 comments X
read the original abstract

Structured pruning of modern large language models (LLMs) has emerged as a way of decreasing their high computational needs. Width pruning reduces the size of projection weight matrices (e.g., by removing attention heads) while maintaining the number of layers. Depth pruning, in contrast, removes entire layers or blocks, while keeping the size of the remaining weights unchanged. Most current research focuses on either width-only or a blend of width and depth pruning, with little comparative analysis between the two units (width vs. depth) concerning their impact on LLM inference efficiency. In this work, we show that simple depth pruning can effectively compress LLMs while achieving comparable or superior performance to recent width pruning studies. Our pruning method boosts inference speeds, especially under memory-constrained conditions that require limited batch sizes for running LLMs, where width pruning is ineffective. In retraining pruned models for quality recovery, continued pretraining on a large corpus markedly outperforms LoRA-based tuning, particularly at severe pruning ratios. We hope this work can help build compact yet capable LLMs. Code and models can be found at: https://github.com/Nota-NetsPresso/shortened-llm

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 20 Pith papers

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

  1. Beyond FLOPs: Benchmarking Real Inference Acceleration of LLM Pruning under a GEMM-Centric Taxonomy

    cs.LG 2026-06 conditional novelty 7.0

    A GEMM-centric taxonomy and unified benchmark show static depth pruning as the strongest Pareto-optimal baseline for LLM inference acceleration, with the frontier shifting to dynamic depth then static width pruning as...

  2. MuCRASP: Multimodal Chain-of-thought Reasoning aware Structured Pruning

    cs.AI 2026-05 unverdicted novelty 7.0

    MuCRASP prunes VLMs in a CoT-aware manner, outperforming baselines by preserving reasoning quality at 30-50% compression rates on models like Qwen2.5-VL-7B.

  3. DASH: Fast Differentiable Architecture Search for Hybrid Attention in Minutes on a Single GPU

    cs.LG 2026-05 unverdicted novelty 7.0

    DASH discovers stronger hybrid attention architectures for LLMs via minutes-scale differentiable search, outperforming selector baselines and Jet-Nemotron on RULER while using 0.006% of prior search tokens.

  4. Understanding Performance Collapse in Layer-Pruned Large Language Models via Decision Representation Transitions

    cs.CL 2026-05 unverdicted novelty 7.0

    Performance collapse in layer-pruned LLMs stems from disrupting the Silent Phase of decision-making, which blocks the transition to correct predictions, while the later Decisive Phase is robust to pruning.

  5. SimDiff: Depth Pruning via Similarity and Difference

    cs.AI 2026-04 unverdicted novelty 7.0

    SimDiff uses similarity and difference metrics to prune LLM layers more effectively than cosine similarity alone, retaining over 91% performance at 25% pruning on LLaMA2-7B.

  6. Why and When Visual Token Pruning Fails? A Study on Relevant Visual Information Shift in MLLMs Decoding

    cs.CV 2026-04 unverdicted novelty 7.0

    Visual token pruning in MLLMs fails on complex reasoning due to Relevant Visual Information Shift during decoding, but the DSTP framework fixes it training-free across models.

  7. Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.2

    cs.CL 2025-12 unverdicted novelty 7.0

    Width pruning in Llama-3.2 models reduces parametric knowledge while enhancing instruction-following and preserving reasoning.

  8. End-to-End Dynamic Sparsity for Resource-Adaptive LLM Inference

    cs.IR 2026-06 unverdicted novelty 6.0

    L2A trains one LLM with input-and-budget-conditioned gates to adapt sparsity across layers, heads, and tokens, tracing the compute-accuracy frontier while staying within 0.6% of dense performance at 34% layer sparsity...

  9. CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry

    cs.LG 2026-06 unverdicted novelty 6.0

    CascadeFormer tapers Transformer width with depth based on gradient fan-in asymmetry to match uniform baselines in perplexity while cutting latency 8.6%.

  10. Don't Go Breaking My LLM: The Impact of Pruning Attention Layers on Explanation Faithfulness and Confidence Calibration

    cs.LG 2026-06 unverdicted novelty 6.0

    Pruning attention layers in five LLMs across eight datasets maintains accuracy but degrades faithfulness and calibration.

  11. Pruning and Distilling Mixture-of-Experts into Dense Language Models

    cs.CL 2026-05 unverdicted novelty 6.0

    A systematic MoE-to-dense conversion via expert scoring, grouping, and distillation yields +6.3 pp average accuracy over dense-to-dense pruning at matched parameter count on tested models.

  12. Locality-Aware Redundancy Pruning for LLM Depth Compression

    cs.LG 2026-05 unverdicted novelty 6.0

    LoRP uses a new Representation Locality Score derived from inter-layer hidden-state similarity to cluster layers and prune intra-cluster redundancies in one shot, yielding better perplexity and task accuracy than prio...

  13. Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs

    cs.LG 2026-05 unverdicted novelty 6.0

    Ghosted Layers recovers pruned LLM performance via an unconstrained closed-form linear operator for boundary activation alignment, outperforming prior constrained training-free baselines.

  14. SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training

    cs.LG 2026-05 unverdicted novelty 6.0

    Pruning pretrained MoE models outperforms training from scratch, different compression methods converge after continued pretraining, and combining KD with language modeling loss plus progressive schedules yields a com...

  15. Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs

    cs.LG 2026-05 unverdicted novelty 5.0

    Ghosted Layers recovers accuracy in layer-pruned LLMs via a closed-form unconstrained linear operator that aligns boundary activations using a small calibration set.

  16. TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability

    cs.LG 2026-05 unverdicted novelty 5.0

    Task-aware pruning improves OOD model performance by realigning distorted OOD layerwise norm and pairwise-distance profiles with the task-adapted geometry observed on ID inputs.

  17. TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability

    cs.LG 2026-05 unverdicted novelty 5.0

    Task-aware pruning improves OOD performance by removing layers that distort task-adapted representation profiles, realigning OOD inputs with the geometry observed on ID data.

  18. SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training

    cs.LG 2026-05 unverdicted novelty 5.0

    Pruning pretrained MoE models outperforms training from scratch under fixed budget, different expert compression methods converge after continued training, and progressive pruning plus multi-token KD improves the fina...

  19. On the Limits of Layer Pruning for Generative Reasoning in Large Language Models

    cs.LG 2026-02 unverdicted novelty 5.0

    Layer pruning preserves classification performance in LLMs but fundamentally limits recovery of generative reasoning capabilities even after extensive self-supervised finetuning.

  20. TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination

    cs.LG 2025-10 unverdicted novelty 5.0

    TALE selectively prunes task-detrimental layers in LLMs at inference time to match or exceed baseline performance with lower computational cost across multiple models and tasks.