Challenge: Existing pruning methods for Large Language Models rely on unstructured pruning or require special hardware to accelerate computation.
Approach: They propose a retraining-free structured pruning method called SoBP . they evaluate the effectiveness of SoBP across 14 models from 3 LLM families .
Outcome: The proposed method outperforms current state-of-the-art pruning methods on 8 datasets.

Similar Papers

Structured Pruning for Large Language Models Using Coupled Components Elimination and Minor Fine-tuning (2024.findings-naacl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated powerful capabilities in natural language processing, yet their vast number of parameters poses challenges for deployment and inference efficiency.
Approach: They propose a structured pruning algorithm that derives the importance of different components based on intermediate data dependencies and removes coupled components across different layers simultaneously.
Outcome: The proposed algorithm reduces model size and accelerates inference without specialized operators and libraries, while maintaining its utility as versatile problem solvers.
BlockPruner: Fine-grained Pruning for Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have significant computational and memory costs associated with training and inference.
Approach: They propose a training-free structured pruning approach that targets redundancies in MHA and MLP blocks.
Outcome: The proposed pruning approach achieves more granular and effective pruning compared to state-of-the-art pruning methods.
GAP: a Global Adaptive Pruning Method for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing structured pruning methods employ uniform compression rates across network layers, neglecting the varying importance of different network depths.
Approach: They propose a pruning framework that minimizes global capability loss by layer-adaptive pruning rates.
Outcome: The proposed approach achieves comparable performance with state-of-the-art methods at high pruning rates and shows significant advantages at low pruning rates.
Structured Pruning of Large Language Models (2020.emnlp-main)

Copied to clipboard

Challenge: Recent advances in language modeling have led to remarkable improvements on a variety of tasks.
Approach: They propose a generic, structured pruning approach by parameterizing each weight matrix and adaptively removing rank-1 components during training.
Outcome: The proposed method outperforms unstructured pruning and block pruning on language modeling tasks while achieving speedups during training and inference.
From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Structured pruning is a practical approach to deploying large language models (LLMs) but it fails to capitalize on modest task-specific calibration signals, causing limited downstream gains.
Approach: They propose a method that removes attention heads and MLP channels using loss-based important scores . they use perplexity for language modeling and a margin-based objective for decision-style tasks .
Outcome: The proposed method lowers perplexity and improves accuracy at higher sparsity . it also stabilizes accuracy and mitigates perxity collapse without fine-tuning .
DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization (2025.acl-long)

Copied to clipboard

Challenge: Structured pruning reduces model size but often causes uneven degradation across domains, leading to biased performance.
Approach: They propose a method that dynamically adjusts the data distribution during training to restore balanced performance across heterogeneous and multi-tasking data.
Outcome: Experiments in monolingual and multilingual settings show that the proposed method surpasses similarly sized models in pruning and continued pretraining over perplexity, downstream tasks, and instruction tuning.
Pruning before Fine-tuning: A Retraining-free Compression Framework for Pre-trained Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Structured pruning is an effective technique for compressing pre-trained language models (PLMs), but it requires retraining, leading to additional computational overhead.
Approach: They propose a task-specific pruning framework that prunes redundant modules of pre-trained language models before fine-tuning them.
Outcome: The proposed pruning framework achieves higher performance on GLUE, SQUAD, WikiText-2, Wik-103, and PTB datasets while reducing the time required for fine-tuning.
Two-Stage Regularization-Based Structured Pruning for LLMs (2026.acl-long)

Copied to clipboard

Challenge: Structural pruning is a promising solution for large language models . prior structured pruning methods remove unimportant parameters based on certain metrics .
Approach: They propose a structural pruning method that iteratively learns the weights of transformer layers by adding their l1-norm to the loss function.
Outcome: The proposed pruning method outperforms strong layer-wise pruning methods without requiring retraining.
CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Information (2025.coling-main)

Copied to clipboard

Challenge: Existing LLM pruning works focus on unstructured pruning, which typically requires special hardware support for a practical speed-up.
Approach: They propose a network pruning framework that leverages both coarse and fine-grained activation information as an importance criterion to guide pruning.
Outcome: The proposed framework outperforms existing pruning methods on diverse models across sparsity budgets.
Efficient Contextualized Representation: Language Model Pruning for Sequence Labeling (D18-1)

Copied to clipboard

Challenge: Existing efforts to train pre-trained language models have brought significant improvements to various NLP applications.
Approach: They propose to compress bulky LMs while preserving useful information for a specific task.
Outcome: The proposed method can detach any layer without affecting others, and stretch shallow and wide LMs to be deep and narrow.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations