Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining
Not on the map. Why?
Abstract (arXiv)
A challenge of channel pruning is designing efficient and effective criteria to select channels to prune. A widely used criterion is minimal performance degeneration. To accurately evaluate the truth performance degeneration requires retraining the survived weights to convergence, which is prohibitively slow. Hence existing pruning methods use previous weights (without retraining) to evaluate the performance degeneration. However, we observe the loss changes differ significantly with and without retraining. It motivates us to develop a technique to evaluate true loss changes without retraining, with which channels to prune can be selected more reliably and confidently. We first derive a closed-form estimator of the true loss change per pruning mask change, using influence functions without retraining. Influence function which is from robust statistics reveals the impacts of a training sample on the model's prediction and is repurposed by us to assess impacts on true loss changes. We then show how to assess the importance of all channels simultaneously and develop a novel global channel pruning algorithm accordingly. We conduct extensive experiments to verify the effectiveness of the proposed algorithm. To the best of our knowledge, we are the first that shows evaluating true loss changes for pruning without retraining is possible. This finding will open up opportunities for a series of new paradigms to emerge that differ from existing pruning methods. The code is available at https://github.com/hrcheng1066/IFSO.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 60 of its 83 references that are in the map. First posted on arXiv 13 Aug 2023.
Builds on
60 of 83 references.
References · 60
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
38 more
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 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
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 303
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2020Channel-wise Knowledge Distillation for Dense Predictioncited by 161
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2022Natural Language Descriptions of Deep Visual Featurescited by 136
- 2021Group Fisher Pruning for Practical Network Compressioncited by 130
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
- 2019On Second-Order Group Influence Functions for Black-Box Predictionscited by 78
- 2021Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimizationcited by 75
- 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
- 2019Pruning from Scratchcited by 72
- 2022Knowledge Distillation via the Target-aware Transformercited by 70
- 2017More is Less: A More Complicated Network with Less Inference Complexitycited by 66
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 55
- 2019Neural Network Pruning with Residual-Connections and Limited-Datacited by 52
- 2021iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradientscited by 51
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2021Towards Compact CNNs via Collaborative Compressioncited by 36
- 2021Preventing Catastrophic Forgetting and Distribution Mismatch in Knowledge Distillation via Synthetic Datacited by 32
- 2021SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruningcited by 30
- 2022Sparse Double Descent: Where Network Pruning Aggravates Overfittingcited by 26
- 2022Training Your Sparse Neural Network Better with Any Maskcited by 26
50 most cited of 60 All 60 (JSON)
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Benchmarking Post-Training Quantization in LLMs: Comprehensive Taxonomy, Unified Evaluation, and Comparative Analysiscited by 12
- 2025Optimal Brain Connection: Towards Efficient Structural Pruningcited by 3
- 2025MGAA: Multi-Granular Adaptive Allocation fof Low-Rank Compression of LLMscited by 0
- 2026InterPruner: Interactive Structured Pruning via Taylor-Implicit Criterion and Language-Prior Modulator for Multimodal Object Detectioncited by 0
- 2026InterPruner: Interactive Structured Pruning via Taylor-Implicit Criterion and Language-Prior Modulator for Multimodal Object Detection11 Aug 2026
- 2025Optimal Brain Connection: Towards Efficient Structural Pruning7 Aug 2025
- 2025MGAA: Multi-Granular Adaptive Allocation fof Low-Rank Compression of LLMs4 Jul 2025
- 2025Benchmarking Post-Training Quantization in LLMs: Comprehensive Taxonomy, Unified Evaluation, and Comparative Analysis18 Feb 2025