mlsanityData to 7 Oct 2026

Layer Collapse Can be Induced by Unstructured Pruning

arXiv 2404.16890 ↗First posted 24 Apr 2024cs.LG cs.AIcited by 4

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

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  6. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  7. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  9. 2020In Search of Lost Domain Generalizationcited by 1,042
  10. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  11. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  12. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
23 more
  1. 2020What is the State of Neural Network Pruning?cited by 578
  2. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  3. 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
  4. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  5. 2019The State of Sparsity in Deep Neural Networkscited by 471
  6. 2021CMT: Convolutional Neural Networks Meet Vision Transformerscited by 310
  7. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  8. 2021A Fourier-based Framework for Domain Generalizationcited by 287
  9. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  10. 2017An Entropy-based Pruning Method for CNN Compressioncited by 37
  11. 2022Sparse Double Descent: Where Network Pruning Aggravates Overfittingcited by 26
  12. 2023Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?cited by 20
  13. 2020LOss-Based SensiTivity rEgulaRization: towards deep sparse neural networkscited by 19
  14. 2024MLP Can Be A Good Transformer Learnercited by 16
  15. 20182PFPCE: Two-Phase Filter Pruning Based on Conditional Entropycited by 14
  16. 2021Layer Folding: Neural Network Depth Reduction using Activation Linearizationcited by 14
  17. 2021Sparse Flows: Pruning Continuous-depth Modelscited by 13
  18. 2021SeReNe: Sensitivity based Regularization of Neurons for Structured Sparsity in Neural Networkscited by 12
  19. 2021Greedy-layer Pruning: Speeding up Transformer Models for Natural Language Processingcited by 11
  20. 2016Automatic Node Selection for Deep Neural Networks using Group Lasso Regularizationcited by 7
  21. 2023DSD2: Can We Dodge Sparse Double Descent and Compress the Neural Network Worry-Free?cited by 6
  22. 2022Surrogate-assisted Multi-objective Neural Architecture Search for Real-time Semantic Segmentationcited by 5
  23. 2022Nonlinear Advantage: Trained Networks Might Not Be As Complex as You Thinkcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 2.

4 papers.