mlsanityData to 14 Oct 2026

Training Acceleration of Low-Rank Decomposed Networks using Sequential Freezing and Rank Quantization

arXiv 2309.03824 ↗First posted 7 Sep 2023cs.LG cs.AI cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Low Rank Decomposition (LRD) is a model compression technique applied to the weight tensors of deep learning models in order to reduce the number of trainable parameters and computational complexity. However, due to high number of new layers added to the architecture after applying LRD, it may not lead to a high training/inference acceleration if the decomposition ranks are not small enough. The issue is that using small ranks increases the risk of significant accuracy drop after decomposition. In this paper, we propose two techniques for accelerating low rank decomposed models without requiring to use small ranks for decomposition. These methods include rank optimization and sequential freezing of decomposed layers. We perform experiments on both convolutional and transformer-based models. Experiments show that these techniques can improve the model throughput up to 60% during training and 37% during inference when combined together while preserving the accuracy close to that of the original models

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 14 of its 29 references that are in the map. First posted on arXiv 7 Sep 2023.

Builds on

14 of 29 references.

References · 14

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  4. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  5. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
  6. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  7. 2019Drop an Octave: Reducing Spatial Redundancy in Convolutional Neural Networks with Octave Convolutioncited by 140
  8. 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 120
  9. 2017Exploring the Regularity of Sparse Structure in Convolutional Neural Networkscited by 37
  10. 2019Fully Quantized Transformer for Machine Translationcited by 36
  11. 2021MATE-KD: Masked Adversarial TExt, a Companion to Knowledge Distillationcited by 27
  12. 2021A Short Study on Compressing Decoder-Based Language Modelscited by 16
2 more
  1. 2019A Simplified Fully Quantized Transformer for End-to-end Speech Recognitioncited by 11
  2. 2019MUSCO: Multi-Stage Compression of neural networkscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 1; 2026: 2.

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023Maestro: Uncovering Low-Rank Structures via Trainable Decomposition
  2. 2023Low Rank Optimization for Efficient Deep Learning: Making A Balance between Compact Architecture and Fast Training
  3. 2021A Highly Effective Low-Rank Compression of Deep Neural Networks with Modified Beam-Search and Modified Stable Rank
  4. 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM
  5. 2025Assigning Distinct Roles to Quantized and Low-Rank Matrices Toward Optimal Weight Decomposition
  6. 2024Compressing Large Language Models using Low Rank and Low Precision Decomposition
  7. 2026LRCC: Generalizing Low-Rank Compression with Conditional Computation
  8. 2025HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs