Adaptive Rank Allocation for Federated Parameter-Efficient Fine-Tuning of Language Models
Fei Wu, Jia Hu, Geyong Min, Shiqiang Wang

TL;DR
FedARA introduces an adaptive rank allocation framework for federated fine-tuning of language models, improving performance, communication efficiency, and resource usage across heterogeneous devices.
Contribution
It proposes a novel adaptive rank allocation method using truncated SVD, dynamic rank adjustment, and module pruning to enhance federated parameter-efficient fine-tuning.
Findings
Outperforms baselines by 6.95% to 8.49% in accuracy.
Improves communication efficiency by 2.40×.
Reduces training time and energy consumption by up to 48.90% and 46.95%.
Abstract
Pre-trained Language Models (PLMs) have demonstrated their superiority and versatility in modern Natural Language Processing (NLP), effectively adapting to various downstream tasks through further fine-tuning. Federated Parameter-Efficient Fine-Tuning (FedPEFT) has emerged as a promising solution to address privacy and efficiency challenges in distributed training for PLMs on resource-constrained local devices. However, our measurements reveal two key limitations of FedPEFT: heterogeneous data across devices exacerbates performance degradation of low-rank adaptation, and a fixed parameter configuration results in communication inefficiency. To overcome these limitations, we propose FedARA, a novel adaptive rank allocation framework for federated parameter-efficient fine-tuning of language models. Specifically, FedARA employs truncated Singular Value Decomposition (SVD) adaptation to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsPruning
