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. |
Similar Papers
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. |
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. |
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. |
Federated LoRA Fine-Tuning with Pipelined Error-Mitigated Aggregation and Matrix-Wise Freezing (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning large language models often suffer from biased model aggregation and are hindered by significant communication and computation burden. |
| Approach: | They propose a Federated low-rank adaptation system for large language models that leverages pipelined error-mitigated model aggregation and adaptive matrix-wise parameter freezing to mitigate aggregations. |
| Outcome: | The proposed system improves time-to-target by 2.17-8.48 on real-world datasets. |
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. |
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. |
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. |
Beyond Full Fine-tuning: Harnessing the Power of LoRA for Multi-Task Instruction Tuning (2024.lrec-main)
Copied to clipboard
Chunlei Xin, Yaojie Lu, Hongyu Lin, Shuheng Zhou, Huijia Zhu, Weiqiang Wang, Zhongyi Liu, Xianpei Han, Le Sun
| 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
Hao Zhang, Bo Huang, Zhenjia Li, Xi Xiao, Hui Yi Leong, Zumeng Zhang, Xinwei Long, Tianyang Wang, Hao Xu
| 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 . |
FedReFT: Federated Representation Fine-Tuning with All-But-Me Aggregation (2026.findings-eacl)
Copied to clipboard
| Challenge: | Representation Fine-Tuning (ReFT) adapts large pre-trained models by updating only a small subset of parameters. |
| Approach: | They propose a method that uses sparse intervention layers to steer hidden representations directly to capture rich semantic information. |
| Outcome: | The proposed approach outperforms PEFTs on commonsense reasoning, arithmetic reasoning, and GLUE benchmarks while maintaining a high parameter efficiency. |