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.

Similar Papers

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.
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 .
LoRAN: Improved Low-Rank Adaptation by a Non-Linear Transformation (2024.findings-emnlp)

Copied to clipboard

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.
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.
Towards Federated Low-Rank Adaptation of Language Models with Rank Heterogeneity (2025.naacl-short)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is an efficient alternative to full-weight adaptation in federated fine-tuning of language models, significantly reducing computational costs.
Approach: They propose a low-rank adaptation method that freezes original weights and trains only the update parametrized as a product of two low-ranked matrices.
Outcome: The proposed method accelerates convergence and enhances the global model’s predictive performance.
How Much Knowledge Can You Pack into a LoRA Adapter without Harming LLM? (2025.findings-naacl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is a popular training technique for updating or domain-specific adaptation of Large Language Models (LLMs).
Approach: They propose to use low-rank adaptation to incorporate new facts into the LLM without compromising previously learned knowledge.
Outcome: The proposed approach is harmful because the model's performance declines after such fine-tuning.
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.
MoRE: A Mixture of Low-Rank Experts for Adaptive Multi-Task Learning (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) have revolutionized various domains, offering unprecedented performance across numerous tasks.
Approach: They propose a new Mixture of Low-Rank Experts (MoRE) for multi-task PEFT to improve performance of LLMs with fewer parameters.
Outcome: The proposed method improves performance over multiple tasks and no additional inference cost.
Fine-tuning Large Language Models with Limited Data: A Survey and Practical Guide (2026.tacl-1)

Copied to clipboard

Challenge: Pre-trained language models provide strong foundations, but effective adaptation under data scarcity requires efficient and efficient fine-tuning techniques.
Approach: They propose to review parameter-efficient fine-tuning techniques that lower training and deployment costs and domain and cross-lingual adaptation methods for both encoder and decoder models.
Outcome: The proposed techniques lower training and deployment costs, domain and cross-lingual adaptation methods, and model specialization strategies.

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