Parameter-efficient fine-tuning methods, such as LoRA, offer a practical way to adapt large vision and language models to client tasks. However, this becomes particularly challenging under task-level heterogeneity in federated deployments. In this regime, personalization requires balancing general knowledge with personalized knowledge, yet existing approaches largely rely on heuristic mixing rules and lack theoretical justification. Moreover, prior model merging approaches are also computation and communication intensive, making the process inefficient in federated settings. In this work, we propose Potara, a principled framework for federated personalization that constructs a personalized model for each client by merging two complementary models: (i) a federated model capturing general knowledge, and (ii) a local model capturing personalized knowledge. Through the construct of linear mode connectivity, we show that the expected task loss admits a variance trace upper bound, whose minimization yields closed-form optimal mixing weights that guarantee a tighter bound for the merged model than for either the federated or local model alone. Experiments on vision and language benchmarks show that Potara consistently improves personalization while reducing communication, leading to a strong performance-communication trade-off.
Figure 1: Illustration of Potara . We train a FedIT model via FL and train local fine-tuning models. We obtain the final personalized model by weighted merging these FedIT and local models.
Method
Communication Overhead
FedIT
O(r(m+n)T)
FedSA
O(rnT)
FFA-LoRA
O(rmT)
FedALT
O(r(m+n)T)
FedDPA
O(r(m+n)T)
Potara
O(r(m+n)TFedIT)
Table 1: Communication Overhead Comparison.
Table 4
Figure 2: Performance-communication trade-off across different benchmarks. Potara ( t ) denotes our method where the FedIT model obtained at communication round t is used for merging. Potara achieves strong performance with substantially lower communication overhead than baselines.
Table 6
Figure 3: Ablation studies demonstrating the performance of Potara .
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
FLAN benchmark (Qwen3-4B-Instruct model)
Methods
Closed-book QA
Reading Comp.
Coreference
Paraphrase
Commonsense
NLI
Reading
Sentiment
Avg.
Local
69.53 ± 0.75
69.38 ± 2.81
88.01 ± 0.70
80.00 ± 3.56
87.62 ± 0.78
85.78 ± 2.18
73.87 ± 0.66
76.16 ± 1.69
78.79 ± 0.99
FFA-LoRA
71.00 ± 0.66
70.54 ± 0.66
77.18 ± 1.34
79.89 ± 0.57
85.65 ± 1.18
86.33 ± 1.18
73.57 ± 0.39
77.06 ± 0.74
77.65 ± 0.70
FedSA
69.54 ± 0.95
69.54 ± 1.09
87.78 ± 2.61
81.89 ± 0.87
84.05 ± 1.16
86.00 ± 1.19
72.72 ± 0.65
76.47 ± 0.98
78.50 ± 0.25
FedIT
69.96 ± 0.57
71.37 ± 0.63
83.19 ± 0.51
80.44 ± 1.40
85.37 ± 0.96
86.33 ± 1.25
73.78 ± 0.85
76.68 ± 0.56
78.39 ± 0.63
FedDPA
70.03 ± 0.19
70.57 ± 0.34
81.89 ± 1.37
81.44 ± 0.79
86.93 ± 1.71
87.55 ± 0.88
74.01 ± 0.02
76.45 ± 0.88
78.61 ± 0.29
Appendix
Table 6: ROUGE-1 performance on FLAN benchmark (Qwen3-4B-Instruct model).
Task
Dataset
Description
Closed-book QA
arc_challenge
Answer multiple-choice questions.
Reading Comp. w/ Commonsense
cosmos_qa
Reading comprehension with commonsense.
Coreference Resolution
definite_pronoun_resolution
Resolve ambiguous pronouns.
Paraphrase Detection
glue_qqp
Identify semantic equivalence.
Commonsense Reasoning
hellaswag
Choose the most plausible continuation.
Natural Language Inference
mnli
Infer relations between sentence pairs.
Appendix
Table 7: FLAN benchmark.
Client
Local
FFA-LoRA
FedSA
FedIT
FedDPA
Fisher Merging
Potara
Client 1
63.53 ± 2.22
44.37 ± 1.97
61.28 ± 2.27
59.52 ± 0.73
67.41 ± 2.92
62.00 ± 2.46
62.39 ± 3.91
Client 2
62.28 ± 5.39
49.25 ± 6.36
61.16 ± 5.72
61.35 ± 6.12
65.95 ± 6.74
61.39 ± 9.09
70.18 ± 5.12
Client 3
60.40 ± 0.23
45.24 ± 1.43
58.25 ± 2.07
64.25 ± 2.42
65.39 ± 3.34
59.64 ± 2.42
70.09 ± 1.34
Client 4
58.45 ± 2.62
39.74 ± 0.34
57.29 ± 1.19
56.98 ± 2.56
59.52 ± 0.55
62.54 ± 0.71
63.63 ± 1.26
Client 5
62.07 ± 2.18
50.88 ± 4.72
62.73 ± 2.31
66.00 ± 3.74
68.64 ± 1.89
66.22 ± 0.01
67.94 ± 4.36
Client 6
64.14 ± 0.67
47.09 ± 2.28
61.07 ± 0.85
65.06 ± 2.94
65.34 ± 2.65
59.56 ± 0.25
67.00 ± 0.09
Appendix
Table 8: Testing accuracy on personalized CIFAR-100 benchmark with 20 clients.
Client
Local
FFA-LoRA
FedSA
FedIT
FedALT
FedDPA
Potara
Client 1 (ARC-c)
71.80 ± 0.20
73.00 ± 0.80
70.60 ± 0.40
73.60 ± 0.00
73.50 ± 0.70
74.50 ± 0.90
74.80 ± 0.20
Client 2 (ARC-c)
70.50 ± 0.50
73.10 ± 0.30
72.20 ± 1.20
73.60 ± 0.00
72.40 ± 0.00
74.50 ± 0.10
75.20 ± 1.00
Client 3 (ARC-e)
85.80 ± 0.20
87.50 ± 0.50
86.20 ± 1.20
87.30 ± 0.70
85.90 ± 0.70
86.90 ± 0.30
88.50 ± 0.30
Client 4 (ARC-e)
86.70 ± 0.50
87.10 ± 0.50
85.90 ± 1.30
87.30 ± 0.70
85.00 ± 0.20
87.40 ± 0.60
87.90 ± 0.30
Client 5 (BoolQ)
65.20 ± 3.00
67.00 ± 0.60
61.60 ± 5.60
64.30 ± 3.50
66.70 ± 0.10
66.90 ± 0.10
65.60 ± 0.60
Client 6 (BoolQ)
67.90 ± 1.50
63.50 ± 1.70
64.90 ± 0.70
64.30 ± 3.50
65.50 ± 0.30
64.20 ± 3.00
66.70 ± 1.70
Appendix
Table 9: Testing accuracy on commonsense reasoning benchmark with 16 clients.
Figure 4: Client performance under various mixing weights. For each client, we construct a personalized model by merging a FedIT checkpoint at round 50,150, or 300 with a fixed Local model at round 300, and sweep the local mixing weight λFedIT (x-axis). Curves report the resulting client accuracy. The red dashed line marks the mixing weight calculated by our method for each client.
Federated parameter-efficient fine-tuning enables clients to adapt pre-trained models without sharing raw data or communicating the full model, but statistical heterogeneity makes a single global adapter insufficient for personalized prediction. Existing personalized methods typically use the same low-rank structure for both shared and private adaptation, overlooking their distinct requirements for aggregation and personalization. We propose FedLAFP, a role-aware framework that couples a compact, globally aggregated LoRA branch with a client-private, full-rank-capable RandLoRA branch. The shared branch provides an efficient interface for transferring common knowledge, whereas the private branch combines fixed random low-rank bases with learned scaling coefficients to provide expressive client-specific adaptation without additional communication. Client- and layer-specific mixing coefficients jointly fuse the two branches, and only the shared LoRA parameters are exchanged. A controlled linear study supports this role assignment: LoRA yields more aligned client updates and lower aggregation error, while RandLoRA more accurately recovers client-specific residuals. Experiments across four visual recognition benchmarks show that FedLAFP consistently outperforms local-only and federated LoRA baselines, achieving an average personalized accuracy of 86.93% and exceeding the best baseline average by 1.30 percentage points.
Mengjun Yi, Huaian Gu, Yinghao Ai +2
State Key Laboratory for Novel Software Technology · School of Artificial Intelligence · School of Computer Science +1
Federated Learning (FL) has emerged as a promising technique for training language models on distributed and private datasets of diverse tasks. However, aggregating models trained on heterogeneous tasks often degrades the overall performance of individual clients. To address this issue, Personalized FL (pFL) aims to create models tailored for each client's data distribution. Although these approaches improve local performance, they usually lack robustness in two aspects: (i) generalization: when clients must make predictions on unseen tasks, or face changes in their data distributions, and (ii) intra-client tasks interference: when a single client's data contains multiple distributions that may interfere with each other during local training. To tackle these two challenges, we propose FedRouter, a clustering-based pFL that builds specialized models for each task rather than for each client. FedRouter uses adapters to personalize models by employing two clustering mechanisms to associate adapters with specific tasks. A local clustering that associate adapters with task data samples and a global one that associates similar adapters from different clients to construct task-centric personalized models. Additionally, we propose an evaluation router mechanism that routes test samples to the best adapter based on the created clusters. Experiments comparing our method with existing approaches across a multitask dataset, FedRouter demonstrate strong resilience in these challenging scenarios performing up to 6.1% relatively better under tasks interference and up to 136% relative improvement under generalization evaluation.
Gabriel U. Talasso, Meghdad Kurmanji, Allan M. de Souza +2
Universidade Estadual de Campinas · University of Cambridge · Flower Labs
Federated fine-tuning of foundation models using Low-Rank Adaptation (LoRA) offers a communication efficient solution for distributed learning. However, existing federated LoRA methods suffer from two fundamental limitations: (1) structural aggregation bias, where independently averaging low rank factors fails to approximate the true combined update, and (2) client side initialization lag, as clients repeatedly reinitialize LoRA parameters across communication rounds, slowing convergence. We propose HyperLoRA, a unified framework that addresses both issues through amortized federated adaptation through hypernetwork-driven LoRA generation and product space aggregation. Instead of iterative per-client optimization, HyperLoRA employs a learned generator that maps client distribution signatures to LoRA initializations, effectively amortizing per client adaptation. On the server side, we introduce a learned aggregation module that directly synthesizes updates in the low-rank product space, eliminating the inconsistencies of factor-wise averaging. A lightweight residual correction module further improves stability under heterogenous (non-IID) client distributions.By replacing iterative optimization and heuristic averaging with learned operators, HyperLoRA jointly enables efficient personalization, unbiased aggregation, and faster convergence. Experiments on federated vision and vision-language benchmarks show that HyperLoRA achieves improved convergence speed, greater robustness to distribution shift, and stronger personalization performance compared to prior federated LoRA methods.