mlsanityData to 14 Oct 2026

ABCP: Automatic Block-wise and Channel-wise Network Pruning via Joint Search

arXiv 2110.03858 ↗First posted 8 Oct 2021cs.CV cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Currently, an increasing number of model pruning methods are proposed to resolve the contradictions between the computer powers required by the deep learning models and the resource-constrained devices. However, most of the traditional rule-based network pruning methods can not reach a sufficient compression ratio with low accuracy loss and are time-consuming as well as laborious. In this paper, we propose Automatic Block-wise and Channel-wise Network Pruning (ABCP) to jointly search the block-wise and channel-wise pruning action with deep reinforcement learning. A joint sample algorithm is proposed to simultaneously generate the pruning choice of each residual block and the channel pruning ratio of each convolutional layer from the discrete and continuous search space respectively. The best pruning action taking both the accuracy and the complexity of the model into account is obtained finally. Compared with the traditional rule-based pruning method, this pipeline saves human labor and achieves a higher compression ratio with lower accuracy loss. Tested on the mobile robot detection dataset, the pruned YOLOv3 model saves 99.5% FLOPs, reduces 99.5% parameters, and achieves 37.3 times speed up with only 2.8% mAP loss. The results of the transfer task on the sim2real detection dataset also show that our pruned model has much better robustness performance.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 27 of its 49 references that are in the map. First posted on arXiv 8 Oct 2021.

Builds on

27 of 49 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  3. 2018YOLOv3: An Incremental Improvementcited by 2,659
  4. 2020YOLOv4: Optimal Speed and Accuracy of Object Detectioncited by 1,630
  5. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  6. 2018Efficient Neural Architecture Search via Parameter Sharingcited by 837
  7. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
  8. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  9. 2018Learning to Adapt Structured Output Space for Semantic Segmentationcited by 584
  10. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
  11. 2018Slimmable Neural Networkscited by 305
  12. 2016Designing Neural Network Architectures using Reinforcement Learningcited by 279
15 more
  1. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
  2. 2017State-of-the-art Speech Recognition With Sequence-to-Sequence Modelscited by 196
  3. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  4. 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
  5. 2020Channel Pruning via Automatic Structure Searchcited by 85
  6. 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
  7. 2020DMCP: Differentiable Markov Channel Pruning for Neural Networkscited by 69
  8. 2019AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Ratescited by 49
  9. 2020Heuristic Rank Selection with Progressively Searching Tensor Ring Networkcited by 28
  10. 2018Asymptotic Soft Filter Pruning for Deep Convolutional Neural Networkscited by 27
  11. 2019SlimYOLOv3: Narrower, Faster and Better for Real-Time UAV Applicationscited by 21
  12. 2020ModuleNet: Knowledge-inherited Neural Architecture Searchcited by 11
  13. 2020BiFNet: Bidirectional Fusion Network for Road Segmentationcited by 8
  14. 2020Conditional Automated Channel Pruning for Deep Neural Networkscited by 5
  15. 2021AACP: Model Compression by Accurate and Automatic Channel Pruningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

4 papers.