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.

Similar Papers

Towards Robust and Efficient Federated Low-Rank Adaptation with Heterogeneous Clients (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for federated fine-tuning for Large Language Models suffer from performance degradation at low ranks in heterogeneous data settings.
Approach: They propose a low-rank adaptive model with Alternating freeze and Adaptive rank selection which reduces the number of uploaded parameters by 99.8% .
Outcome: The proposed low-rank Adaptation maintains robustness even under extreme heterogeneity and low rank conditions while preserving communication efficiency.
RB-LoRA: Rank-Balanced Aggregation for Low-Rank Adaptation with Federated Fine-Tuning (2026.findings-eacl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) improves fine-tuning of foundation models by updating only compact adapter matrices . varying client device capabilities lead to different adapter ranks, causing rank heterogeneity that undermines aggregation.
Approach: They propose a rank-balanced aggregation framework that decomposes each update into rank-wise components and aligns them using analytically derived weights.
Outcome: Experiments on language and vision models show that RB-LoRA improves under one and three rounds of communication in federated learning environments.
FedEx-LoRA: Exact Aggregation for Federated and Efficient Fine-Tuning of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for low-rank averaging of LoRA adapters result in inexact updates.
Approach: They propose a method which adds a residual error term to the pre-trained frozen weight matrix to achieve exact updates with minimal computational and communication overhead.
Outcome: The proposed method achieves exact updates with minimal computational and communication overhead, preserving LoRA’s efficiency.
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.
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.
Localized Low-Rank Adaptation within Clustered Parameter Subspaces (2026.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) for large language models has been successful in various domains.
Approach: They propose to perform low-rank updates within clustered parameter subspaces . they group rows/columns of update matrix into locally coherent, uncorrelated subspace blocks .
Outcome: Empirical results show that low-rank Adaptation (LoRA) is better than global adaptations in various domains.
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.
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.
pFedGPT: Hierarchically Optimizing LoRA Aggregation Weights for Personalized Federated GPT Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models (LLMs) struggle with data heterogeneity and adapt shared global knowledge to individual client needs.
Approach: They propose a framework that leverages Hierarchical Bayesian Optimization (HBO) for fine-grained, personalized LoRA aggregation.
Outcome: The proposed framework achieves state-of-the-art (SOTA) performance on personalized FL benchmarks while introducing only minimal (approx. 4%) additional optimization overhead.

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