MUSCO: Multi-Stage Compression of neural networks
Not on the map. Why?
Abstract (arXiv)
The low-rank tensor approximation is very promising for the compression of deep neural networks. We propose a new simple and efficient iterative approach, which alternates low-rank factorization with a smart rank selection and fine-tuning. We demonstrate the efficiency of our method comparing to non-iterative ones. Our approach improves the compression rate while maintaining the accuracy for a variety of tasks.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2023Training Acceleration of Low-Rank Decomposed Networks using Sequential Freezing and Rank Quantizationcited by 8
- 2022tntorch: Tensor Network Learning with PyTorchcited by 7
- 2021Tensor Yard: One-Shot Algorithm of Hardware-Friendly Tensor-Train Decomposition for Convolutional Neural Networkscited by 3
- 2024Accelerating the Low-Rank Decomposed Modelscited by 1
- 2025Distribution-Aware Tensor Decomposition for Compression of Convolutional Neural Networkscited by 0
- 2025Distribution-Aware Tensor Decomposition for Compression of Convolutional Neural Networks6 Nov 2025
- 2024Accelerating the Low-Rank Decomposed Models24 Jul 2024
- 2023Training Acceleration of Low-Rank Decomposed Networks using Sequential Freezing and Rank Quantization7 Sep 2023
- 2022tntorch: Tensor Network Learning with PyTorch22 Jun 2022
- 2021Tensor Yard: One-Shot Algorithm of Hardware-Friendly Tensor-Train Decomposition for Convolutional Neural Networks9 Aug 2021