Pith. sign in

REVIEW 1 cited by

SuperLoRA: Parameter-Efficient Unified Adaptation of Multi-Layer Attention Modules

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 2403.11887 v1 pith:FVOBYXU4 submitted 2024-03-18 cs.CV cs.AIcs.LG

SuperLoRA: Parameter-Efficient Unified Adaptation of Multi-Layer Attention Modules

classification cs.CV cs.AIcs.LG
keywords loramodelssuperloravariantsadaptationdifferentlanguagelarge
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Low-rank adaptation (LoRA) and its variants are widely employed in fine-tuning large models, including large language models for natural language processing and diffusion models for computer vision. This paper proposes a generalized framework called SuperLoRA that unifies and extends different LoRA variants, which can be realized under different hyper-parameter settings. Introducing grouping, folding, shuffling, projecting, and tensor factoring, SuperLoRA offers high flexibility compared with other LoRA variants and demonstrates superior performance for transfer learning tasks especially in the extremely few-parameter regimes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Parameter-Efficient Fine-Tuning of Large Pretrained Models for Instance Segmentation Tasks

    cs.CV 2026-06 unverdicted novelty 5.0

    Empirical tests show adapters (2-3 per block) and LoRA on deformable attention achieve competitive instance segmentation with 1-6% parameters tuned versus 40-55% for full fine-tuning.