Layer Collapse Can be Induced by Unstructured Pruning
Not on the map. Why?
Abstract (arXiv)
Unstructured pruning is a popular compression method for efficiently reducing model parameters. However, while it effectively decreases the number of parameters, it is commonly believed that unstructured pruning cannot shorten the computational critical path, i.e., the maximum number of layers traversed during forward propagation. In this paper, we study when and how unstructured pruning can yield structural effects. For rectifier-activated networks, we introduce the notion of neuron entropy, which quantifies the degree of nonlinearity utilization. We show that magnitude-based pruning naturally lowers this entropy, sometimes down to zero-entropy layers that become linearizable and can thus be removed. Building on this insight, we propose a method that leverages "unstructured" pruning to favor sparsity in low-entropy layers, enabling their complete removal. We validate the phenomenon across CNNs, Vision Transformers, and NLP models: unstructured pruning can induce effective layer removal with little or no performance degradation in over-parameterized networks.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 35 of its 49 references that are in the map. First posted on arXiv 24 Apr 2024.
Builds on
35 of 49 references.
References · 35
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
23 more
- 2020What is the State of Neural Network Pruning?cited by 578
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2021CMT: Convolutional Neural Networks Meet Vision Transformerscited by 310
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2021A Fourier-based Framework for Domain Generalizationcited by 287
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2017An Entropy-based Pruning Method for CNN Compressioncited by 37
- 2022Sparse Double Descent: Where Network Pruning Aggravates Overfittingcited by 26
- 2023Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?cited by 20
- 2020LOss-Based SensiTivity rEgulaRization: towards deep sparse neural networkscited by 19
- 2024MLP Can Be A Good Transformer Learnercited by 16
- 20182PFPCE: Two-Phase Filter Pruning Based on Conditional Entropycited by 14
- 2021Layer Folding: Neural Network Depth Reduction using Activation Linearizationcited by 14
- 2021Sparse Flows: Pruning Continuous-depth Modelscited by 13
- 2021SeReNe: Sensitivity based Regularization of Neurons for Structured Sparsity in Neural Networkscited by 12
- 2021Greedy-layer Pruning: Speeding up Transformer Models for Natural Language Processingcited by 11
- 2016Automatic Node Selection for Deep Neural Networks using Group Lasso Regularizationcited by 7
- 2023DSD2: Can We Dodge Sparse Double Descent and Compress the Neural Network Worry-Free?cited by 6
- 2022Surrogate-assisted Multi-objective Neural Architecture Search for Real-time Semantic Segmentationcited by 5
- 2022Nonlinear Advantage: Trained Networks Might Not Be As Complex as You Thinkcited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 2.
4 papers.
- 2026FlexLoRA: Entropy-Guided Flexible Low-Rank Adaptationcited by 3
- 2025Entropy-Based Block Pruning for Efficient Large Language Modelscited by 2
- 2024LaCoOT: Layer Collapse through Optimal Transportcited by 1
- 2026Pre-registered tests of solid-state-physics-inspired LLM compression: a cluster-level negative result at small-language-model scalecited by 0
- 2026Pre-registered tests of solid-state-physics-inspired LLM compression: a cluster-level negative result at small-language-model scale28 Sep 2026
- 2026FlexLoRA: Entropy-Guided Flexible Low-Rank Adaptation30 Jan 2026
- 2025Entropy-Based Block Pruning for Efficient Large Language Models4 Apr 2025
- 2024LaCoOT: Layer Collapse through Optimal Transport13 Jun 2024