mlsanityData to 7 Oct 2026

DRIVE: Dual Gradient-Based Rapid Iterative Pruning

arXiv 2404.03687 ↗First posted 1 Apr 2024cs.LG cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Modern deep neural networks (DNNs) consist of millions of parameters, necessitating high-performance computing during training and inference. Pruning is one solution that significantly reduces the space and time complexities of DNNs. Traditional pruning methods that are applied post-training focus on streamlining inference, but there are recent efforts to leverage sparsity early on by pruning before training. Pruning methods, such as iterative magnitude-based pruning (IMP) achieve up to a 90% parameter reduction while retaining accuracy comparable to the original model. However, this leads to impractical runtime as it relies on multiple train-prune-reset cycles to identify and eliminate redundant parameters. In contrast, training agnostic early pruning methods, such as SNIP and SynFlow offer fast pruning but fall short of the accuracy achieved by IMP at high sparsities. To bridge this gap, we present Dual Gradient-Based Rapid Iterative Pruning (DRIVE), which leverages dense training for initial epochs to counteract the randomness inherent at the initialization. Subsequently, it employs a unique dual gradient-based metric for parameter ranking. It has been experimentally demonstrated for VGG and ResNet architectures on CIFAR-10/100 and Tiny ImageNet, and ResNet on ImageNet that DRIVE consistently has superior performance over other training-agnostic early pruning methods in accuracy. Notably, DRIVE is 43× to 869× faster than IMP for pruning.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 1 Apr 2024.

Builds on

28 of 44 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  5. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,242
  6. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  7. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  8. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  9. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  10. 2020What is the State of Neural Network Pruning?cited by 578
  11. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  12. 2019The State of Sparsity in Deep Neural Networkscited by 471
16 more
  1. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  2. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  3. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  4. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  5. 2019Model Pruning Enables Efficient Federated Learning on Edge Devicescited by 219
  6. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  7. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  8. 2020Dynamic Model Pruning with Feedbackcited by 125
  9. 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
  10. 2019Fast Sparse ConvNetscited by 86
  11. 2016Learning the Number of Neurons in Deep Networkscited by 69
  12. 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
  13. 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
  14. 2019Stabilizing the Lottery Ticket Hypothesiscited by 36
  15. 2021SparseDNN: Fast Sparse Deep Learning Inference on CPUscited by 13
  16. 2018Pre-Defined Sparse Neural Networks with Hardware Accelerationcited by 9

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.