Semi-tensor Product-based TensorDecomposition for Neural Network Compression
원문 초록
The existing tensor networks adopt conventional matrix product for connection. The classical matrix product requires strict dimensionality consistency between factors, which can result in redundancy in data representation. In this paper, the semi-tensor product is used to generalize classical matrix product-based mode product to semi-tensor mode product. As it permits the connection of two factors with different dimensionality, more flexible and compact tensor decompositions can be obtained with smaller sizes of factors. Tucker decomposition, Tensor Train (TT) and Tensor Ring (TR) are common decomposition for low rank compression of deep neural networks. The semi-tensor product is applied to these tensor decompositions to obtained their generalized versions, i.e., semi-tensor Tucker decomposition (STTu), semi-tensor train(STT) and semi-tensor ring (STR). Experimental results show the STTu, STT and STR achieve higher compression factors than the conventional tensor decompositions with the same accuracy but less training times in ResNet and WideResNetcompression. With 2% accuracy degradation, the TT-RN (rank = 14) and the TR-WRN (rank = 16) only obtain 3 times and99t times compression factors while the STT-RN (rank = 14) and the STR-WRN (rank = 16) achieve 9 times and 179 times compression factors, respectively.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
T-Basis: a Compact Representation for Neural Networks
ReCalKV: Low-Rank KV Cache Compression via Head Reordering and Offline Calibration
A tensor network approach for chaotic time series prediction
Certified Neural Approximations of Nonlinear Dynamics
Quantum Methods for Managing Ambiguity in Natural Language Processing
LiteASR: Efficient Automatic Speech Recognition with Low-Rank Approximation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.