基于权重分布的k均值深度卷积网络压缩

Wang Lei, Huawei Chen, Yixuan Wu
{"title":"基于权重分布的k均值深度卷积网络压缩","authors":"Wang Lei, Huawei Chen, Yixuan Wu","doi":"10.1145/3144789.3144803","DOIUrl":null,"url":null,"abstract":"For the application of deep neural networks on devices with limited hardware resources, it is necessary to reduce the computational complexity and storage requirement. Compression is an effective way to achieve this goal. One of the available method is to quantize the weights to enforce weight sharing, which can greatly reduce the parameters of each layer. This paper presents an improved k-means clustering algorithm to compress CNN (convolutional neural networks).By taking weights distribution into consideration when choosing clustering centers to quantize weights, this algorithm automatically chooses and revises centers to compress network. Compared with traditional quantification method, this algorithm can maintain accuracy and increase the compression speed at the same time. Experiments on AlexNet show that using k-means based on weights distribution to quantize the weights can improve compression speed by 5% to 10% and improve accuracy by 6% compared to traditional algorithm. This algorithm provides a better way for the application of convolutional neural networks on mobile devices.","PeriodicalId":254163,"journal":{"name":"Proceedings of the 2nd International Conference on Intelligent Information Processing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Compressing Deep Convolutional Networks Using K-means Based on Weights Distribution\",\"authors\":\"Wang Lei, Huawei Chen, Yixuan Wu\",\"doi\":\"10.1145/3144789.3144803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the application of deep neural networks on devices with limited hardware resources, it is necessary to reduce the computational complexity and storage requirement. Compression is an effective way to achieve this goal. One of the available method is to quantize the weights to enforce weight sharing, which can greatly reduce the parameters of each layer. This paper presents an improved k-means clustering algorithm to compress CNN (convolutional neural networks).By taking weights distribution into consideration when choosing clustering centers to quantize weights, this algorithm automatically chooses and revises centers to compress network. Compared with traditional quantification method, this algorithm can maintain accuracy and increase the compression speed at the same time. Experiments on AlexNet show that using k-means based on weights distribution to quantize the weights can improve compression speed by 5% to 10% and improve accuracy by 6% compared to traditional algorithm. This algorithm provides a better way for the application of convolutional neural networks on mobile devices.\",\"PeriodicalId\":254163,\"journal\":{\"name\":\"Proceedings of the 2nd International Conference on Intelligent Information Processing\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2nd International Conference on Intelligent Information Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3144789.3144803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Intelligent Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3144789.3144803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

为了在硬件资源有限的设备上应用深度神经网络,必须降低计算复杂度和存储要求。压缩是实现这一目标的有效途径。一种可行的方法是量化权重,实现权重共享,这样可以大大减少各层的参数。提出了一种改进的k-均值聚类算法来压缩卷积神经网络。该算法在选择聚类中心量化权值时考虑权值分布,自动选择和修正聚类中心,压缩网络。与传统的量化方法相比,该算法在保持精度的同时提高了压缩速度。AlexNet上的实验表明,与传统算法相比,使用基于权值分布的k-means对权值进行量化,压缩速度提高5% ~ 10%,精度提高6%。该算法为卷积神经网络在移动设备上的应用提供了更好的途径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Compressing Deep Convolutional Networks Using K-means Based on Weights Distribution
For the application of deep neural networks on devices with limited hardware resources, it is necessary to reduce the computational complexity and storage requirement. Compression is an effective way to achieve this goal. One of the available method is to quantize the weights to enforce weight sharing, which can greatly reduce the parameters of each layer. This paper presents an improved k-means clustering algorithm to compress CNN (convolutional neural networks).By taking weights distribution into consideration when choosing clustering centers to quantize weights, this algorithm automatically chooses and revises centers to compress network. Compared with traditional quantification method, this algorithm can maintain accuracy and increase the compression speed at the same time. Experiments on AlexNet show that using k-means based on weights distribution to quantize the weights can improve compression speed by 5% to 10% and improve accuracy by 6% compared to traditional algorithm. This algorithm provides a better way for the application of convolutional neural networks on mobile devices.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信