mlsanityData to 7 Oct 2026

Resource Efficient Neural Networks Using Hessian Based Pruning

arXiv 2306.07030 ↗First posted 12 Jun 2023cs.CV cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Neural network pruning is a practical way for reducing the size of trained models and the number of floating-point operations. One way of pruning is to use the relative Hessian trace to calculate sensitivity of each channel, as compared to the more common magnitude pruning approach. However, the stochastic approach used to estimate the Hessian trace needs to iterate over many times before it can converge. This can be time-consuming when used for larger models with many millions of parameters. To address this problem, we modify the existing approach by estimating the Hessian trace using FP16 precision instead of FP32. We test the modified approach (EHAP) on ResNet-32/ResNet-56/WideResNet-28-8 trained on CIFAR10/CIFAR100 image classification tasks and achieve faster computation of the Hessian trace. Specifically, our modified approach can achieve speed ups ranging from 17% to as much as 44% during our experiments on different combinations of model architectures and GPU devices. Our modified approach also takes up around 40% less GPU memory when pruning ResNet-32 and ResNet-56 models, which allows for a larger Hessian batch size to be used for estimating the Hessian trace. Meanwhile, we also present the results of pruning using both FP16 and FP32 Hessian trace calculation and show that there are no noticeable accuracy differences between the two. Overall, it is a simple and effective way to compute the relative Hessian trace faster without sacrificing on pruned model performance. We also present a full pipeline using EHAP and quantization aware training (QAT), using INT8 QAT to compress the network further after pruning. In particular, we use symmetric quantization for the weights and asymmetric quantization for the activations.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 35 of its 51 references that are in the map. First posted on arXiv 12 Jun 2023.

Builds on

35 of 51 references.

References · 35

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  3. 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
  4. 2021Scaling Vision Transformerscited by 993
  5. 2018Efficient Neural Architecture Search via Parameter Sharingcited by 831
  6. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  7. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  8. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  9. 2020What is the State of Neural Network Pruning?cited by 578
  10. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  11. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  12. 2021A White Paper on Neural Network Quantizationcited by 453
23 more
  1. 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 427
  2. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 298
  3. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
  4. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
  5. 2020Dynamic Model Pruning with Feedbackcited by 125
  6. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  7. 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
  8. 2015Data-free parameter pruning for Deep Neural Networkscited by 112
  9. 2019Winning the Lottery with Continuous Sparsificationcited by 99
  10. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  11. 2020Neural Pruning via Growing Regularizationcited by 97
  12. 2020Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layerscited by 66
  13. 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
  14. 2020Lookahead: A Far-Sighted Alternative of Magnitude-based Pruningcited by 61
  15. 2020HAWQV3: Dyadic Neural Network Quantizationcited by 59
  16. 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 58
  17. 2021Hessian-Aware Pruning and Optimal Neural Implantcited by 43
  18. 2017N2N Learning: Network to Network Compression via Policy Gradient Reinforcement Learningcited by 33
  19. 2022Post-training Quantization for Neural Networks with Provable Guaranteescited by 32
  20. 2018Accelerator-Aware Pruning for Convolutional Neural Networkscited by 22
  21. 2015Dynamic Capacity Networkscited by 16
  22. 2022Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruningcited by 13
  23. 2020A Real-time Action Representation with Temporal Encoding and Deep Compressioncited by 5

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.