paper-with-me

홈 › Papers

LLM-BIP: Structured Pruning for Large Language Models with Block-Wise Forward Importance Propagation

2024-12-09 · Haihang Wu

Large language models (LLMs) have demonstrated remarkable performance across various language tasks, but their widespread deployment is impeded by their large size and high computational costs. Structural pruning is a prevailing technique used to introduce sparsity into pre-trained models and facilitate direct hardware acceleration during inference by removing redundant connections (structurally-grouped parameters), such as channels and attention heads. Existing structural pruning approaches often employ either global or layer-wise pruning criteria; however, they are hindered by ineffectiveness stemming from inaccurate evaluation of connection importance. Global pruning methods typically assess component importance using near-zero and unreliable gradients, while layer-wise pruning approaches encounter significant pruning error accumulation issues. To this end, we propose a more accurate pruning metric based on the block-wise importance score propagation, termed LLM-BIP. Specifically, LLM-BIP precisely evaluates connection importance by gauging its influence on the respective transformer block output, which can be efficiently approximated in a single forward pass through an upper bound derived from the assumption of Lipschitz continuity. We evaluate the proposed method using LLaMA-7B, Vicuna-7B, and LLaMA-13B across common zero-shot tasks. The results demonstrate that our approach achieves an average of 3.26% increase in accuracy for common reasoning tasks compared to previous best baselines. It also reduces perplexity by 14.09 and 68.76 on average for the WikiText2 dataset and PTB dataset, respectively.

📄 PDF Abstract BibTeX arXiv:2412.06419

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음
Pruning 설명 없음

Similar Papers 제목 키워드 기반

Thanos: A Block-wise Pruning Algorithm for Efficient Large Language Model Compression

2025-04-06 · Ivan Ilin, Peter Richtarik

This paper presents Thanos, a novel weight-pruning algorithm designed to reduce the memory footprint and enhance the computational efficiency of large language models (LLMs) by removing redundant weights while maintainin…

Computational EfficiencyLanguage ModelingLanguage ModellingLarge Language Model+1

PagedEviction: Structured Block-wise KV Cache Pruning for Efficient Large Language Model Inference

2025-09-04 · Krishna Teja Chitty-Venkata, Jie Ye, Xian-He Sun, Anthony Kougkas 외 arxiv

KV caching significantly improves the efficiency of Large Language Model (LLM) inference by storing attention states from previously processed tokens, enabling faster generation of subsequent tokens. However, as sequence…

From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models

2025-10-20 · Ziyan Wang, Enmao Diao, Qi Le, Pu Wang 외 arxiv

Structured pruning is a practical approach to deploying large language models (LLMs) efficiently, as it yields compact, hardware-friendly architectures. However, the dominant local paradigm is task-agnostic: by optimizin…

BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation

2024-02-18 · Peng Xu, Wenqi Shao, Mengzhao Chen, Shitao Tang 외

Large language models (LLMs) have demonstrated outstanding performance in various tasks, such as text summarization, text question-answering, and etc. While their performance is impressive, the computational footprint du…

GPUQuestion AnsweringText Summarization

Scalable iterative pruning of large language and vision models using block coordinate descent

2024-11-26 · Gili Rosenberg, J. Kyle Brubaker, Martin J. A. Schuetz, Elton Yechao Zhu 외

Pruning neural networks, which involves removing a fraction of their weights, can often maintain high accuracy while significantly reducing model complexity, at least up to a certain limit. We present a neural network pr…

Combinatorial OptimizationNetwork Pruning