Blending Pruning Criteria for Convolutional Neural Networks
Not on the map. Why?
Abstract (arXiv)
The advancement of convolutional neural networks (CNNs) on various vision applications has attracted lots of attention. Yet the majority of CNNs are unable to satisfy the strict requirement for real-world deployment. To overcome this, the recent popular network pruning is an effective method to reduce the redundancy of the models. However, the ranking of filters according to their "importance" on different pruning criteria may be inconsistent. One filter could be important according to a certain criterion, while it is unnecessary according to another one, which indicates that each criterion is only a partial view of the comprehensive "importance". From this motivation, we propose a novel framework to integrate the existing filter pruning criteria by exploring the criteria diversity. The proposed framework contains two stages: Criteria Clustering and Filters Importance Calibration. First, we condense the pruning criteria via layerwise clustering based on the rank of "importance" score. Second, within each cluster, we propose a calibration factor to adjust their significance for each selected blending candidates and search for the optimal blending criterion via Evolutionary Algorithm. Quantitative results on the CIFAR-100 and ImageNet benchmarks show that our framework outperforms the state-of-the-art baselines, regrading to the compact model performance after pruning.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 22 of its 36 references that are in the map. First posted on arXiv 11 Jul 2021.
Builds on
22 of 36 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2017Mask R-CNNcited by 7,259
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
10 more
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2017Large-Scale Evolution of Image Classifierscited by 348
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2017An Entropy-based Pruning Method for CNN Compressioncited by 37
- 2019DIANet: Dense-and-Implicit Attention Networkcited by 37
- 2019Instance Enhancement Batch Normalization: an Adaptive Regulator of Batch Noisecited by 28
- 2020Efficient Attention Network: Accelerate Attention by Searching Where to Plugcited by 9
- 2019Pruning Deep Convolutional Neural Networks Architectures with Evolution Strategycited by 1
Built on by
Citing papers per year: 2022: 5; 2023: 2; 2024: 2; 2025: 2; 2026: 2.
13 papers.
Sort:
- 2022On Fast Simulation of Dynamical System with Neural Vector Enhanced Numerical Solvercited by 9
- 2023Understanding Self-attention Mechanism via Dynamical System Perspectivecited by 9
- 2025MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Modelscited by 7
- 2024Mirror Gradient: Towards Robust Multimodal Recommender Systems via Exploring Flat Local Minimacited by 6
- 2022Switchable Self-attention Modulecited by 4
- 2022Mix-Pooling Strategy for Attention Mechanismcited by 3
- 2023ASR: Attention-alike Structural Re-parameterizationcited by 2
- 2022Efficient Climate Simulation via Machine Learning Methodcited by 1
- 2022Causal Inference for Chatting Handoffcited by 0
- 2024Layer Pruning with Consensus: A Triple-Win Solutioncited by 0
- 2025PrunePEFT: Iterative Hybrid Pruning for Parameter-Efficient Fine-tuning of LLMscited by 0
- 2026Zipbench: Low-Cost Framework for Compressing Comprehensive Benchmarks of Large Language Modelscited by 0
- 2026Zipbench: Low-Cost Framework for Compressing Comprehensive Benchmarks of Large Language Models11 Sep 2026
- 2026FedASAP: Activation Statistics-driven Structured Adaptive Pruning for Efficient Personalized Federated Learning for Lesion Segmentation on brain MRI20 Jul 2026
- 2025PrunePEFT: Iterative Hybrid Pruning for Parameter-Efficient Fine-tuning of LLMs9 Jun 2025
- 2025MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models26 May 2025
- 2024Layer Pruning with Consensus: A Triple-Win Solution21 Nov 2024
- 2024Mirror Gradient: Towards Robust Multimodal Recommender Systems via Exploring Flat Local Minima17 Feb 2024
- 2023Understanding Self-attention Mechanism via Dynamical System Perspective19 Aug 2023
- 2023ASR: Attention-alike Structural Re-parameterization13 Apr 2023
- 2022Causal Inference for Chatting Handoff6 Oct 2022
- 2022Switchable Self-attention Module13 Sep 2022
- 2022Mix-Pooling Strategy for Attention Mechanism22 Aug 2022
- 2022Efficient Climate Simulation via Machine Learning Method15 Aug 2022
- 2022On Fast Simulation of Dynamical System with Neural Vector Enhanced Numerical Solvercited by 9
- 2023Understanding Self-attention Mechanism via Dynamical System Perspectivecited by 9
- 2025MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Modelscited by 7
- 2024Mirror Gradient: Towards Robust Multimodal Recommender Systems via Exploring Flat Local Minimacited by 6
- 2022Switchable Self-attention Modulecited by 4
- 2022Mix-Pooling Strategy for Attention Mechanismcited by 3
- 2023ASR: Attention-alike Structural Re-parameterizationcited by 2
- 2022Efficient Climate Simulation via Machine Learning Methodcited by 1
- 2022Causal Inference for Chatting Handoffcited by 0
- 2024Layer Pruning with Consensus: A Triple-Win Solutioncited by 0
- 2025PrunePEFT: Iterative Hybrid Pruning for Parameter-Efficient Fine-tuning of LLMscited by 0
- 2026Zipbench: Low-Cost Framework for Compressing Comprehensive Benchmarks of Large Language Modelscited by 0
12 most cited of 13 All 13 (JSON)
- 2026Zipbench: Low-Cost Framework for Compressing Comprehensive Benchmarks of Large Language Models11 Sep 2026
- 2026FedASAP: Activation Statistics-driven Structured Adaptive Pruning for Efficient Personalized Federated Learning for Lesion Segmentation on brain MRI20 Jul 2026
- 2025PrunePEFT: Iterative Hybrid Pruning for Parameter-Efficient Fine-tuning of LLMs9 Jun 2025
- 2025MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models26 May 2025
- 2024Layer Pruning with Consensus: A Triple-Win Solution21 Nov 2024
- 2024Mirror Gradient: Towards Robust Multimodal Recommender Systems via Exploring Flat Local Minima17 Feb 2024
- 2023Understanding Self-attention Mechanism via Dynamical System Perspective19 Aug 2023
- 2023ASR: Attention-alike Structural Re-parameterization13 Apr 2023
- 2022Causal Inference for Chatting Handoff6 Oct 2022
- 2022Switchable Self-attention Module13 Sep 2022
- 2022Mix-Pooling Strategy for Attention Mechanism22 Aug 2022
- 2022Efficient Climate Simulation via Machine Learning Method15 Aug 2022
12 newest of 13 All 13 (JSON)