Ensemble Knowledge Guided Sub-network Search and Fine-tuning for Filter Pruning
Not on the map. Why?
Abstract (arXiv)
Conventional NAS-based pruning algorithms aim to find the sub-network with the best validation performance. However, validation performance does not successfully represent test performance, i.e., potential performance. Also, although fine-tuning the pruned network to restore the performance drop is an inevitable process, few studies have handled this issue. This paper provides a novel Ensemble Knowledge Guidance (EKG) to solve both problems at once. First, we experimentally prove that the fluctuation of loss landscape can be an effective metric to evaluate the potential performance. In order to search a sub-network with the smoothest loss landscape at a low cost, we employ EKG as a search reward. EKG utilized for the following search iteration is composed of the ensemble knowledge of interim sub-networks, i.e., the by-products of the sub-network evaluation. Next, we reuse EKG to provide a gentle and informative guidance to the pruned network while fine-tuning the pruned network. Since EKG is implemented as a memory bank in both phases, it requires a negligible cost. For example, when pruning and training ResNet-50, just 315 GPU hours are required to remove around 45.04% of FLOPS without any performance degradation, which can operate even on a low-spec workstation. the implemented code is available at https://github.com/sseung0703/EKG.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 37 of its 54 references that are in the map. First posted on arXiv 5 Mar 2022.
Builds on
37 of 54 references.
References · 37
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 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
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2019Improved Knowledge Distillation via Teacher Assistantcited by 567
25 more
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018How Does Batch Normalization Help Optimization?cited by 355
- 2018Slimmable Neural Networkscited by 301
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2019Billion-scale semi-supervised learning for image classificationcited by 232
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 219
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2018A Closer Look at Deep Learning Heuristics: Learning rate restarts, Warmup and Distillationcited by 110
- 2019Multilingual Neural Machine Translation with Knowledge Distillationcited by 95
- 2020ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgettingcited by 85
- 2020Channel Pruning via Automatic Structure Searchcited by 84
- 2020Understanding and Improving Knowledge Distillationcited by 83
- 2019Network Pruning via Transformable Architecture Searchcited by 80
- 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
- 2021Convolutional Neural Network Pruning with Structural Redundancy Reductioncited by 73
- 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
- 2020DMCP: Differentiable Markov Channel Pruning for Neural Networkscited by 68
- 2020DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocationcited by 47
- 2021Manifold Regularized Dynamic Network Pruningcited by 43
- 2021GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarizationcited by 29
- 2021Locally Free Weight Sharing for Network Width Searchcited by 27
- 2021BCNet: Searching for Network Width with Bilaterally Coupled Networkcited by 23
Built on by
Citing papers per year: 2023: 2; 2024: 3.
5 papers.
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2024Effective Layer Pruning Through Similarity Metric Perspectivecited by 6
- 2024REPrune: Channel Pruning via Kernel Representative Selectioncited by 4
- 2023Efficient Model-Based Deep Learning via Network Pruning and Fine-Tuningcited by 2
- 2024Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedurecited by 1
- 2024Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure6 Jun 2024
- 2024Effective Layer Pruning Through Similarity Metric Perspective27 May 2024
- 2024REPrune: Channel Pruning via Kernel Representative Selection27 Feb 2024
- 2023Efficient Model-Based Deep Learning via Network Pruning and Fine-Tuning3 Nov 2023
- 2023Structured Pruning for Deep Convolutional Neural Networks: A survey1 Mar 2023