Pith. sign in

REVIEW 2 cited by

ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks

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 2401.10341 v1 pith:ZZP6ZBGG submitted 2024-01-18 cs.CV cs.AI

classification cs.CVcs.AI
keywords low-ranktrainingcnnscompressionelrtmodelsbeencompact
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Low-rank compression, a popular model compression technique that produces compact convolutional neural networks (CNNs) with low rankness, has been well-studied in the literature. On the other hand, low-rank training, as an alternative way to train low-rank CNNs from scratch, has been exploited little yet. Unlike low-rank compression, low-rank training does not need pre-trained full-rank models, and the entire training phase is always performed on the low-rank structure, bringing attractive benefits for practical applications. However, the existing low-rank training solutions still face several challenges, such as a considerable accuracy drop and/or still needing to update full-size models during the training. In this paper, we perform a systematic investigation on low-rank CNN training. By identifying the proper low-rank format and performance-improving strategy, we propose ELRT, an efficient low-rank training solution for high-accuracy, high-compactness, low-rank CNN models. Our extensive evaluation results for training various CNNs on different datasets demonstrate the effectiveness of ELRT.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. FGFP: A Fractional Gaussian Filter and Pruning for Deep Neural Networks Compression

    cs.LG 2025-07 conditional novelty 5.0 of 10

    FGFP combines seven-parameter fractional Gaussian filters with adaptive unstructured pruning to compress CNNs by 69-97% with only about 1-2% accuracy loss.

  2. HOFT: Householder Orthogonal Fine-tuning

    cs.LG 2025-05 conditional novelty 5.0 of 10

    HOFT and SHOFT fine-tune foundation models with two Householder-built orthogonal matrices, matching or beating LoRA, DoRA, OFT, BOFT and HRA on reasoning, translation, image generation and math.

Pith tools