Causal Unstructured Pruning in Linear Networks Using Effective Information

Changyu Zeng, Li Liu, Haocheng Zhao, Yu Zhang, Wei Wang, Ning Cai, Yutao Yue
{"title":"Causal Unstructured Pruning in Linear Networks Using Effective Information","authors":"Changyu Zeng, Li Liu, Haocheng Zhao, Yu Zhang, Wei Wang, Ning Cai, Yutao Yue","doi":"10.1109/CyberC55534.2022.00056","DOIUrl":null,"url":null,"abstract":"Excessive number of parameters in today’s (deep) neural networks demands tremendous computational resources and slows down training speed. The problem also makes it difficult to deploy these neural network models on capability constrained devices such as mobile devices. To address this challenge, we propose an unstructured pruning method that measures the causal structure of neural networks based on effective information (EI). It introduces an intervention to the input and computes the mutual information between the interference and its corresponding output, within a single linear layer measuring the importance of each weight. In the experiments, we found that the sparsity of EI pruning can reach more than 90%. Only 10% of non-zero parameters in the linear layers were needed compared to the benchmark methods without pruning, while ensuring similar level of accuracy and stable training performance in iterative pruning. In addition, as the invariance of the causal structure of the network is exploited, the network after pruning using EI is highly generalizable and interpretable than other methods.","PeriodicalId":234632,"journal":{"name":"2022 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC55534.2022.00056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Excessive number of parameters in today’s (deep) neural networks demands tremendous computational resources and slows down training speed. The problem also makes it difficult to deploy these neural network models on capability constrained devices such as mobile devices. To address this challenge, we propose an unstructured pruning method that measures the causal structure of neural networks based on effective information (EI). It introduces an intervention to the input and computes the mutual information between the interference and its corresponding output, within a single linear layer measuring the importance of each weight. In the experiments, we found that the sparsity of EI pruning can reach more than 90%. Only 10% of non-zero parameters in the linear layers were needed compared to the benchmark methods without pruning, while ensuring similar level of accuracy and stable training performance in iterative pruning. In addition, as the invariance of the causal structure of the network is exploited, the network after pruning using EI is highly generalizable and interpretable than other methods.
基于有效信息的线性网络因果非结构化剪枝
在当今的(深度)神经网络中,过多的参数需要大量的计算资源,并且降低了训练速度。这个问题也使得将这些神经网络模型部署在功能受限的设备(如移动设备)上变得困难。为了解决这一挑战,我们提出了一种基于有效信息(EI)测量神经网络因果结构的非结构化修剪方法。它在输入中引入一个干涉,并计算干涉与其相应输出之间的互信息,在单个线性层中测量每个权重的重要性。在实验中,我们发现EI剪枝的稀疏度可以达到90%以上。与不进行剪枝的基准方法相比,线性层中只需要10%的非零参数,同时在迭代剪枝中保证了相似的精度和稳定的训练性能。此外,由于利用了网络因果结构的不变性,使用EI修剪后的网络比其他方法具有更高的泛化和可解释性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信