ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations
Not on the map. Why?
Abstract (arXiv)
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 feature-rich teacher dataset provide better performance on the student dataset than those obtained by directly pruning on the student data itself.
Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 26 of its 37 references that are in the map. First posted on arXiv 14 Feb 2021.
Builds on
26 of 37 references.
References · 26
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Wide Residual Networkscited by 3,057
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2016Identity Mappings in Deep Residual Networkscited by 1,960
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2018Rethinking the Value of Network Pruningcited by 595
14 more
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2013Predicting Parameters in Deep Learningcited by 223
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
- 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 189
- 2017MorphNet: Fast & Simple Resource-Constrained Structure Learning of Deep Networkscited by 92
- 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
- 2016Learning the Number of Neurons in Deep Networkscited by 69
- 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
- 2017Compression-aware Training of Deep Networkscited by 46
- 2018Structured Pruning of Neural Networks with Budget-Aware Regularizationcited by 26
Built on by
Citing papers per year: 2021: 4; 2022: 6; 2023: 8; 2024: 2; 2025: 1.
21 papers.
Sort:
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
- 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
- 2023NOLA: Compressing LoRA using Linear Combination of Random Basiscited by 28
- 2021Layer Folding: Neural Network Depth Reduction using Activation Linearizationcited by 14
- 2023GOHSP: A Unified Framework of Graph and Optimization-based Heterogeneous Structured Pruning for Vision Transformercited by 10
- 2023Differentiable Transportation Pruningcited by 10
- 2024MCNC: Manifold-Constrained Reparameterization for Neural Compressioncited by 4
- 2021Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)cited by 3
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learningcited by 2
- 2023Filter Pruning based on Information Capacity and Independencecited by 2
9 more
- 2024Surgical Feature-Space Decomposition of LLMs: Why, When and How?cited by 2
- 2025B-FPGM: Lightweight Face Detection via Bayesian-Optimized Soft FPGM Pruningcited by 2
- 2022Dynamic Channel Selection in Self-Supervised Learningcited by 1
- 2022On Designing Light-Weight Object Trackers through Network Pruning: Use CNNs or Transformers?cited by 1
- 2023Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programmingcited by 1
- 2022PRANC: Pseudo RAndom Networks for Compacting deep modelscited by 0
- 2022Partial Binarization of Neural Networks for Budget-Aware Efficient Learningcited by 0
- 2023Unifying Synergies between Self-supervised Learning and Dynamic Computationcited by 0
- 2023A Generalization of Continuous Relaxation in Structured Pruningcited by 0
- 2025B-FPGM: Lightweight Face Detection via Bayesian-Optimized Soft FPGM Pruning28 Jan 2025
- 2024MCNC: Manifold-Constrained Reparameterization for Neural Compression27 Jun 2024
- 2024Surgical Feature-Space Decomposition of LLMs: Why, When and How?17 May 2024
- 2023NOLA: Compressing LoRA using Linear Combination of Random Basis4 Oct 2023
- 2023A Generalization of Continuous Relaxation in Structured Pruning28 Aug 2023
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations13 Aug 2023
- 2023Differentiable Transportation Pruning17 Jul 2023
- 2023Filter Pruning based on Information Capacity and Independence7 Mar 2023
- 2023Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming28 Jan 2023
- 2023Unifying Synergies between Self-supervised Learning and Dynamic Computation22 Jan 2023
- 2023GOHSP: A Unified Framework of Graph and Optimization-based Heterogeneous Structured Pruning for Vision Transformer13 Jan 2023
- 2022On Designing Light-Weight Object Trackers through Network Pruning: Use CNNs or Transformers?24 Nov 2022
9 more
- 2022Partial Binarization of Neural Networks for Budget-Aware Efficient Learning12 Nov 2022
- 2022Structural Pruning via Latency-Saliency Knapsack13 Oct 2022
- 2022Dynamic Channel Selection in Self-Supervised Learning25 Jul 2022
- 2022PRANC: Pseudo RAndom Networks for Compacting deep models16 Jun 2022
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learning3 Jun 2022
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networks26 Oct 2021
- 2021Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)1 Oct 2021
- 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition23 Jul 2021
- 2021Layer Folding: Neural Network Depth Reduction using Activation Linearization17 Jun 2021
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
- 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
- 2023NOLA: Compressing LoRA using Linear Combination of Random Basiscited by 28
- 2021Layer Folding: Neural Network Depth Reduction using Activation Linearizationcited by 14
- 2023GOHSP: A Unified Framework of Graph and Optimization-based Heterogeneous Structured Pruning for Vision Transformercited by 10
- 2023Differentiable Transportation Pruningcited by 10
- 2024MCNC: Manifold-Constrained Reparameterization for Neural Compressioncited by 4
- 2021Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)cited by 3
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learningcited by 2
- 2023Filter Pruning based on Information Capacity and Independencecited by 2
12 most cited of 21 All 21 (JSON)
- 2025B-FPGM: Lightweight Face Detection via Bayesian-Optimized Soft FPGM Pruning28 Jan 2025
- 2024MCNC: Manifold-Constrained Reparameterization for Neural Compression27 Jun 2024
- 2024Surgical Feature-Space Decomposition of LLMs: Why, When and How?17 May 2024
- 2023NOLA: Compressing LoRA using Linear Combination of Random Basis4 Oct 2023
- 2023A Generalization of Continuous Relaxation in Structured Pruning28 Aug 2023
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations13 Aug 2023
- 2023Differentiable Transportation Pruning17 Jul 2023
- 2023Filter Pruning based on Information Capacity and Independence7 Mar 2023
- 2023Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming28 Jan 2023
- 2023Unifying Synergies between Self-supervised Learning and Dynamic Computation22 Jan 2023
- 2023GOHSP: A Unified Framework of Graph and Optimization-based Heterogeneous Structured Pruning for Vision Transformer13 Jan 2023
- 2022On Designing Light-Weight Object Trackers through Network Pruning: Use CNNs or Transformers?24 Nov 2022
12 newest of 21 All 21 (JSON)