Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.03824 v1 pith:XRYVAZFO submitted 2023-09-07 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords decompositionmodelsrankdecomposedrankssmalltrainingacceleration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ECHO-LLaMA: Efficient Caching for High-Performance LLaMA Training

    cs.LG 2025-05 reject novelty 4.0 of 10

    Shared KV caching across the last 25% to 50% of layers, adapted incrementally from pretrained LLaMA weights, is claimed to improve training speed and inference throughput with little accuracy loss.

Pith tools