mlsanityData to 14 Oct 2026

E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models

arXiv 2511.17205 ↗First posted 21 Nov 2025cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

With the increasing size of large language models, layer pruning has gained increased attention as a hardware-friendly approach for model compression. However, existing layer pruning methods struggle to simultaneously address key practical deployment challenges, including performance degradation, high training costs, and limited acceleration. To overcome these limitations, we propose name, a task-underlineEffective, training-underlineEconomical and inference-underlineEfficient layer pruning framework. namespace introduces two key innovations: (1) a differentiable mask optimization method using a Gumbel-TopK sampler, enabling efficient and precise pruning mask search; and (2) an entropy-aware adaptive knowledge distillation strategy that enhances task performance. Extensive experiments over diverse model architectures and benchmarks demonstrate the superiority of our method over state-of-the-art approaches. Notably, namespace achieves 96% accuracy, a mere 0.8% drop from the original model (96.8%) on MATH-500 when pruning 25% layers of Qwen3-32B, outperforming existing SOTA (95%), with a 1.33× inference speedup by consuming merely 0.5B tokens (0.5% of the post-training data volume).

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 41 of its 51 references that are in the map. First posted on arXiv 21 Nov 2025.

Builds on

41 of 51 references.

References · 41

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  6. 2020Scaling Laws for Neural Language Modelscited by 6,586
  7. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  8. 2024Qwen2.5 Technical Reportcited by 4,942
  9. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  11. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  12. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
29 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. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  5. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
  6. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  7. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
  8. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
  9. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  10. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
  11. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  12. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  13. 2017Crowdsourcing Multiple Choice Science Questionscited by 765
  14. 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 737
  15. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  16. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  17. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  18. 2025Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoningcited by 559
  19. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  20. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  21. 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
  22. 2018Neural Nearest Neighbors Networkscited by 98
  23. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  24. 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
  25. 20251.4 Million Open-Source Distilled Reasoning Dataset to Empower Large Language Model Trainingcited by 49
  26. 2024Flextron: Many-in-One Flexible Large Language Modelcited by 45
  27. 2025Jet-Nemotron: Efficient Language Model with Post Neural Architecture Searchcited by 41
  28. 2025The Synergy Dilemma of Long-CoT SFT and RL: Investigating Post-Training Techniques for Reasoning VLMscited by 12
  29. 2025A Simple Linear Patch Revives Layer-Pruned Large Language Modelscited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025MaskPrune: Mask-based LLM Pruning for Layer-wise Uniform Structures
  2. 2025Pruning Laws for Large Language Models
  3. 2024FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Models
  4. 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Models
  5. 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
  6. 2024LaCo: Large Language Model Pruning via Layer Collapse
  7. 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient
  8. 2026MI-PRUN: Optimize Large Language Model Pruning via Mutual Information