ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations
Rishabh Tiwari, Udbhav Bamba, Arnav Chavan, Deepak K. Gupta
摘要
Structured pruning methods are among the effective strategies for extracting small resource-efficient convolutional neural networks from their dense counterparts with minimal loss in accuracy. However, most existing methods still suffer from one or more limitations, that include 1) the need for training the dense model from scratch with pruning-related parameters embedded in the architecture, 2) requiring model-specific hyperparameter settings, 3) inability to include budget-related constraint in the training process, and 4) instability under scenarios of extreme pruning. In this paper, we present ChipNet, a deterministic pruning strategy that employs continuous Heaviside function and a novel crispness loss to identify a highly sparse network out of an existing dense network. Our choice of continuous Heaviside function is inspired by the field of design optimization, where the material distribution task is posed as a continuous optimization problem, but only discrete values (0 or 1) are practically feasible and expected as final outcomes. Our approach's flexible design facilitates its use with different choices of budget constraints while maintaining stability for very low target budgets. Experimental results show that ChipNet outperforms state-of-the-art structured pruning methods by remarkable margins of up to 16.1% in terms of accuracy. Further, we show that the masks obtained with ChipNet are transferable across datasets. For certain cases, it was observed that masks transferred from a model trained on featurerich teacher dataset provide better performance on the student dataset than those obtained by directly pruning on the student data itself. 1
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper9
- CHIP: CHannel Independence-based Pruning for Compact Neural NetworksYang Sui, Miao Yin, Yi Xie, Huy Phan 等NeurIPS 2021 · 被引用 198 次
- Structural Pruning via Latency-Saliency KnapsackMaying Shen, Hongxu Yin, Pavlo Molchanov, Lei Mao 等NeurIPS 2022 · 被引用 70 次
- Compressing Neural Networks: Towards Determining the Optimal Layer-wise DecompositionLucas Liebenwein, Alaa Maalouf, Dan Feldman, Daniela RusNeurIPS 2021 · 被引用 60 次
- GOHSP: A Unified Framework of Graph and Optimization-Based Heterogeneous Structured Pruning for Vision TransformerMiao Yin, Burak Uzkent, Yilin Shen, Hongxia Jin 等AAAI 2023 · 被引用 23 次
- Differentiable Transportation PruningYunqiang Li, Jan C. van Gemert, Torsten Hoefler, Bert Moons 等ICCV 2023 · 被引用 17 次
相关 Paper
- Discrete Model Compression With Resource Constraint for Deep Neural NetworksShangqian Gao, Feihu Huang, Jian Pei, Heng HuangCVPR 2020
- DPFPS: Dynamic and Progressive Filter Pruning for Compressing Convolutional Neural Networks from ScratchXiaofeng Ruan, Yufan Liu, Bing Li, Chunfeng Yuan 等AAAI 2021 · 被引用 49 次
- DMCP: Differentiable Markov Channel Pruning for Neural NetworksShaopeng Guo, Yujie Wang, Quanquan Li, Junjie YanCVPR 2020
- Pruning from ScratchYulong Wang, Xiaolu Zhang, Lingxi Xie, Jun Zhou 等AAAI 2020 · 被引用 219 次
- Winning the Lottery with Continuous SparsificationPedro Savarese, Hugo Silva, Michael MaireNeurIPS 2020 · 被引用 162 次
