无需重训练和原始数据,可恢复剪枝后的神经网络
Training-Free Restoration of Pruned Neural Networks
- 通过保留神经元信息的分布式传递机制重建剪枝层
- 在多个数据集上恢复精度优于现有无重训练方法
- 适合资源受限场景下模型压缩与部署
尽管网络剪枝广泛用于压缩深度神经网络,但其性能高度依赖代价高昂且需原始数据的微调过程。然而在实际场景中,这一条件往往难以满足。近期一些工作尝试在不进行重训练的情况下恢复剪枝网络,但其强假设是被剪枝的神经元可由一个相似神经元替代,而该假设在许多网络中并不成立。本文提出一种更严谨稳健的无微调、无数据恢复方法 LBYL(Leave Before You Leave),显著放松了上述假设:每个被剪枝的神经元会将其信息分散传递给尽可能多的保留神经元,从而由多个神经元协同近似原神经元输出。该方法基于对重构误差的理论分析,推导出闭式解形式的损失函数。大量实验表明,相较于利用神经元间相似性的现有方法,LBYL能更准确地逼近原网络,从而实现更高的恢复精度。本工作最初版本曾提交至 NeurIPS 2021 与 ICML 2022。
原文摘要 · Abstract (English)
Although network pruning has been highly popularized to compress deep neural networks, its resulting accuracy heavily depends on a fine-tuning process that is often computationally expensive and requires the original data. However, this may not be the case in real-world scenarios, and hence a few recent works attempt to restore pruned networks without any expensive retraining process. Their strong assumption is that every neuron being pruned can be replaced with another one quite similar to it, but unfortunately this does not hold in many neural networks, where the similarity between neurons is extremely low in some layers. In this article, we propose a more rigorous and robust method of restoring pruned networks in a fine-tuning free and data-free manner, called LBYL (Leave Before You Leave). LBYL significantly relaxes the aforementioned assumption in a way that each pruned neuron leaves its pieces of information to as many preserved neurons as possible and thereby multiple neurons together obtain a more robust approximation to the original output of the neuron who just left. Our method is based on a theoretical analysis on how to formulate the reconstruction error between the original network and its approximation, which nicely leads to a closed form solution for our derived loss function. Through the extensive experiments, LBYL is confirmed to be indeed more effective to approximate the original network and consequently able to achieve higher accuracy for restored networks, compared to the recent approaches exploiting the similarity between two neurons. The very first version of this work, which contains major technical and theoretical components, was submitted to NeurIPS 2021 and ICML 2022.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。