Improved Model Compression Method Based on Information Entropy

Chao Wu, Wen Dong, Duo-Xiu Hu, Chengziang Zhai
{"title":"Improved Model Compression Method Based on Information Entropy","authors":"Chao Wu, Wen Dong, Duo-Xiu Hu, Chengziang Zhai","doi":"10.1109/AIID51893.2021.9456529","DOIUrl":null,"url":null,"abstract":"The rapid development of deep learning has promoted more and more complex neural network models that require high computing power. Even though researchers have proposed various lightweight network models such as MobileNet, SqueezeNet and ShuffleNet, the amount of calculation is still huge. In order to further reduce the amount of model calculations, model compression is an effective means to reduce the amount of model parameters and calculations. Channel pruning is the most effective and direct means to accelerate model calculations and reduce model parameters. However, due to its radical approach, the effect of pruning is affected by the basis for determining the importance of the channel, and the accuracy cannot be guaranteed. Furthermore, pruning When the filter is smaller than the set threshold value is completely deleted, it is possible to discard important parameters. Therefore, this article intends to propose a channel pruning model compression method based on information entropy. The actual test results give convincing experimental results, which prove the effectiveness and practicability of the method.","PeriodicalId":412698,"journal":{"name":"2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIID51893.2021.9456529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The rapid development of deep learning has promoted more and more complex neural network models that require high computing power. Even though researchers have proposed various lightweight network models such as MobileNet, SqueezeNet and ShuffleNet, the amount of calculation is still huge. In order to further reduce the amount of model calculations, model compression is an effective means to reduce the amount of model parameters and calculations. Channel pruning is the most effective and direct means to accelerate model calculations and reduce model parameters. However, due to its radical approach, the effect of pruning is affected by the basis for determining the importance of the channel, and the accuracy cannot be guaranteed. Furthermore, pruning When the filter is smaller than the set threshold value is completely deleted, it is possible to discard important parameters. Therefore, this article intends to propose a channel pruning model compression method based on information entropy. The actual test results give convincing experimental results, which prove the effectiveness and practicability of the method.
基于信息熵的改进模型压缩方法
深度学习的快速发展使得神经网络模型越来越复杂,对计算能力的要求也越来越高。尽管研究人员已经提出了各种轻量级网络模型,如MobileNet、SqueezeNet和ShuffleNet,但计算量仍然很大。为了进一步减少模型计算量,模型压缩是减少模型参数和计算量的有效手段。通道剪枝是加速模型计算、减少模型参数的最有效、最直接的手段。然而,由于其激进的方法,修剪的效果受到确定通道重要性的依据的影响,无法保证其准确性。此外,剪枝当过滤器小于设置的阈值被完全删除时,有可能丢弃重要的参数。因此,本文拟提出一种基于信息熵的信道剪枝模型压缩方法。实际测试结果给出了令人信服的实验结果,证明了该方法的有效性和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信