Hybrid Tensor Decomposition in Neural Network Compression
Bijiao Wu, Dingheng Wang, Guangshe Zhao, Lei Deng, Guoqi Li

TL;DR
This paper explores the use of hierarchical Tucker tensor decomposition for neural network compression, proposing a hybrid approach combining HT and TT formats to improve accuracy and efficiency.
Contribution
It introduces the application of hierarchical Tucker decomposition to neural network compression and proposes a hybrid method combining HT and TT formats for better performance.
Findings
HT better compresses weight matrices
TT more effective for convolutional kernels
Hybrid approach improves CNN accuracy
Abstract
Deep neural networks (DNNs) have enabled impressive breakthroughs in various artificial intelligence (AI) applications recently due to its capability of learning high-level features from big data. However, the current demand of DNNs for computational resources especially the storage consumption is growing due to that the increasing sizes of models are being required for more and more complicated applications. To address this problem, several tensor decomposition methods including tensor-train (TT) and tensor-ring (TR) have been applied to compress DNNs and shown considerable compression effectiveness. In this work, we introduce the hierarchical Tucker (HT), a classical but rarely-used tensor decomposition method, to investigate its capability in neural network compression. We convert the weight matrices and convolutional kernels to both HT and TT formats for comparative study, since the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsTuckER
