paper-with-me

홈 › Papers

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

2024-02-05 · Bo-Kyeong Kim, Geonmin Kim, Tae-Ho Kim, Thibault Castells, Shinkook Choi, Junho Shin, Hyoung-Kyu Song

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

📄 PDF Abstract BibTeX arXiv:2402.02834

Code (1)

nota-netspresso/shortened-llm 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Compressing LLMs with MoP: Mixture of Pruners

2026-02-05 · Bruno Lopes Yamamoto, Lucas Lauton de Alcantara, Victor Zacarias, Leandro Giusti Mugnaini 외 arxiv

The high computational demands of Large Language Models (LLMs) motivate methods that reduce parameter count and accelerate inference. In response, model pruning emerges as an effective strategy, yet current methods typic…

Computational Efficiency

SimDiff: Depth Pruning via Similarity and Difference

2026-04-21 · Yuli Chen, Shuhao Zhang, Fanshen Meng, Bo Cheng 외 arxiv

Depth pruning improves the deployment efficiency of large language models (LLMs) by identifying and removing redundant layers. A widely accepted standard for this identification process is to measure the similarity betwe…

COMPACT: Common-token Optimized Model Pruning Across Channels and Tokens

2025-09-08 · Eugene Kwek, Wenpeng Yin arxiv

Making large language models (LLMs) more efficient in memory, latency, and serving cost is crucial for edge deployment, interactive applications, and sustainable inference at scale. Pruning is a promising technique, but …

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

2026-06-08 · Haozhe Hu, Hao Wu, Anhao Zhao, Longwei Ding 외 arxiv

Pruning has emerged as a dominant paradigm for accelerating large language model (LLM) inference, spanning a broad spectrum of methods that remove computation across tokens, layers, heads, dimensions, and attention patte…

BUDDY: BUdget-Driven DYnamic Depth Routing for Adaptive Large Language Model Inference

2026-06-08 · Yuhua Zhou, Shaoqi Yu, Shichao Weng, Changhai Zhou 외 arxiv

Large language models (LLMs) incur high inference cost due to their depth and parameter scale. Depth pruning can reduce latency by skipping redundant Transformer blocks, but existing methods (i) provide limited control u…