Pith. sign in

REVIEW 3 cited by

PC-LoRA: Low-Rank Adaptation for Progressive Model Compression with Knowledge Distillation

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 2406.09117 v1 pith:3RBEX6JI submitted 2024-06-13 cs.CV cs.AI

classification cs.CVcs.AI
keywords compressionlow-rankweightslorapc-lorapre-trainedfine-tuningmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Low-rank adaption (LoRA) is a prominent method that adds a small number of learnable parameters to the frozen pre-trained weights for parameter-efficient fine-tuning. Prompted by the question, ``Can we make its representation enough with LoRA weights solely at the final phase of finetuning without the pre-trained weights?'' In this work, we introduce Progressive Compression LoRA~(PC-LoRA), which utilizes low-rank adaptation (LoRA) to simultaneously perform model compression and fine-tuning. The PC-LoRA method gradually removes the pre-trained weights during the training process, eventually leaving only the low-rank adapters in the end. Thus, these low-rank adapters replace the whole pre-trained weights, achieving the goals of compression and fine-tuning at the same time. Empirical analysis across various models demonstrates that PC-LoRA achieves parameter and FLOPs compression rates of 94.36%/89.1% for vision models, e.g., ViT-B, and 93.42%/84.2% parameters and FLOPs compressions for language models, e.g., BERT.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. LatentLLM: Attention-Aware Joint Tensor Compression

    cs.LG 2025-05 conditional novelty 6.0 of 10

    LatentLLM compresses pretrained LLMs and multimodal models with attention-aware joint low-rank tensor decomposition, outperforming SVD-based baselines on OPT perplexity and LLaVA ScienceQA.

  2. TuneComp: Joint Fine-tuning and Compression for Large Foundation Models

    cs.LG 2025-05 conditional novelty 5.0 of 10

    Jointly fine-tuning and compressing a ViT into pruned low-rank factors with progressive distillation achieves better accuracy for smaller parameter counts than sequential fine-tune-then-compress pipelines on CIFAR-100.

  3. $\mu$-MoE: Test-Time Pruning as Micro-Grained Mixture-of-Experts

    cs.LG 2025-05 conditional novelty 4.0 of 10

    Test-time Wanda pruning, reframed as a mixture of micro-experts, adapts the sparse weight mask to each prompt and improves perplexity and VQA accuracy over static pruning baselines.

Pith tools