Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural Networks
Kaixin Xu, Zhe Wang, Xue Geng, Min Wu, Xiaoli Li, Weisi Lin
Abstract
In this paper, we propose a novel layer-adaptive weightpruning approach for Deep Neural Networks (DNNs) that addresses the challenge of optimizing the output distortion minimization while adhering to a target pruning ratio constraint. Our approach takes into account the collective influence of all layers to design a layer-adaptive pruning scheme. We discover and utilize a very important additivity property of output distortion caused by pruning weights on multiple layers. This property enables us to formulate the pruning as a combinatorial optimization problem and efficiently solve it through dynamic programming. By decomposing the problem into sub-problems, we achieve linear time complexity, making our optimization algorithm fast and feasible to run on CPUs. Our extensive experiments demonstrate the superiority of our approach over existing methods on the ImageNet and CIFAR-10 datasets. On CIFAR-10, our method achieves remarkable improvements, outperforming others by up to 1.0% for ResNet-32, 0.5% for VGG-16, and 0.7% for DenseNet-121 in terms of top-1 accuracy. On ImageNet, we achieve up to 4.7% and 4.6% higher top-1 accuracy compared to other methods for VGG-16 and ResNet-50, respectively. These results highlight the effectiveness and practicality of our approach for enhancing DNN performance through layer-adaptive weight pruning. Code will be available on https://github.com/ Akimoto-Cris/RD_VIT_PRUNE .
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 33bb9fce-0ff2-4f6c-823c-8e095493557cCited by top-tier papers4
- AmoebaLLM: Constructing Any-Shape Large Language Models for Efficient and Instant DeploymentYonggan Fu, Zhongzhi Yu, Junwei Li, Jiayi Qian et al.NeurIPS 2024 · 15 citations
- Layer-Adaptive State Pruning for Deep State Space ModelsMinseon Gwak, Seongrok Moon, Joohwan Ko, PooGyeon ParkNeurIPS 2024 · 13 citations
- Hankel Singular Value Regularization for Highly Compressible State Space ModelsPaul Schwerdtner, Jules Berman, Benjamin PeherstorferNeurIPS 2025 · 3 citations
- AIRE-Prune: Asymptotic Impulse-Response Energy for State Pruning in State Space ModelsApurba Prasad Padhy, Fernando Camacho, Saibal MukhopadhyayICLR 2026 · 1 citation
Builds on8
- Picking Winning Tickets Before Training by Preserving Gradient FlowChaoqi Wang, Guodong Zhang, Roger B. GrosseICLR 2020 · 743 citations
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro et al.ICML 2020 · 723 citations
- Layer-adaptive Sparsity for the Magnitude-based PruningJaeho Lee, Sejun Park, Sangwoo Mo, Sungsoo Ahn et al.ICLR 2021 · 331 citations
- Dynamic Model Pruning with FeedbackTao Lin, Sebastian U. Stich, Luis Barba, Daniil Dmitriev et al.ICLR 2020 · 229 citations
- Only Train Once: A One-Shot Neural Network Training And Pruning FrameworkTianyi Chen, Bo Ji, Tianyu Ding, Biyi Fang et al.NeurIPS 2021 · 135 citations
Related papers
- Compressing Neural Networks: Towards Determining the Optimal Layer-wise DecompositionLucas Liebenwein, Alaa Maalouf, Dan Feldman, Daniela RusNeurIPS 2021 · 60 citations
- Effective Sparsification of Neural Networks With Global Sparsity ConstraintXiao Zhou, Weizhong Zhang, Hang Xu, Tong ZhangCVPR 2021
- Lookahead: A Far-sighted Alternative of Magnitude-based PruningSejun Park, Jaeho Lee, Sangwoo Mo, Jinwoo ShinICLR 2020 · 104 citations
- Auto- Train-Once: Controller Network Guided Automatic Network Pruning from ScratchXidong Wu, Shangqian Gao, Zeyu Zhang, Zhenzhen Li et al.CVPR 2024 · 13 citations
- SPDY: Accurate Pruning with Speedup GuaranteesElias Frantar, Dan AlistarhICML 2022 · 45 citations
