mlsanityData to 7 Oct 2026

GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation

arXiv 2602.14649 ↗First posted 16 Feb 2026cs.CLcited by 0

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Large Language Models (LLMs) exhibit strong reasoning abilities, but their high computational costs limit their practical deployment. Recent studies reveal significant redundancy in LLMs layers, making layer pruning an active research topic. Layer pruning research primarily focuses on two aspects: measuring layer importance and recovering performance after pruning. Unfortunately, the present works fail to simultaneously maintain pruning performance and efficiency. In this study, we propose GradMAP, a faster layer pruning method with Gradient Metric And Projection compensation, which consists of two stages. In the first stage, we introduce a novel metric based on gradient magnitudes, enabling a global assessment of layer importance. Note that, it requires only a single backward propagation step per pruning decision, substantially enhancing pruning efficiency. In the second stage, we first analyze the layers with the largest mean shift resulting from pruning, and then incorporate a simple yet effective projection compensation matrix to correct this drift in one step. In this way, the degradation of model performance caused by layer pruning is effectively alleviated. Extensive experiments show that GradMAP outperforms previous layer pruning methods in both pruning speed (achieving an average 4× speedup) and performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 35 of its 63 references that are in the map. First posted on arXiv 16 Feb 2026.

Builds on

35 of 63 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024The Unreasonable Ineffectiveness of the Deeper Layers26 Mar

Other references · 34

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023GPT-4 Technical Reportcited by 18,132
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  5. 2024The Llama 3 Herd of Modelscited by 14,192
  6. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  8. 2016Pointer Sentinel Mixture Modelscited by 2,992
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  11. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  12. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
22 more
  1. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  2. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
  3. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
  4. 2024Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preferencecited by 1,151
  5. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  6. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
  7. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  8. 2023Baichuan 2: Open Large-scale Language Modelscited by 664
  9. 2019Importance Estimation for Neural Network Pruningcited by 531
  10. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  11. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 436
  12. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
  13. 2020CLUE: A Chinese Language Understanding Evaluation Benchmarkcited by 277
  14. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
  15. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 96
  16. 2019Investigating Prior Knowledge for Challenging Chinese Machine Reading Comprehensioncited by 80
  17. 2019ChID: A Large-scale Chinese IDiom Dataset for Cloze Testcited by 65
  18. 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 49
  19. 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
  20. 2024Streamlining Redundant Layers to Compress Large Language Modelscited by 32
  21. 2023Weight subcloning: direct initialization of transformers using larger pretrained onescited by 30
  22. 2024Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Mergingcited by 18

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Rethinking Layer Redundancy: Calibration Matters More Than Search in LLM Depth Pruning
  2. 2025Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information
  3. 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models
  4. 2026SimDiff: Depth Pruning via Similarity and Difference
  5. 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
  6. 2026On the Limits of Layer Pruning for Generative Reasoning in Large Language Models
  7. 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methods
  8. 2025Automatic Pruning Discovery for Large Language Models