1xN Pattern for Pruning Convolutional Neural Networks

被引:32
作者
Lin, Mingbao [1 ,2 ]
Zhang, Yuxin [1 ]
Li, Yuchao [3 ]
Chen, Bohong [1 ]
Chao, Fei [1 ]
Wang, Mengdi [3 ]
Li, Shen [3 ]
Tian, Yonghong [4 ]
Ji, Rongrong [1 ,5 ]
机构
[1] Xiamen Univ, Sch Informat, Dept Artificial Intelligence, Media Analyt & Comp Lab, Xiamen 361005, Peoples R China
[2] Tencent Youtu Lab, Shanghai 200233, Peoples R China
[3] Alibaba Grp, Hangzhou 310052, Peoples R China
[4] Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China
[5] Xiamen Univ, Inst Artificial Intelligence, Xiamen 361005, Peoples R China
基金
中国国家自然科学基金;
关键词
Kernel; Indexes; Convolutional neural networks; Training; Shape; Filtering algorithms; Convolution; Network pruning; pruning pattern; CPUs acceleration; CNNs;
D O I
10.1109/TPAMI.2022.3195774
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Though network pruning receives popularity in reducing the complexity of convolutional neural networks (CNNs), it remains an open issue to concurrently maintain model accuracy as well as achieve significant speedups on general CPUs. In this paper, we propose a novel 1xN pruning pattern to break this limitation. In particular, consecutive N output kernels with the same input channel index are grouped into one block, which serves as a basic pruning granularity of our pruning pattern. Our 1xN pattern prunes these blocks considered unimportant. We also provide a workflow of filter rearrangement that first rearranges the weight matrix in the output channel dimension to derive more influential blocks for accuracy improvements and then applies similar rearrangement to the next-layer weights in the input channel dimension to ensure correct convolutional operations. Moreover, the output computation after our 1xN pruning can be realized via a parallelized block-wise vectorized operation, leading to significant speedups on general CPUs. The efficacy of our pruning pattern is proved with experiments on ILSVRC-2012. For example, given the pruning rate of 50% and N=4, our pattern obtains about 3.0% improvements over filter pruning in the top-1 accuracy of MobileNet-V2. Meanwhile, it obtains 56.04ms inference savings on Cortex-A7 CPU over weight pruning. Our project is made available at https://github.com/lmbxmu/1xN.
引用
收藏
页码:3999 / 4008
页数:10
相关论文
共 46 条
[1]  
[Anonymous], 2015, ARXIV PREPRINT ARXIV
[2]  
[Anonymous], 1992, Advances in Neural Information Processing Systems (NeurIPS)
[3]  
[Anonymous], 2017, ICLR
[4]  
Carbin M., 2020, INT C LEARNING REPRE
[5]  
Chen TQ, 2018, PROCEEDINGS OF THE 13TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P579
[6]   NVIDIA A100 Tensor Core GPU: Performance and Innovation [J].
Choquette, Jack ;
Gandhi, Wishwesh ;
Giroux, Olivier ;
Stam, Nick ;
Krashinsky, Ronny .
IEEE MICRO, 2021, 41 (02) :29-35
[7]  
Deng J, 2009, PROC CVPR IEEE, P248, DOI 10.1109/CVPRW.2009.5206848
[8]  
Ding X., 2019, INT C MACHINE LEARNI, P1607
[9]  
Dong X, 2017, ADV NEUR IN, V30
[10]  
Elsen E, 2020, PROC CVPR IEEE, P14617, DOI 10.1109/CVPR42600.2020.01464