Deep Compression with Low Rank and Sparse Integrated Decomposition

This work aims to compress the deep neural networks (DNNs) by learning the low rank and sparsity characteristics of weight filters. Most of the compression models consider the low rank or sparse property of weights independently, however, they cannot capture the features accurately and thus become inefficient. It is revealed that the low rank component of the weights also tends to be sparse, therefore, in this work, we propose an extreme neural network compression method by embedding sparsifying operations after the low rank decomposition. In addition, a global sparse component is proposed to compensate the performance loss of the compressed model. Experiments are also included to prove the benefits of the proposed algorithm.

Recommended citation: J. Huang, W. Sun, L. Huang, and S. Chen, “Deep compression with low rank and sparse integrated decomposition,” in 2019 IEEE 7th International Conference on Computer Science and Network Technology (ICCSNT), Dalian, China, 2019, pp. 289–292.
Download Paper | Download Slides | Download Bibtex