Challenge: Recent methods for fine-tuning large language models have shown great improvements on a wide range of NLP tasks.
Approach: They propose to introduce a non-linear transformation to improve performance of adapters by introducing a low-rank adaptation to fit the accumulated weight updates.
Outcome: The proposed method outperforms a baseline on SAMSum and 20 Newsgroups tasks and even improves the classification task by 1.95 points when a lower rank is applied.

Similar Papers

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 .
Low-Rank Adaptation for Multilingual Summarization: An Empirical Study (2024.findings-naacl)

Copied to clipboard

Challenge: Pre-trained Large Language Models have significantly advanced NLP, but their ever-increasing size poses significant challenges for conventional fine-tuning.
Approach: They investigate the potential of Low-Rank Adaptation (LoRA) in multilingual summarization, a task that is challenging and relatively unexplored.
Outcome: The proposed method outperforms full fine-tuning and cross-lingual transfer strategies in multilingual summarization tasks.
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.
Sparse Low-rank Adaptation of Pre-trained Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning pre-trained large language models in a parameter-efficient manner are gaining traction within the research community.
Approach: They propose a method of low-rank adaptation that enables dynamic adjustments to the intrinsic rank during the adaptation process.
Outcome: The proposed approach outperforms the current method with a fixed and unalterable intrinsic rank and a low-rank adaptation process.
LoRMA: Low-Rank Multiplicative Adaptation for LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models have shown impressive generalization capabilities, but can be expensive to fine-tune due to high computational costs.
Approach: They propose a low-rank multiplicative Adaptation technique that shifts the paradigm of additive updates to a richer space of matrix multiplicative transformations.
Outcome: The proposed approach overcomes computational complexity and rank bottlenecks in terms of matrix multiplication metrics.
SOS-LoRA: Static Orthogonal-Subspace Low-Rank Adaptation with Fixed Multi-Scale Scaling (2026.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning method for large language models.
Approach: They propose a drop-in extension that reparameterizes a rank-rtot update as a sum of K *static* low-rank experts.
Outcome: Experiments on reasoning and knowledge-intensive benchmarks show consistent gains over matched-budget LoRA.
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.
NormAL LoRA: What is the perfect size? (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are crucial for enabling intelligent experiences across applications.
Approach: They propose a low-rank adaptive localization method that uses rank-norm regularization to determine the optimal rank for each weight matrix.
Outcome: NormAL LoRA reduces adapter parameters by 37% while preserving full fine-tuning performance.
DyLoRA: Parameter-Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptation (2023.eacl-main)

Copied to clipboard

Challenge: Pre-training/fine-tuning of pre-training models has become more expensive and resource-hungry.
Approach: They propose a low-rank adaptation technique that trains LoRA blocks for a range of ranks instead of a single rank.
Outcome: The proposed method trains LoRA blocks for a range of ranks instead of a single rank . it can train dynamic search-free models with DyLoRA at least 4 to 7 times faster than LoRA .
Astra: Activation-Space Tail-Eigenvector Low-Rank Adaptation of Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning pre-trained models are limited due to suboptimal activation subspaces.
Approach: They propose a method that leverages tail eigenvectors of model output activations to construct low-rank adapters.
Outcome: The proposed method outperforms existing methods across 16 benchmarks and surpasses full fine-tuning in certain scenarios.

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