Pith. sign in

REVIEW 4 cited by

BlockPruner: Fine-grained Pruning for Large Language Models

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 2406.10594 v4 pith:S3L67SKQ submitted 2024-06-15 cs.CL

classification cs.CL
keywords pruningblockprunerllmsblockslayerlayersfiner-grainedlanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the rapid growth in the size and complexity of large language models (LLMs), the costs associated with their training and inference have escalated significantly. Research indicates that certain layers in LLMs harbor substantial redundancy, and pruning these layers has minimal impact on the overall performance. While various layer pruning methods have been developed based on this insight, they generally overlook the finer-grained redundancies within the layers themselves. In this paper, we delve deeper into the architecture of LLMs and demonstrate that finer-grained pruning can be achieved by targeting redundancies in multi-head attention (MHA) and multi-layer perceptron (MLP) blocks. We propose a novel, training-free structured pruning approach called BlockPruner. Unlike existing layer pruning methods, BlockPruner segments each Transformer layer into MHA and MLP blocks. It then assesses the importance of these blocks using perplexity measures and applies a heuristic search for iterative pruning. We applied BlockPruner to LLMs of various sizes and architectures and validated its performance across a wide range of downstream tasks. Experimental results show that BlockPruner achieves more granular and effective pruning compared to state-of-the-art baselines.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Celty: SpMspV GPU Kernel and SIMT Co-Design for Efficient Dual-Sparse LLM Inference

    cs.AR 2026-08 conditional novelty 6.0 of 10

    Dual-sparse LLM decoding can be accelerated by an RLC-CSC spMspV kernel, and a small SIMT-core hardware addition is proposed to remove the remaining index-reconstruction and accumulation bottlenecks.

  2. AQUA: Attention via QUery mAgnitudes for Memory and Compute Efficient Inference in LLMs

    cs.LG 2025-09 conditional novelty 5.0 of 10

    A training-free method that prunes low-magnitude dimensions of projected query/key vectors in attention, cutting dot-product cost by 25% with small benchmark degradation.

  3. Beyond Manually Designed Pruning Policies with Second-Level Performance Prediction: A Pruning Framework for LLMs

    cs.LG 2025-08 conditional novelty 5.0 of 10

    A predictor-based agent generates LLM pruning policies in seconds and reports large perplexity reductions on Llama2-7B and Llama3-8B.

  4. Boosting Parameter Efficiency in LLM-Based Recommendation through Sophisticated Pruning

    cs.IR 2025-07 conditional novelty 5.0 of 10

    PruneRec prunes attention heads, embedding dimensions, MLP units, and layers from a recommendation-tuned LLM, retaining 88% of accuracy with under 5% of non-embedding parameters.

Pith tools