arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.05441cs.CV
收藏

Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Network

Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究院);The Czech Academy of Sciences, Institute of Information Theory and Automation(捷克科学院信息理论与自动化研究所)

Anh-Huy Phan, Konstantin Sobolev, Konstantin Sozykin, Dmitry Ermilov, Julia Gusak, Petr Tichavsky, Valeriy Glukhov, Ivan Oseledets, Andrzej Cichocki

英文摘要:

Most state of the art deep neural networks are overparameterized and exhibit a high computational cost. A straightforward approach to this problem is to replace convolutional kernels with its low-rank tensor approximations, whereas the Canonical Polyadic tensor Decomposition is one of the most suited models. However, fitting the convolutional tensors by numerical optimization algorithms often encounters diverging components, i.e., extremely large rank-one tensors but canceling each other. Such degeneracy often causes the non-interpretable result and numerical instability for the neural network fine-tuning. This paper is the first study on degeneracy in the tensor decomposition of convolutional kernels. We present a novel method, which can stabilize the low-rank approximation of convolutional kernels and ensure efficient compression while preserving the high-quality performance of the neural networks. We evaluate our approach on popular CNN architectures for image classification and show that our method results in much lower accuracy degradation and provides consistent performance.

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

↑