Dynamic connection pruning for densely connected convolutional neural networks

• Published in: Applied intelligence (Dordrecht, Netherlands) Netherlands), 2023-08, Vol.53 (16), p.19505-19521
• Main Authors: Hu, Xinyi, Fang, Hangxiang, Zhang, Ling, Zhang, Xue, Yang, Howard H., Yang, Dongxiao, Peng, Bo, Li, Zheyang, Hu, Haoji
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial Intelligence; Artificial neural networks; Computer Science; Effectiveness; Lightweight; Machines; Manufacturing; Markov processes; Mechanical Engineering; Neural networks; Processes; Redundancy
• ISSN: 0924-669X; 1573-7497
• DOI: 10.1007/s10489-023-04513-8

Densely connected convolutional neural networks dominate in a variety of downstream tasks due to their extraordinary performance. However, such networks typically require excessive computing resources, which hinders their deployment on mobile devices. In this paper, we propose a dynamic connection pruning algorithm, which is a cost-effective method to eliminate a large amount of redundancy in densely connected networks. First, we propose a Sample-Evaluation process to assess the contributions of connections. Specifically, sub-networks are sampled from the unpruned network in each epoch, while the parameters of the unpruned network are subsequently updated and the contributions of the connections are evaluated based on the performance of the sub-networks. Connections with low contribution will be pruned first. Then, we search for the distribution of pruning ratios by the Markov process. Finally, we prune the network based on the connection contribution and pruning ratios learned in the above two stages and obtain a lightweight network. The effectiveness of our method is verified on both high-level and low-level tasks. On the CIFAR-10 dataset, the top-1 accuracy barely drops (-0.03%) when FLOPs are reduced by 46.8%. In the super-resolution task, our model remarkably outperforms other lightweight networks in both visual and quantitative experiments. These results verify the effectiveness and generality of our proposed method.