Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Models
Not on the map. Why?
Abstract (arXiv)
While large language models (LLMs) demonstrate impressive performance across various tasks, their deployment in real-world scenarios is still constrained by high computational demands. Layer-wise pruning, a commonly employed strategy to mitigate inference costs, can partially address this challenge. However, existing approaches generally depend on static heuristic rules and fail to account for the interdependencies among layers, thereby limiting the effectiveness of the pruning process. To this end, this paper proposes a game-theoretic framework that formulates layer pruning as a cooperative game in which each layer acts as a player and model performance serves as the utility. As computing exact Shapley values is computationally infeasible for large language models (LLMs), we propose using a lightweight surrogate network to estimate layer-wise marginal contributions. This network can predict LLM performance for arbitrary layer combinations at a low computational cost. Additionally, we employ stratified Monte Carlo mask sampling to further reduce the cost of Sharpley value estimation. This approach captures inter-layer dependencies and dynamically identifies critical layers for pruning. Extensive experiments demonstrate the consistent superiority of our method in terms of perplexity and zero-shot accuracy, achieving more efficient and effective layer-wise pruning for large language models.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 34 of its 47 references that are in the map. First posted on arXiv 8 Feb 2026.
Builds on
34 of 47 references.
References · 34
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,041
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
22 more
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
- 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 798
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 710
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2022Confident Adaptive Language Modelingcited by 297
- 2023Specializing Smaller Language Models towards Multi-Step Reasoningcited by 249
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
- 2024GTBench: Uncovering the Strategic Reasoning Limitations of LLMs via Game-Theoretic Evaluationscited by 118
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 96
- 2023SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inferencecited by 89
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 80
- 2024Transformer Layers as Painterscited by 50
- 2024Investigating Layer Importance in Large Language Modelscited by 35
- 2025LayerIF: Estimating Layer Quality for Large Language Models using Influence Functionscited by 12
- 2025Efficient Shapley Value-based Non-Uniform Pruning of Large Language Modelscited by 8
- 2025DipSVD: Dual-importance Protected SVD for Efficient LLM Compressioncited by 7
- 2023Using Cooperative Game Theory to Prune Neural Networkscited by 1
Built on by
Citing papers per year: 2026: 3.
3 papers.