The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Structured Pruning of Deep Convolutional Neural Networks
Abstract
Real-time application of deep learning algorithms is often hindered by high computational complexity and frequent memory accesses. Network pruning is a promising technique to solve this problem. However, pruning usually results in irregular network connections that not only demand extra representation efforts but also do not fit well on parallel computation. We introduce structured sparsity at various scales for convolutional neural networks: feature map-wise, kernel-wise, and intra-kernel strided sparsity. This structured sparsity is very advantageous for direct computational resource savings on embedded computers, in parallel computing environments, and in hardware-based systems. To decide the importance of network connections and paths, the proposed method uses a particle filtering approach. The importance weight of each particle is assigned by assessing the misclassification rate with a corresponding connectivity pattern. The pruned network is retrained to compensate for the losses due to pruning. While implementing convolutions as matrix products, we particularly show that intra-kernel strided sparsity with a simple constraint can significantly reduce the size of the kernel and feature map tensors. The proposed work shows that when pruning granularities are applied in combination, we can prune the CIFAR-10 network by more than 70% with less than a 1% loss in accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Very Deep Convolutional Networks for Large-Scale Image Recognition
Simonyan, K., & Zisserman, A. (2014) · arXiv · doi:10.48550/arxiv.1409.1556 · Cited by 114,148
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
(2014) · Cited by 33,419
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S. (2024) · arXiv (Cornell University) · doi:10.57702/o9raffed · Cited by 14,214
A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking
Arulampalam, M. S., Maskell, S., Gordon, N., & Clapp, T. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.978374 · Cited by 11,502
Hinton, G., Deng, L., Yu, D., Dahl, G., Mohamed, A.-R., Jaitly, N., Senior, A., Vanhoucke, V., Nguyen, P., Sainath, T., et al. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2205597 · Cited by 10,260
Novel approach to nonlinear/non-Gaussian Bayesian state estimation
Gordon, N. J., Salmond, D. J., & Smith, A. F. M. (1993) · IEE Proceedings F Radar and Signal Processing · doi:10.1049/ip-f-2.1993.0015 · Cited by 7,550
Reading digits in natural images with unsupervised feature learning
Netzer, Y. (2024) · doi:10.57702/e7wwo0zk · Cited by 4,149
Research works printed but not linked: 6
- Song Han Jeff Pool John Tran and William Dally. 2015b. Learning both weights and connections for efficient neural network. Advances in Neural Information Processing Systems. 1135--1143. Song Han Jeff Pool John Tran and William Dally. 2015b. Learning both weights and connections for efficient neural network. Advances in Neural Information Processing Systems. 1135--1143.
- 10.1109/IROS.2005.1545119 · doi:10.1109/iros.2005.1545119
- Kazuyuki Nakamura , Ryo Yoshida , Masao Nagasaki , Satoru Miyano , and Tomoyuki Higuchi . 2009 . Parameter estimation of in silico biological pathways with particle filtering towards a petascale computing . In Proceedings of the Pacific Symposium on Biocomputing 14 . 227--238. Kazuyuki Nakamura, Ryo Yoshida, Masao Nagasaki, Satoru Miyano, and Tomoyuki Higuchi. 2009. Parameter estimation of in silico biological pathways with particle filtering towards a petascale computing. In Proceedings of the Pacific Symposium on Biocomputing 14. 227--238.
- 10.5555/2627435.2670313 · doi:10.5555/2627435.2670313
- Tijmen Tieleman and Geoffrey Hinton . 2012 . Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude . COURSERA: Neural Networks for Machine Learning 4 (2012), 2 . Tijmen Tieleman and Geoffrey Hinton. 2012. Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude. COURSERA: Neural Networks for Machine Learning 4 (2012), 2.
- 10.5555/946247.946684 · doi:10.5555/946247.946684
Cited by
Efficient Processing of Deep Neural Networks: A Tutorial and Survey
Sze, V., Chen, Y.-H., Yang, T.-J., & Emer, J. S. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2761740 · Cited by 4,215
Channel Pruning for Accelerating Very Deep Neural Networks
He, Y., Zhang, X., & Sun, J. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.155 · Cited by 2,647
“Inference-time channel pruning is challenging, as reported by previous works [2, 40].”
ResultA survey on deep learning techniques for image and video semantic segmentation
Garcia-Garcia, A., Orts-Escolano, S., Oprea, S., Villena-Martinez, V., Martinez-Gonzalez, P., & Garcia-Rodriguez, J. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.05.018 · Cited by 1,490
Model Compression and Hardware Acceleration for Neural Networks: A Comprehensive Survey
Deng, B. L., Li, G., Han, S., Shi, L., & Xie, Y. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.2976475 · Cited by 996
Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networks
Liu, K., Dolan-Gavitt, B., & Garg, S. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-00470-5_13 · Cited by 1,055
Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better
Menghani, G. (2023) · ACM Computing Surveys · doi:10.1145/3578938 · Cited by 605
Model Pruning Enables Efficient Federated Learning on Edge Devices
Jiang, Y., Wang, S., Valls, V., Ko, B. J., Lee, W.-H., Leung, K. K., & Tassiulas, L. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3166101 · Cited by 589
A systematic review on overfitting control in shallow and deep neural networks
Bejani, M. M., & Ghatee, M. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-09975-1 · Cited by 573
MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning
Liu, Z., Mu, H., Zhang, X., Guo, Z., Yang, X., Cheng, K.-T., & Sun, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00339 · Cited by 563
A comprehensive survey on model compression and acceleration
Choudhary, T., Mishra, V., Goswami, A., & Sarangapani, J. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-020-09816-7 · Cited by 513
Zhuang, X., Guo, H., Alajlan, N., Zhu, H., & Rabczuk, T. (2021) · European Journal of Mechanics - A/Solids · doi:10.1016/j.euromechsol.2021.104225 · Cited by 430
Hoefler, T., Alistarh, D., Ben-Nun, T., Dryden, N., & Peste, A. (2021) · ETH Zurich · doi:10.3929/ethz-b-000519202 · Cited by 423
Are Sixteen Heads Really Better than One?
Michel, P., Levy, O., & Neubig, G. (2019) · arXiv · doi:10.48550/arxiv.1905.10650 · Cited by 404
A review of convolutional neural network architectures and their optimizations
Cong, S., & Zhou, Y. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10213-5 · Cited by 381
Variational Convolutional Neural Network Pruning
Zhao, C., Ni, B., Zhang, J., Zhao, Q., Zhang, W., & Tian, Q. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00289 · Cited by 361
Bai, X., Wang, X., Liu, X., Liu, Q., Song, J., Sebe, N., & Kim, B. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2021.108102 · Cited by 313
Model Compression for Deep Neural Networks: A Survey
Li, Z., Li, H., & Meng, L. (2023) · Computers · doi:10.3390/computers12030060 · Cited by 296
Self-supervised model adaptation for multimodal semantic segmentation
Valada, A., Mohan, R., & Burgard, W. (2020) · International Journal of Computer Vision · doi:10.1007/s11263-019-01188-y · Cited by 293
“Motivated by the recent success of compressing DCNNs by pruning unimportant neurons (Molchanov et al. 2017; Liu et al. 2017; Anwar et al. 2017), we explore pruning entire convolutional feature maps of our model to further reduce the number of parameters.”
BackgroundMethodInfluentialPruning by explaining: A novel criterion for deep neural network pruning
Yeom, S.-K., Seegerer, P., Lapuschkin, S., Binder, A., Wiedemann, S., Müller, K.-R., & Samek, W. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2021.107899 · Cited by 263
Li, Y., Li, K., Liu, X., Wang, Y., & Zhang, L. (2021) · Applied Energy · doi:10.1016/j.apenergy.2020.116410 · Cited by 247
Bringing ai to edge: from deep learning’s perspective
Liu, D., Kong, H., Luo, X., Liu, W., & Subramaniam, R. (2022) · Neurocomputing · doi:10.1016/j.neucom.2021.04.141 · Cited by 171
“Anwar et al. [101] prune a DNN model at feature level, kernel level, and intra-kernel level (i.e., weight), where they deploy evolutionary algorithm to find the best combination of different pruning granularities.”
BackgroundJALAD: Joint Accuracy-And Latency-Aware Deep Structure Decoupling for Edge-Cloud Execution
Li, H., Hu, C., Jiang, J., Wang, Z., Wen, Y., & Zhu, W. (2018) · 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/padsw.2018.8645013 · Cited by 160
Deep Learning on Mobile and Embedded Devices: State-of-the-art, Challenges, and Future Directions
Chen, Y., Zheng, B., Zhang, Z., Wang, Q., Shen, C., & Zhang, Q. (2021) · ACM Computing Surveys · doi:10.1145/3398209 · Cited by 159
Facial Sentiment Analysis Using AI Techniques: State-of-the-Art, Taxonomies, and Challenges
Patel, K., Mehta, D., Mistry, C., Gupta, R., Tanwar, S., Kumar, N., & Alazab, M. (2020) · IEEE Access · doi:10.1109/access.2020.2993803 · Cited by 157
“If the next layer has feature maps, then n×m convolutions are performed and n × m × (w × h × l × l) Multiply-Accumulate (MAC) operations are needed, where h and w represents the featuremap height andwidth of the next layer [132].”
BackgroundDeep Learning for Mobile Multimedia: A Survey
Ota, K., Dao, M. S., Mezaris, V., & Natale, F. G. B. D. (2017) · ACM Transactions on Multimedia Computing, Communications, and Applications · doi:10.1145/3092831 · Cited by 135
Characterizing the deployment of deep neural networks on commercial edge devices
Hadidi, R., Cao, J., Xie, Y., Asgari, B., Krishna, T., & Kim, H. (2019) · 2019 IEEE International Symposium on Workload Characterization (IISWC) · doi:10.1109/iiswc47752.2019.9041955 · Cited by 118
Jeon, K., Ryu, J. J., Im, S., Seo, H. K., Eom, T., Ju, H., Yang, M. K., Jeong, D. S., & Kim, G. H. (2024) · Nature Communications · doi:10.1038/s41467-023-44620-1 · Cited by 108
Embedded Intelligence on FPGA: Survey, Applications and Challenges
Seng, K. P., Lee, P. J., & Ang, L. M. (2021) · Electronics · doi:10.3390/electronics10080895 · Cited by 105
Accelerating Sparse Deep Neural Networks
Mishra, A., Latorre, J. A., Pool, J., Stosic, D., Stosic, D., Venkatesh, G., Yu, C., & Micikevicius, P. (2021) · arXiv · doi:10.48550/arxiv.2104.08378 · Cited by 97
“Furthermore, the pattern used to prune models may adhere to a specific structure [10,17–19] or follow no structure at all [7,11].”
MethodA Survey of Security Strategies in Federated Learning: Defending Models, Data, and Privacy
Manzoor, H. U., Shabbir, A., Chen, A., Flynn, D., & Zoha, A. (2024) · Future Internet · doi:10.3390/fi16100374 · Cited by 58
Towards Energy-Efficient and Secure Edge AI: A Cross-Layer Framework ICCAD Special Session Paper
Shafique, M., Marchisio, A., Wicaksana Putra, R. V., & Hanif, M. A. (2021) · 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD) · doi:10.1109/iccad51958.2021.9643539 · Cited by 58
Algorithm-hardware Co-design of Attention Mechanism on FPGA Devices
Zhang, X., Wu, Y., Zhou, P., Tang, X., & Hu, J. (2021) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3477002 · Cited by 52
Structured Model Pruning of Convolutional Networks on Tensor Processing Units
Chen, K., Franko, K., & Sang, R. (2021) · arXiv · doi:10.48550/arxiv.2107.04191 · Cited by 22
CoNNa–Hardware accelerator for compressed convolutional neural networks
Struharik, R. J. R., Vukobratović, B. Z., Erdeljan, A. M., & Rakanović, D. M. (2020) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.102991 · Cited by 18
Metadata
- Authors
- Anwar, S., Hwang, K., & Sung, W.
- Venue
- ACM Journal on Emerging Technologies in Computing Systems
- Published
- 2017-02-09
- Volume
- 13
- Issue
- 3
- Pages
- 1-18
- ISSN
- 1550-4832 (ISSN-L)
- 1550-4840
- OpenAlex
- W2276892413
- Cited by
- 698
- References
- 31
- FWCI
- 30.32
- Type
- journal article
- Language
- en
- Open access
- closed
- Funders
- National Research Foundation of Korea (2015R1A2A1A10056051)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.