mlsanityData to 14 Oct 2026

TRIM: Achieving Extreme Sparsity with Targeted Row-wise Iterative Metric-driven Pruning

arXiv 2505.16743 ↗First posted 22 May 2025cs.CL cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) present significant computational and memory challenges due to their extensive size, making pruning essential for their efficient deployment. Existing one-shot pruning methods often apply uniform sparsity constraints across layers or within each layer, resulting in suboptimal performance, especially at high sparsity ratios. This work introduces TRIM (Targeted Row-wise Iterative Metric-driven pruning), a novel approach that applies varying sparsity ratios to individual output dimensions (rows) within each layer. TRIM employs an iterative adjustment process guided by quality metrics to optimize dimension-wise sparsity allocation, focusing on reducing variance in quality retention across outputs to preserve critical information. TRIM can be seamlessly integrated with existing layer-wise pruning strategies. Our evaluations on perplexity and zero-shot tasks across diverse LLM families (Qwen2.5, LLaMA-2, and OPT) and sparsity levels demonstrate that TRIM achieves new state-of-the-art results and enhances stability. For instance, at 80% sparsity, TRIM reduces perplexity by 48% for Qwen2.5-14B and over 90% for OPT-13B compared to baseline methods. We conclude that fine-grained, dimension-wise sparsity adaptation is crucial for pushing the limits of extreme LLM compression. Code available at: https://github.com/flobk/TRIM

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 40 of its 53 references that are in the map. First posted on arXiv 22 May 2025.

Builds on

40 of 53 references.

References · 40

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  5. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,695
  6. 2020Scaling Laws for Neural Language Modelscited by 6,586
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  9. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  10. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  11. 2016Pointer Sentinel Mixture Modelscited by 3,096
  12. 2022Emergent Abilities of Large Language Modelscited by 2,512
28 more
  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  3. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  5. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  6. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
  7. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  8. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  9. 2023Large Language Modelscited by 780
  10. 2018Rethinking the Value of Network Pruningcited by 599
  11. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  12. 2019Importance Estimation for Neural Network Pruningcited by 541
  13. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  14. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  15. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  16. 2019The State of Sparsity in Deep Neural Networkscited by 476
  17. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  18. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  19. 2024A Survey on Efficient Inference for Large Language Modelscited by 205
  20. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
  21. 2021BERT Busters: Outlier Dimensions that Disrupt Transformerscited by 112
  22. 2019Traditional and Heavy-Tailed Self Regularization in Neural Network Modelscited by 105
  23. 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
  24. 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 36
  25. 2017Rethinking generalization requires revisiting old ideas: statistical mechanics approaches and complex learning behaviorcited by 25
  26. 2023Outlier Dimensions Encode Task-Specific Knowledgecited by 15
  27. 2025Efficient Shapley Value-based Non-Uniform Pruning of Large Language Modelscited by 8
  28. 2025Towards Extreme Pruning of LLMs with Plug-and-Play Mixed Sparsitycited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.