arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.15751eess.AScs.AIcs.CCcs.LG
收藏

基于被动相似性的CNN滤波器剪枝算法

A Passive Similarity based CNN Filter Pruning for Efficient Acoustic Scene Classification

Centre for Vision, Speech;Signal Processing (CVSSP) University of Surrey, UK

Arshdeep Singh, Mark D. Plumbley

摘要:

我们提出了一种开发低复杂度卷积神经网络(CNN)用于声学场景分类(ASC)的方法。典型CNN的大尺寸和高计算复杂度是其在资源受限设备上部署的瓶颈。我们提出了一个被动过滤器修剪框架,其中CNN中的一些卷积过滤器被消除以产生压缩的CNN。我们的假设是,类似的过滤器产生类似的响应,并提供冗余的信息,允许这样的过滤器从网络中删除。为了识别相似滤波器,提出了一种基于余弦距离的贪婪算法。然后执行微调过程以恢复由于滤波器消除而损失的大部分性能。为了进行有效的微调,我们分析了性能如何随着微调训练样本数量的变化而变化。建议的框架进行实验评估上公开可用的DCASE 2021任务1A基线网络训练ASC。所提出的方法很简单,每次推理的计算量减少了27%,参数减少了25%,精度下降不到1%。

英文摘要:

We present a method to develop low-complexity convolutional neural networks (CNNs) for acoustic scene classification (ASC). The large size and high computational complexity of typical CNNs is a bottleneck for their deployment on resource-constrained devices. We propose a passive filter pruning framework, where a few convolutional filters from the CNNs are eliminated to yield compressed CNNs. Our hypothesis is that similar filters produce similar responses and give redundant information allowing such filters to be eliminated from the network. To identify similar filters, a cosine distance based greedy algorithm is proposed. A fine-tuning process is then performed to regain much of the performance lost due to filter elimination. To perform efficient fine-tuning, we analyze how the performance varies as the number of fine-tuning training examples changes. An experimental evaluation of the proposed framework is performed on the publicly available DCASE 2021 Task 1A baseline network trained for ASC. The proposed method is simple, reduces computations per inference by 27%, with 25% fewer parameters, with less than 1% drop in accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑