REVIEW 2 cited by
Towards Robust and Efficient Federated Low-Rank Adaptation with Heterogeneous Clients
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Federated fine-tuning for Large Language Models (LLMs) faces significant challenges due to the heavy communication overhead of transmitting large model updates. Although Low Rank Adaptation (LoRA) has been proposed as a solution, yet its application in federated learning is complicated by discordance in aggregation. Existing methods addressing this discordance often suffer from performance degradation at low ranks in heterogeneous data settings. In response, we introduce LoRA-A$^2$ (Low Rank Adaptation with Alternating freeze and Adaptive rank selection), which demonstrates robustness in challenging settings with low ranks and high data heterogeneity. Our experimental findings reveal that LoRA-A$^2$ maintains performance even under extreme heterogeneity and low rank conditions, achieving up to a significant reduction in uploaded parameters compared to full fine-tuning without compromising performance. This adaptive mechanism increases robustness and communication efficiency in federated fine-tuning, enabling the practical deployment of LLMs in resource-constrained environments.
Forward citations
Cited by 2 Pith papers
-
Convergence Analysis of Aggregation-Broadcast in LoRA-enabled Distributed Fine-Tuning
A unified convergence analysis of LoRA aggregation in federated learning shows Product-Sum aggregation converges globally at the optimal rate, while Sum-Product aggregation suffers from broadcast error from SVD truncation.
-
Federated Sketching LoRA: A Flexible Framework for Heterogeneous Collaborative Fine-Tuning of LLMs
Federated Sketching LoRA (FSLoRA) uses random row/column sketching of LoRA modules so each client updates a low-cost submatrix, with a convergence rate that scales with the sketching ratio.
Discussion (0). Continue with ORCID to comment.