mlsanityData to 14 Oct 2026

Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?

arXiv 2308.06619 ↗First posted 12 Aug 2023cs.LG cs.AIcited by 20

Not on the map. Why?

Abstract (arXiv)

Pruning is a widely used technique for reducing the size of deep neural networks while maintaining their performance. However, such a technique, despite being able to massively compress deep models, is hardly able to remove entire layers from a model (even when structured): is this an addressable task? In this study, we introduce EGP, an innovative Entropy Guided Pruning algorithm aimed at reducing the size of deep neural networks while preserving their performance. The key focus of EGP is to prioritize pruning connections in layers with low entropy, ultimately leading to their complete removal. Through extensive experiments conducted on popular models like ResNet-18 and Swin-T, our findings demonstrate that EGP effectively compresses deep neural networks while maintaining competitive performance levels. Our results not only shed light on the underlying mechanism behind the advantages of unstructured pruning, but also pave the way for further investigations into the intricate relationship between entropy, pruning techniques, and deep learning performance. The EGP algorithm and its insights hold great promise for advancing the field of network compression and optimization. The source code for EGP is released open-source.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). Builds on 18 of its 28 references that are in the map. First posted on arXiv 12 Aug 2023.

Builds on

18 of 28 references.

References · 18

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  3. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  4. 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 815
  5. 2015Variational Dropout and the Local Reparameterization Trickcited by 490
  6. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  7. 2019Quantization Networkscited by 153
  8. 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
  9. 2022Anomaly Detection in Autonomous Driving: A Surveycited by 87
  10. 2022Revisiting Random Channel Pruning for Neural Network Compressioncited by 50
  11. 2022Packed-Ensembles for Efficient Uncertainty Estimationcited by 49
  12. 2017An Entropy-based Pruning Method for CNN Compressioncited by 37
6 more
  1. 2022Sparse Double Descent: Where Network Pruning Aggravates Overfittingcited by 26
  2. 2020LOss-Based SensiTivity rEgulaRization: towards deep sparse neural networkscited by 19
  3. 20182PFPCE: Two-Phase Filter Pruning Based on Conditional Entropycited by 14
  4. 2022The rise of the lottery heroes: why zero-shot pruning is hardcited by 7
  5. 2021HEMP: High-order Entropy Minimization for neural network comPressioncited by 4
  6. 2022Towards Efficient Capsule Networkscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 6; 2025: 10; 2026: 4.

20 papers.

Sort:

By area:

  1. 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruningcited by 26
  2. 2024A Survey of Lottery Ticket Hypothesiscited by 24
  3. 2025The Right to be Forgotten in Pruning: Unveil Machine Unlearning on Sparse Modelscited by 7
  4. 2024Layer Collapse Can be Induced by Unstructured Pruningcited by 4
  5. 2024The Simpler The Better: An Entropy-Based Importance Metric To Reduce Neural Networks' Depthcited by 3
  6. 20243D Point Cloud Network Pruning: When Some Weights Do not Mattercited by 3
  7. 2024TOAST: Transformer Optimization using Adaptive and Simple Transformationscited by 3
  8. 2025When Does Pruning Benefit Vision Representations?cited by 3
  9. 2024LaCoOT: Layer Collapse through Optimal Transportcited by 1
  10. 2025NoWag: A Unified Framework for Shape Preserving Compression of Large Language Modelscited by 1
  11. 2026Routing the Lottery: Adaptive Subnetworks for Heterogeneous Datacited by 1
  12. 2025NuWa: Deriving Lightweight Class-Specific Vision Transformers for Edge Devicescited by 0
8 more
  1. 2025RanDeS: Randomized Delta Superposition for Multi-Model Compressioncited by 0
  2. 2025Towards Universal & Efficient Model Compression via Exponential Torque Pruningcited by 0
  3. 2025Beyond topography: Topographic regularization improves robustness and reshapes representations in convolutional neural networkscited by 0
  4. 2025Pruning and Quantization Impact on Graph Neural Networkscited by 0
  5. 2025Teacher-Guided One-Shot Pruning via Context-Aware Knowledge Distillationcited by 0
  6. 2026Joint Routing and Model Pruning for Decentralized Federated Learning in Bandwidth-Constrained Multi-Hop Wireless Networkscited by 0
  7. 2026CutClean: Neural Network Pruning for Privacy-Preserving Inferencecited by 0
  8. 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategycited by 0