PDSR: Optimization of SNIP Pre-Pruning Algorithm Based On Dynamic Sparsity Rate

Jianjun Wang, Ximeng Pan, Wanqing Li, Min Zhang
{"title":"PDSR: Optimization of SNIP Pre-Pruning Algorithm Based On Dynamic Sparsity Rate","authors":"Jianjun Wang, Ximeng Pan, Wanqing Li, Min Zhang","doi":"10.1109/ITCA52113.2020.00032","DOIUrl":null,"url":null,"abstract":"As a key parameter of network pruning, the sparsity rate determines the sparsity effect after network pruning, and is closely related to the complexity, accuracy and application of neural network. Therefore, the determination of neural network sparsity rate has become one of the research hotspots. After reading a large number of relevant literatures, it is found that in the process of model training, the value of sparsity rate is often set artificially according to experience. So that the sparsity rate cannot change dynamically with the change of experimental environment and data, and the accuracy of its value is difficult to determine. To solve the above problems, this paper introduces dynamic sparsity rate, optimizes the SNIP pre-pruning algorithm, and proposes the PDSR algorithm. It calculates the sparsity rate dynamically according to the connection sensitivity of weights and realizes the pre-pruning of neural networks. Experimental results on various convolutional neural networks show that compared with SNIP algorithm, the PDSR algorithm has obvious improvement in accuracy rate and operation efficiency.","PeriodicalId":103309,"journal":{"name":"2020 2nd International Conference on Information Technology and Computer Application (ITCA)","volume":"108 47","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Information Technology and Computer Application (ITCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCA52113.2020.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As a key parameter of network pruning, the sparsity rate determines the sparsity effect after network pruning, and is closely related to the complexity, accuracy and application of neural network. Therefore, the determination of neural network sparsity rate has become one of the research hotspots. After reading a large number of relevant literatures, it is found that in the process of model training, the value of sparsity rate is often set artificially according to experience. So that the sparsity rate cannot change dynamically with the change of experimental environment and data, and the accuracy of its value is difficult to determine. To solve the above problems, this paper introduces dynamic sparsity rate, optimizes the SNIP pre-pruning algorithm, and proposes the PDSR algorithm. It calculates the sparsity rate dynamically according to the connection sensitivity of weights and realizes the pre-pruning of neural networks. Experimental results on various convolutional neural networks show that compared with SNIP algorithm, the PDSR algorithm has obvious improvement in accuracy rate and operation efficiency.
基于动态稀疏率的SNIP预剪枝算法优化
稀疏率作为网络剪枝的关键参数,决定了网络剪枝后的稀疏效果,与神经网络的复杂性、准确性和应用密切相关。因此,神经网络稀疏率的确定成为研究热点之一。在阅读了大量相关文献后发现,在模型训练过程中,稀疏率的值往往是根据经验人为设定的。因此,稀疏率不能随实验环境和数据的变化而动态变化,其值的准确性难以确定。针对上述问题,本文引入了动态稀疏率,优化了SNIP预剪枝算法,提出了PDSR算法。根据权值的连接灵敏度动态计算稀疏率,实现神经网络的预剪枝。在各种卷积神经网络上的实验结果表明,与SNIP算法相比,PDSR算法在准确率和运行效率上有明显提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信