LEAP: Learnable End-to-End Adaptive Pruning of Large Language Models
Not on the map. Why?
Abstract (arXiv)
Unstructured sparsity is now natively accelerated by recent GPU kernels and dataflow hardware, shifting the bottleneck from inference execution to the pruning algorithm. State-of-the-art methods for unstructured LLM pruning are layer-wise surrogates derived from the Optimal Brain Surgeon principle, and they sacrifice end-to-end accuracy, especially under aggressive sparsity. End-to-end alternatives such as MaskLLM and PATCH show that learnable masks can close this gap, but their categorical-over-patterns parameterization scales with the number of valid masks per row and does not port to the unstructured setting. We introduce LEAP, which replaces this intractable parameterization with a per-weight Bernoulli-via-Gumbel-sigmoid relaxation that makes end-to-end unstructured mask learning tractable. Across five LLM families from 0.5B to 8B parameters at 50% and 60% sparsity, LEAP improves six-task average zero-shot accuracy by +2.59 points on average over ADMM, the best layer-wise baseline in our sweep.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 17 May 2026.
Builds on
23 of 33 references.
References · 23
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2025Gemma 3 Technical Reportcited by 1,824
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
11 more
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2019Winning the Lottery with Continuous Sparsificationcited by 100
- 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 50
- 2024SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMscited by 20
- 2024Fast and Effective Weight Update for Pruned Large Language Modelscited by 11
- 2023MKOR: Momentum-Enabled Kronecker-Factor-Based Optimizer Using Rank-1 Updatescited by 7
- 2025Thanos: A Block-wise Pruning Algorithm for Efficient Large Language Model Compressioncited by 7
- 2025MACKO: Sparse Matrix-Vector Multiplication for Low Sparsitycited by 6
- 2025The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMMcited by 5
- 2025OPTIMA: Optimal One-shot Pruning for LLMs via Quadratic Programming Reconstructioncited by 2
Built on by
Not cited yet.