mlsanityData to 14 Oct 2026

TriSP: Tri-Signal Structured Pruning for Large Language Models

arXiv 2607.22587 ↗First posted 9 Jun 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) achieve strong performance across diverse tasks but their deployment is constrained by the memory and compute cost of their parameters. Structured pruning addresses this by removing entire structures such as attention heads and Multi-Layer Perceptron (MLP) neurons to produce smaller dense models that run efficiently on standard hardware. However, existing methods rely on either gradient-based importance estimation, which is memory-prohibitive, or activation-based statistical proxies, which do not directly measure the effect of removal on the loss. Furthermore, the interaction between the importance criterion and the post-pruning recovery strategy has not been systematically studied. We propose TriSP (Tri-Signal Structured Pruning), an importance metric that combines weight magnitude scaled by activation norm with first-order gradient sensitivity via a geometric mean, producing a channel-level score that captures both structural and loss-sensitivity signals. Combined with adaptive per-layer budget allocation and low-rank adaptation (LoRA) recovery, TriSP achieves the lowest perplexity and highest zero-shot accuracy across all tested configurations, reaching 6.80 WikiText-2 perplexity at 20% pruning on LLaMA-7B. Inference throughput improves by 82% at 50% pruning, while still maintaining competitive performance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 29 references that are in the map. First posted on arXiv 9 Jun 2026.

Builds on

24 of 29 references.

References · 24

  1. 2017Attention Is All You Needcited by 60,361
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2023Mistral 7Bcited by 3,164
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  8. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  9. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  10. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  11. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  12. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
12 more
  1. 2024DeepSeek LLM: Scaling Open-Source Language Models with Longtermismcited by 642
  2. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  3. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  4. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  5. 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
  6. 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
  7. 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 44
  8. 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 43
  9. 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 36
  10. 2023Beyond Size: How Gradients Shape Pruning Decisions in Large Language Modelscited by 30
  11. 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26
  12. 2025Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probingcited by 14

Built on by

Not cited yet.