How to Train Unstable Looped Tensor Network
Not on the map. Why?
Abstract (arXiv)
A rising problem in the compression of Deep Neural Networks is how to reduce the number of parameters in convolutional kernels and the complexity of these layers by low-rank tensor approximation. Canonical polyadic tensor decomposition (CPD) and Tucker tensor decomposition (TKD) are two solutions to this problem and provide promising results. However, CPD often fails due to degeneracy, making the networks unstable and hard to fine-tune. TKD does not provide much compression if the core tensor is big. This motivates using a hybrid model of CPD and TKD, a decomposition with multiple Tucker models with small core tensor, known as block term decomposition (BTD). This paper proposes a more compact model that further compresses the BTD by enforcing core tensors in BTD identical. We establish a link between the BTD with shared parameters and a looped chain tensor network (TC). Unfortunately, such strongly constrained tensor networks (with loop) encounter severe numerical instability, as proved by y (Landsberg, 2012) and (Handschuh, 2015a). We study perturbation of chain tensor networks, provide interpretation of instability in TC, demonstrate the problem. We propose novel methods to gain the stability of the decomposition results, keep the network robust and attain better approximation. Experimental results will confirm the superiority of the proposed methods in compression of well-known CNNs, and TC decomposition under challenging scenarios
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 57 references that are in the map. First posted on arXiv 5 Mar 2022.
Builds on
21 of 57 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2015Tensorizing Neural Networkscited by 246
- 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 161
- 2018Dynamic Channel Pruning: Feature Boosting and Suppressioncited by 129
- 2016Tensor Ring Decompositioncited by 125
- 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
- 2018Channel Gating Neural Networkscited by 80
- 2020Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Networkcited by 74
9 more
- 2021Tensor Methods in Computer Vision and Deep Learningcited by 52
- 2021Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Frameworkcited by 52
- 2018Wide Compression: Tensor Ring Netscited by 50
- 2017Efficient Low Rank Tensor Ring Completioncited by 45
- 2018Compressing Recurrent Neural Networks with Tensor Ring for Action Recognitioncited by 34
- 2021GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarizationcited by 29
- 2020NeuralSens: Sensitivity Analysis of Neural Networkscited by 14
- 2021Towards Extremely Compact RNNs for Video Recognition with Fully Decomposed Hierarchical Tucker Structurecited by 8
- 2020Tensor completion via nonconvex tensor ring rank minimization with guaranteed convergencecited by 3
Built on by
Citing papers per year: 2023: 3.
3 papers.