Pith. sign in

REVIEW 7 cited by

Beyond Size: How Gradients Shape Pruning Decisions in 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 2311.04902 v2 pith:TQAU37W3 submitted 2023-11-08 cs.CL cs.AIcs.LG

Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models

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

Large Language Models (LLMs) with billions of parameters are prime targets for network pruning, removing some model weights without hurting performance. Prior approaches such as magnitude pruning, SparseGPT, and Wanda, either concentrated solely on weights or integrated weights with activations for sparsity. However, they overlooked the informative gradients derived from pretrained LLMs. In this paper, we present a novel sparsity-centric pruning method for pretrained LLMs, termed Gradient-based Language Model Pruner (GBLM-Pruner). GBLM-Pruner leverages the first-order term of the Taylor expansion, operating in a training-free manner by harnessing properly normalized gradients from a few calibration samples to determine the pruning metric, and substantially outperforms competitive counterparts like SparseGPT and Wanda in multiple benchmarks. Intriguingly, by incorporating gradients, unstructured pruning with our method tends to reveal some structural patterns, which mirrors the geometric interdependence inherent in the LLMs' parameter structure. Additionally, GBLM-Pruner functions without any subsequent retraining or weight updates to maintain its simplicity as other counterparts. Extensive evaluations on LLaMA-1 and LLaMA-2 across various benchmarks show that GBLM-Pruner surpasses magnitude pruning, Wanda and SparseGPT by significant margins. We further extend our approach on Vision Transformer. Our code and models are available at https://github.com/VILA-Lab/GBLM-Pruner.

discussion (0)

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

Forward citations

Cited by 7 Pith papers

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

  1. Weight-Adjusted Gradients Reveal Parameter Importance and Failure Modes in LLMs

    cs.LG 2026-07 conditional novelty 6.0

    Weight-adjusted gradients (weight times gradient) identify sparse LLM parameters whose masking induces rapid collapse and improve several efficiency and editing applications.

  2. SpenseGPT: Practical One-shot Pruning Enabling Sparse and Dense GEMMs for LLM Inference

    cs.LG 2026-06 unverdicted novelty 6.0

    SpenseGPT introduces a hybrid sparse-dense weight format and one-shot pruning that delivers 1.2x end-to-end LLM decoding speedup on B200 GPUs with FP8 while preserving accuracy on Qwen3-32B and Seed-OSS-36B.

  3. RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models

    cs.LG 2026-05 unverdicted novelty 6.0

    RT-Lynx shifts DiT sparsity from weights to activations, reports up to 1.55x linear-layer speedup while preserving generation quality across multiple diffusion models.

  4. Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation

    cs.LG 2025-09 conditional novelty 6.0

    PrunedLoRA tunes large-rank LoRA adapters and progressively structurally prunes A and B to a target low rank, empirically closing much of the LoRA-to-full-fine-tuning gap.

  5. MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs

    cs.LG 2025-06 unverdicted novelty 6.0

    MaskPro learns categorical distributions over groups of M weights to generate exact (N:M) sparsity via N-way sampling without replacement and stabilizes training with a moving average tracker of loss residuals.

  6. RAP: Runtime Adaptive Pruning for LLM Inference

    cs.LG 2025-05 unverdicted novelty 5.0

    RAP is a reinforcement learning framework for runtime-adaptive pruning of LLMs that jointly optimizes model weights and KV-cache usage under varying memory budgets.

  7. TriSP: Tri-Signal Structured Pruning for Large Language Models

    cs.AI 2026-06 conditional novelty 4.0

    TriSP prunes LLM attention heads and MLP neurons by combining magnitude, activation norm, and gradient sensitivity, achieving the best reported quality at 20–50% pruning on 7B models with LoRA recovery.