Challenge: Low-Rank Adaptation (LoRA) has emerged as a prominent technique for fine-tuning large foundation models.
Approach: They propose a low-rank Adaptation technique that harnesses the expressiveness of spectral bases to re-parameterize LoRA from a sparse spectral subspace.
Outcome: The proposed technique achieves greater efficiency with fewer parameters than baselines on various downstream tasks, including commonsense reasoning, math reasoning, and code generation.

Similar Papers

DenseLoRA: Dense Low-Rank Adaptation of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is an efficient approach for adapting large language models (LLMs) but many of the weights in these matrices are redundant, leading to inefficiencies in parameter utilization.
Approach: They propose a low-rank adaptation approach that fine-tunes two low-ranked matrices and adapts them through a dense low-Rank matrix, improving parameter utilization and adaptation efficiency.
Outcome: The proposed approach achieves 83.8% accuracy with only 0.01% of trainable parameters compared to LoRA's 80.8% with 0.70% of trainability parameters on LLaMA3-8B.
Why LoRA Fails to Forget: Regularized Low-Rank Adaptation Against Backdoors in Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is widely used for parameter-efficient fine-tuning of large language models, but is ineffective at removing backdoor behaviors from poisoned pretrained models when fine-timing on clean datasets.
Approach: They propose a low-rank Adaptation method which increases spectral strength and corrects alignment through clean-strengthened regularization and trigger-insensitive constraints.
Outcome: The proposed method significantly reduces attack success rates while maintaining clean accuracy.
Beyond Full Fine-tuning: Harnessing the Power of LoRA for Multi-Task Instruction Tuning (2024.lrec-main)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning algorithm for large-scale language models.
Approach: They conduct a systematic study of Low-Rank Adaptation (LoRA) on diverse tasks and rich resources with different learning capacities.
Outcome: The proposed algorithm can achieve remarkable performance in high-resource and multi-task scenarios, even comparable to full fine-tuning.
BeamLoRA: Beam-Constraint Low-Rank Adaptation (2025.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is one of the most efficient parameter-efficient fine-tuning methods.
Approach: They propose to conceptualize each LoRA module as a beam where each rank corresponds to a potential sub-solution.
Outcome: The proposed method improves performance on three base models and 12 datasets.
TLoRA: Task-aware Low Rank Adaptation of Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing low-rank Adaptation (LoRA) methods address only one factor, often at the cost of increased training complexity or reduced practical efficiency.
Approach: They propose a low-rank Adaptation framework that optimizes initialization and resource allocation at the outset of training.
Outcome: The proposed framework performs excellently across various tasks while reducing the number of trainable parameters.
Minimal Ranks, Maximum Confidence: Parameter-efficient Uncertainty Quantification for LoRA (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) enables parameter-efficient fine-tuning of large language models . standard LoRA lacks mechanisms for uncertainty quantification, leading to overconfident and poorly calibrated models.
Approach: They propose a parameter-efficient Bayesian LoRA method that decomposes weight updates into low-rank matrices.
Outcome: The proposed method achieves strong performance with improved calibration and generalization while maintaining computational efficiency.
Can Spectral-Clipping Enable Better Learning While Forgetting Less for Low-Rank Adaptation? (2026.acl-long)

Copied to clipboard

Challenge: In recent years, low-rank adaptation (LoRA) has emerged as a significant paradigm that freezes pre-trained weights and introduces small, learnable adapters instead of fine-tuning the full set of parameters.
Approach: They propose a low-rank adaptation approach that injects parameterized singular components with spectral clipping into the pre-trained model.
Outcome: The proposed method improves performance and retains pre-trained knowledge while preserving the weights of the model.
AlphaLoRA: Assigning LoRA Experts Based on Layer Training Quality (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies combine LoRA with Mixture-of-Experts (MoE) to improve performance in Large Language Models.
Approach: They propose a method to combine LoRA and Mixture-of-Experts (MoE) to improve performance in Large Language Models.
Outcome: The proposed method reduces redundancy in LoRA experts within the MoE architecture, and improves training quality across layers.
Sensitivity-LoRA : Low-Load Sensitivity-Based Fine-Tuning for Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a promising approach to adapting LLMs to specialized tasks . existing rank allocation techniques remain computationally inefficient and unstable .
Approach: They propose a low-rank adapted model that approximates model weight updates using low-ranked decomposition.
Outcome: The proposed method is limited by its uniform rank allocation to each incremental matrix . it leverages the second-order derivatives of the loss function to capture weight sensitivity .
G-LoRA: Global-Local Decoupled Low-Rank Adaptation (2026.findings-acl)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) improves the fine-tuning efficiency and performance of large language models.
Approach: They propose a low-rank adaptive approach that decomposes update matrix into global and local adapters and assigns them to local and global adapters.
Outcome: The proposed method achieves up to 2.7% accuracy improvement over LoRA and its variants on commonsense reasoning, mathematical reasoning, and code generation.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations