Papers › Decomposable-Net: Scalable Low-Rank Compression for Neural Networks

Decomposable-Net: Scalable Low-Rank Compression for Neural Networks

29 Oct 2019arXiv:1910.13141archive 2025-07-28

Atsushi Yaguchi, Taiji Suzuki, Shuhei Nitta, Yukinobu Sakata, Akiyuki Tanizawa

Compressing DNNs is important for the real-world applications operating on resource-constrained devices. However, we typically observe drastic performance deterioration when changing model size after training is completed. Therefore, retraining is required to resume the performance of the compressed models suitable for different devices. In this paper, we propose Decomposable-Net (the network decomposable in any size), which allows flexible changes to model size without retraining. We decompose weight matrices in the DNNs via singular value decomposition and adjust ranks according to the target model size. Unlike the existing low-rank compression methods that specialize the model to a fixed size, we propose a novel backpropagation scheme that jointly minimizes losses for both of full- and low-rank networks. This enables not only to maintain the performance of a full-rank network {\it without retraining} but also to improve low-rank networks in multiple sizes. Additionally, we introduce a simple criterion for rank selection that effectively suppresses approximation error. In experiments on the ImageNet classification task, Decomposable-Net yields superior accuracy in a wide range of model sizes. In particular, Decomposable-Net achieves the top-1 accuracy of 73.2% with 0.27×MACs with ResNet-50, compared to Tucker decomposition (67.4% / 0.30×), Trained Rank Pruning (70.6% / 0.28×), and universally slimmable networks (71.4% / 0.26×).

PaperPDFCode

In Syntology View this paper on Syntology: its page in Syntology's graph, with its repositories and citations.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

ygcats/Scalable-Low-Rank-Compression-for-Neural-Networks officialmentioned in papertfNOASSERTION report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Image ClassificationLow-rank compression

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

PruningTuckER

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections