Layer-wise Model Pruning based on Mutual Information
Chun Fan, Jiwei Li, Tianwei Zhang, Xiang Ao, Fei Wu, Yuxian Meng, Xiaofei Sun
Abstract
Inspired by mutual information (MI) based feature selection in SVMs and logistic regression, in this paper, we propose MI-based layer-wise pruning: for each layer of a multi-layer neural network, neurons with higher values of MI with respect to preserved neurons in the upper layer are preserved. Starting from the top softmax layer, layer-wise pruning proceeds in a top-down fashion until reaching the bottom word embedding layer. The proposed pruning strategy offers merits over weight-based pruning techniques: (1) it avoids irregular memory access since representations and matrices can be squeezed into their smaller but dense counterparts, leading to greater speedup; (2) in a manner of top-down pruning, the proposed method operates from a more global perspective based on training signals in the top layer, and prunes each layer by propagating the effect of global signals through layers, leading to better performances at the same sparsity level. Extensive experiments show that at the same sparsity level, the proposed strategy offers both greater speedup and higher performances than weight-based pruning methods (e.g., magnitude pruning, movement pruning).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers7
- f-Divergence Minimization for Sequence-Level Knowledge DistillationYuqiao Wen, Zichao Li, Wenyu Du, Lili MouACL 2023 · 14 citations
- MISA: Memory-Efficient LLMs Optimization with Module-wise Importance SamplingYuxi Liu, Renjia Deng, Yutong He, Xue Wang et al.NeurIPS 2025 · 2 citations
- FlowNIB: An Information Bottleneck Analysis of Bidirectional vs. Unidirectional Language ModelsMd Kowsher, Nusrat Jahan Prottasha, Shiyun Xu, Shetu Mohanto et al.ICLR 2026
- Attention Pruning: Automated Fairness Repair of Language Models via Surrogate Simulated AnnealingVishnu Asutosh Dasu, Md Rafi Ur Rashid, Vipul Gupta, Saeid Tizpaz-Niari et al.ICSE 2026
- Dynamic Low-Rank Sparse Adaptation for Large Language ModelsWeizhong Huang, Yuxin Zhang, Xiawu Zheng, Yang Liu et al.ICLR 2025
Builds on14
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- ALBERT: A Lite BERT for Self-supervised Learning of Language RepresentationsZhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel et al.ICLR 2020 · 7,418 citations
- Linear Mode Connectivity and the Lottery Ticket HypothesisJonathan Frankle, Gintare Karolina Dziugaite, Daniel M. Roy, Michael CarbinICML 2020 · 750 citations
- Reducing Transformer Depth on Demand with Structured DropoutAngela Fan, Edouard Grave, Armand JoulinICLR 2020 · 695 citations
- Movement Pruning: Adaptive Sparsity by Fine-TuningVictor Sanh, Thomas Wolf, Alexander M. RushNeurIPS 2020 · 656 citations
Related papers
- Lookahead: A Far-sighted Alternative of Magnitude-based PruningSejun Park, Jaeho Lee, Sangwoo Mo, Jinwoo ShinICLR 2020 · 104 citations
- Rethinking Pruning for Accelerating Deep Inference At the EdgeDawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong et al.KDD 2020 · 24 citations
- Layer-adaptive Sparsity for the Magnitude-based PruningJaeho Lee, Sejun Park, Sangwoo Mo, Sungsoo Ahn et al.ICLR 2021 · 331 citations
- Effective Sparsification of Neural Networks With Global Sparsity ConstraintXiao Zhou, Weizhong Zhang, Hang Xu, Tong ZhangCVPR 2021
- LSA: Layer-wise Sparsity Allocation for Large Language Model Pruning Based on Minimal Linear Reconstruction ErrorZhiguo Yang, Changjian Deng, Qinke Chen, Zijing Zhou et al.ICLR 2026
