An Adaptive Tensor-Train Decomposition Approach for Efficient Deep Neural Network Compression
Not on the map. Why?
Abstract (arXiv)
In the field of model compression, choosing an appropriate rank for tensor decomposition is pivotal for balancing model compression rate and efficiency. However, this selection, whether done manually or through optimization-based automatic methods, often increases computational complexity. Manual rank selection lacks efficiency and scalability, often requiring extensive trial-and-error, while optimization-based automatic methods significantly increase the computational burden. To address this, we introduce a novel, automatic, and budget-aware rank selection method for efficient model compression, which employs Layer-Wise Imprinting Quantitation (LWIQ). LWIQ quantifies each layer's significance within a neural network by integrating a proxy classifier. This classifier assesses the layer's impact on overall model performance, allowing for a more informed adjustment of tensor rank. Furthermore, our approach includes a scaling factor to cater to varying computational budget constraints. This budget awareness eliminates the need for repetitive rank recalculations for different budget scenarios. Experimental results on the CIFAR-10 dataset show that our LWIQ improved by 63.2% in rank search efficiency, and the accuracy only dropped by 0.86% with 3.2x less model size on the ResNet-56 model as compared to the state-of-the-art proxy-based automatic tensor rank selection method.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 2 Aug 2024.
Builds on
24 of 46 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 849
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 592
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 120
12 more
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 78
- 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
- 2016Ultimate tensorization: compressing convolutional and FC layers alikecited by 56
- 2013Robust Low-rank Tensor Recovery: Models and Algorithmscited by 34
- 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
- 2020Heuristic Rank Selection with Progressively Searching Tensor Ring Networkcited by 28
- 2020To Filter Prune, or to Layer Prune, That Is The Questioncited by 23
- 2015Bayesian Tensor Regressioncited by 21
- 2023HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural Networkscited by 20
- 2013Equivariant and scale-free Tucker decomposition modelscited by 5
- 2014A Bayesian Tensor Factorization Model via Variational Inference for Link Predictioncited by 2
- 2018Probabilistic PARAFAC2cited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026EinSort: Sorting is All We Need for Tensorizing LLMcited by 0
- 2026EinSort: Sorting is All We Need for Tensorizing LLM7 Jun 2026