AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Pushing to the Limit: An Attention-Based Dual-Prune Approach for Highly-Compacted CNN Filter Pruning

State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China
Show Author Information

Abstract

Filter pruning is an important technique to compress convolutional neural networks (CNNs) to acquire light-weight high-performance model for practical deployment. However, the existing filter pruning methods suffer from sharp performance drops when the pruning ratio is large, probably due to the unrecoverable information loss caused by aggressive pruning. In this paper, we propose a dual attention based pruning approach called DualPrune to push the limit of network pruning at an ultra-high compression ratio. Firstly, it adopts a graph attention network (GAT) to automatically extract filter-level and layer-level features from CNNs based on the roles of their filters in the whole computation graph. Then the extracted comprehensive features are fed to a side-attention network, which generates sparse attention weights for individual filters to guide model pruning. To avoid layer collapse, the side-attention network adopts a side-path design to preserve the information flow going through the CNN model properly, which allows the CNN model to be pruned at a high compression ratio at initialization and trained from scratch afterward. Extensive experiments based on several well-known CNN models and real-world datasets show that the proposed DualPrune method outperforms the state-of-the-art methods with significant performance improvement, particularly for model compression at a high pruning ratio.

Electronic Supplementary Material

Download File(s)
JCST-2306-13536-Highlights.pdf (249.6 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 805-820

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Fang Y-C, Li W-Z, Zeng Y, et al. Pushing to the Limit: An Attention-Based Dual-Prune Approach for Highly-Compacted CNN Filter Pruning. Journal of Computer Science and Technology, 2025, 40(3): 805-820. https://doi.org/10.1007/s11390-024-3536-3

621

Views

2

Crossref

2

Web of Science

2

Scopus

0

CSCD

Received: 21 June 2023
Accepted: 07 November 2024
Published: 30 April 2025
© Institute of Computing Technology, Chinese Academy of Sciences 2025