Ranjie Duan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ranjie Duan has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Haibin Duan
School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China
1 shared publication - Jiansheng Chen
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
1 shared publication - Maoxun Yuan
Beihang University
1 shared publication Pengyu Tong
1 shared publication- Qing Guo
Nankai University
1 shared publication - Rui Sun
University of Aberdeen University of Aberdeen FNii-Shenzhen FNii-Shenzhen and SSE CUHKSZ
1 shared publication
Latest Publications
- 1 May 2026
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 134 (5) , 253
Knowledge-Guided Adversarial Training for Infrared Object Detection via Thermal Radiation Modeling
- 1 May 2026
- Published by Springer Nature in International Journal of Computer Vision
- Vol. 134 (5) , 253
Knowledge-Guided Adversarial Training for Infrared Object Detection via Thermal Radiation Modeling
- Open Access
Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Models
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.
Open AccessPruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Models
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.