SFP: Similarity-based filter pruning for deep neural networks

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2024-08-31 DOI:10.1016/j.ins.2024.121418
{"title":"SFP: Similarity-based filter pruning for deep neural networks","authors":"","doi":"10.1016/j.ins.2024.121418","DOIUrl":null,"url":null,"abstract":"<div><p>Convolutional neural networks have exhibited exceptional performance in various artificial intelligence domains, particularly in large-scale image processing tasks. However, the proliferation of network parameters and computational requirements has emerged as a significant bottleneck for the practical deployment of CNNs. In this paper, we propose a novel similarity-based filter pruning (SFP) approach for compressing convolutional neural networks, which is different from the traditional pruning method. The existing pruning methods eliminate the unimportant parameters but ignore the duplication of the reserved convolutional kernels. In the proposed SFP, kernels are clustered first according to their similarity, then the unimportant and redundant kernels are pruned in each class, which is more efficient than traditional pruning methods only based on the importance criterion. Furthermore, this paper introduces the concept of Kernel Dispersion to evaluate sparsity across distinct network layers, and proposes Distillation Fine-Tuning with Variable Temperature Coefficient to expedite convergence and enhance accuracy. The performance of the proposed similarity-based filter pruning approach is evaluated on different datasets, including CIFAR10, CIFAR100, ImageNet, and VOC. The experimental results indicate that the proposed SFP achieves approximately 1% higher accuracy at a comparable pruning rate compared to traditional state-of-the-art pruning methods.</p></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.1000,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002002552401332X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Convolutional neural networks have exhibited exceptional performance in various artificial intelligence domains, particularly in large-scale image processing tasks. However, the proliferation of network parameters and computational requirements has emerged as a significant bottleneck for the practical deployment of CNNs. In this paper, we propose a novel similarity-based filter pruning (SFP) approach for compressing convolutional neural networks, which is different from the traditional pruning method. The existing pruning methods eliminate the unimportant parameters but ignore the duplication of the reserved convolutional kernels. In the proposed SFP, kernels are clustered first according to their similarity, then the unimportant and redundant kernels are pruned in each class, which is more efficient than traditional pruning methods only based on the importance criterion. Furthermore, this paper introduces the concept of Kernel Dispersion to evaluate sparsity across distinct network layers, and proposes Distillation Fine-Tuning with Variable Temperature Coefficient to expedite convergence and enhance accuracy. The performance of the proposed similarity-based filter pruning approach is evaluated on different datasets, including CIFAR10, CIFAR100, ImageNet, and VOC. The experimental results indicate that the proposed SFP achieves approximately 1% higher accuracy at a comparable pruning rate compared to traditional state-of-the-art pruning methods.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SFP:基于相似性的深度神经网络滤波器剪枝
卷积神经网络在各种人工智能领域,尤其是大规模图像处理任务中表现出了卓越的性能。然而,网络参数和计算要求的激增已成为实际部署卷积神经网络的一个重要瓶颈。在本文中,我们提出了一种新颖的基于相似性的滤波器剪枝(SFP)方法,用于压缩卷积神经网络,它有别于传统的剪枝方法。现有的剪枝方法消除了不重要的参数,但忽略了保留卷积核的重复。在所提出的 SFP 中,首先根据内核的相似性对内核进行聚类,然后在每一类中剪枝不重要和多余的内核,这比传统的只根据重要性准则进行剪枝的方法更有效。此外,本文还引入了 "内核分散 "的概念来评估不同网络层的稀疏性,并提出了具有可变温度系数的蒸馏微调方法,以加快收敛速度并提高准确性。我们在不同的数据集(包括 CIFAR10、CIFAR100、ImageNet 和 VOC)上评估了所提出的基于相似性的滤波器剪枝方法的性能。实验结果表明,与传统的先进剪枝方法相比,所提出的 SFP 在剪枝率相当的情况下,准确率提高了约 1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Wavelet structure-texture-aware super-resolution for pedestrian detection HVASR: Enhancing 360-degree video delivery with viewport-aware super resolution KNEG-CL: Unveiling data patterns using a k-nearest neighbor evolutionary graph for efficient clustering Fréchet and Gateaux gH-differentiability for interval valued functions of multiple variables Detecting fuzzy-rough conditional anomalies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1