Pith. sign in

REVIEW 2 cited by

2SSP: A Two-Stage Framework for Structured Pruning of LLMs

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 2501.17771 v2 pith:2SCS5JGE submitted 2025-01-29 cs.CL cs.AIcs.LG

2SSP: A Two-Stage Framework for Structured Pruning of LLMs

classification cs.CL cs.AIcs.LG
keywords pruninglanguageremovessparsitythreeattentiondepthdone
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose a novel Two-Stage framework for Structured Pruning (\textsc{2SSP}) for pruning Large Language Models (LLMs), which combines two different strategies of pruning, namely Width and Depth Pruning. The first stage (Width Pruning) removes entire neurons, hence their corresponding rows and columns, aiming to preserve the connectivity among the pruned structures in the intermediate state of the Feed-Forward Networks in each Transformer block. This is done based on an importance score measuring the impact of each neuron on the output magnitude. The second stage (Depth Pruning), instead, removes entire Attention submodules. This is done by applying an iterative process that removes the Attention with the minimum impact on a given metric of interest (in our case, perplexity). We also propose a novel mechanism to balance the sparsity rate of the two stages w.r.t. to the desired global sparsity. We test \textsc{2SSP} on four LLM families and three sparsity rates (25\%, 37.5\%, and 50\%), measuring the resulting perplexity over three language modeling datasets as well as the performance over six downstream tasks. Our method consistently outperforms five state-of-the-art competitors over three language modeling and six downstream tasks, with an up to two-order-of-magnitude gain in terms of pruning time. The code is available at https://github.com/FabrizioSandri/2SSP.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization

    cs.AI 2026-06 conditional novelty 6.0

    A two-stage framework combining Pareto depth-pruning and parallel Bayesian layer-wise sparsity allocation achieves competitive accuracy and lower latency on 7–14B LLMs at 37.5–50% structured sparsity.

  2. Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization

    cs.AI 2026-06 conditional novelty 4.0

    A two-stage depth-plus-width pruning pipeline (NSGA-II + parallel Bayesian optimization) reports top average accuracy and lowest latency across four LLMs at 37.5-50% sparsity, with material internal inconsistencies in...