mlsanityData to 7 Oct 2026

Layer-adaptive Structured Pruning Guided by Latency

arXiv 2305.14403 ↗First posted 23 May 2023cs.CV cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Structured pruning can simplify network architecture and improve inference speed. Combined with the underlying hardware and inference engine in which the final model is deployed, better results can be obtained by using latency collaborative loss function to guide network pruning together. Existing pruning methods that optimize latency have demonstrated leading performance, however, they often overlook the hardware features and connection in the network. To address this problem, we propose a global importance score SP-LAMP(Structured Pruning Layer-Adaptive Magnitude-based Pruning) by deriving a global importance score LAMP from unstructured pruning to structured pruning. In SP-LAMP, each layer includes a filter with an SP-LAMP score of 1, and the remaining filters are grouped. We utilize a group knapsack solver to maximize the SP-LAMP score under latency constraints. In addition, we improve the strategy of collect the latency to make it more accurate. In particular, for ResNet50/ResNet18 on ImageNet and CIFAR10, SP-LAMP is 1.28x/8.45x faster with +1.7%/-1.57% top-1 accuracy changed, respectively. Experimental results in ResNet56 on CIFAR10 demonstrate that our algorithm achieves lower latency compared to alternative approaches while ensuring accuracy and FLOPs.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 66 of its 80 references that are in the map. First posted on arXiv 23 May 2023.

Builds on

66 of 80 references.

References · 66

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2020End-to-End Object Detection with Transformerscited by 7,384
  5. 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
  6. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
  7. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  8. 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
  9. 2018Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentationcited by 3,210
  10. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  11. 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
  12. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
38 more
  1. 2017ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devicescited by 1,194
  2. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  3. 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
  4. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  5. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  6. 2019Learned Step Size Quantizationcited by 604
  7. 2020What is the State of Neural Network Pruning?cited by 578
  8. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  9. 2019Importance Estimation for Neural Network Pruningcited by 531
  10. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  11. 2018FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Searchcited by 480
  12. 2013Do Deep Nets Really Need to be Deep?cited by 466
  13. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
  14. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
  15. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  16. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  17. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  18. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  19. 2020ZeroQ: A Novel Zero Shot Quantization Frameworkcited by 265
  20. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  21. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
  22. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  23. 2015Training Very Deep Networkscited by 172
  24. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  25. 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 146
  26. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
  27. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  28. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  29. 2021DENSE: Data-Free One-Shot Federated Learningcited by 100
  30. 2020APQ: Joint Search for Network Architecture, Pruning and Quantization Policycited by 98
  31. 2020Neural Pruning via Growing Regularizationcited by 97
  32. 2018The Singular Values of Convolutional Layerscited by 95
  33. 2020ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgettingcited by 85
  34. 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
  35. 2018ChamNet: Towards Efficient Network Design through Platform-Aware Model Adaptationcited by 76
  36. 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
  37. 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
  38. 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75

50 most cited of 66 All 66 (JSON)

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.