Layer Pruning with Consensus: A Triple-Win Solution
Not on the map. Why?
Abstract (arXiv)
Layer pruning offers a promising alternative to standard structured pruning, effectively reducing computational costs, latency, and memory footprint. While notable layer-pruning approaches aim to detect unimportant layers for removal, they often rely on single criteria that may not fully capture the complex, underlying properties of layers. We propose a novel approach that combines multiple similarity metrics into a single expressive measure of low-importance layers, called the Consensus criterion. Our technique delivers a triple-win solution: low accuracy drop, high-performance improvement, and increased robustness to adversarial attacks. With up to 78.80% FLOPs reduction and performance on par with state-of-the-art methods across different benchmarks, our approach reduces energy consumption and carbon emissions by up to 66.99% and 68.75%, respectively. Additionally, it avoids shortcut learning and improves robustness by up to 4 percentage points under various adversarial attacks. Overall, the Consensus criterion demonstrates its effectiveness in creating robust, efficient, and environmentally friendly pruned models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 54 of its 73 references that are in the map. First posted on arXiv 21 Nov 2024.
Builds on
54 of 73 references.
References · 54
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2020Shortcut Learning in Deep Neural Networkscited by 1,969
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2016Deep Networks with Stochastic Depthcited by 979
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2019Green AIcited by 627
- 2019Quantifying the Carbon Emissions of Machine Learningcited by 521
- 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
38 more
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
- 2021PixMix: Dreamlike Pictures Comprehensively Improve Safety Measurescited by 131
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2021Generalized Shape Metrics on Neural Representationscited by 112
- 2022MobileOne: An Improved One millisecond Mobile Backbonecited by 109
- 2021The Efficiency Misnomercited by 98
- 2019Are All Layers Created Equal?cited by 94
- 2022Head2Toe: Utilizing Intermediate Representations for Better Transfer Learningcited by 83
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
- 2023LLMCarbon: Modeling the end-to-end Carbon Footprint of Large Language Modelscited by 72
- 2023On the Foundations of Shortcut Learningcited by 65
- 2019The Generalization-Stability Tradeoff In Neural Network Pruningcited by 54
- 2021Recent Advances on Neural Network Pruning at Initializationcited by 41
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 41
- 2023The Tunnel Effect: Building Data Representations in Deep Neural Networkscited by 34
- 2020Convolution-Weight-Distribution Assumption: Rethinking the Criteria of Channel Pruningcited by 30
- 2021Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learningcited by 30
- 2021SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruningcited by 30
- 2021DECORE: Deep Compression with Reinforcement Learningcited by 29
- 2020Auto Graph Encoder-Decoder for Neural Network Pruningcited by 26
- 2021On the Effect of Pruning on Adversarial Robustnesscited by 23
- 2021Carrying out CNN Channel Pruning in a White Boxcited by 22
- 2023ImageNet-OOD: Deciphering Modern Out-of-Distribution Detection Algorithmscited by 22
- 2020DAIS: Automatic Channel Pruning via Differentiable Annealing Indicator Searchcited by 21
- 2024Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratchcited by 20
- 2022DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networkscited by 19
- 2022Representational dissimilarity metric spaces for stochastic neural networkscited by 17
- 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
- 2022Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filterscited by 16
- 2021Layer Folding: Neural Network Depth Reduction using Activation Linearizationcited by 14
- 2022Can pruning improve certified robustness of neural networks?cited by 14
- 2021Blending Pruning Criteria for Convolutional Neural Networkscited by 13
- 2024UPDP: A Unified Progressive Depth Pruner for CNN and Vision Transformercited by 9
- 2024Jointly Training and Pruning CNNs via Learnable Agent Guidance and Alignmentcited by 9
50 most cited of 54 All 54 (JSON)
Built on by
Not cited yet.