Task-agnostic Low-rank Residual Adaptation for Efficient Federated Continual Fine-Tuning
Feng Yu, Jia Hu, Geyong Min

TL;DR
This paper introduces Fed-TaLoRA, a novel federated continual fine-tuning method that efficiently adapts large models to sequential tasks without task labels, reducing costs and mitigating forgetting.
Contribution
The paper proposes Fed-TaLoRA, a task-agnostic low-rank residual adaptation approach that improves federated continual learning by calibrating global models and avoiding task-specific modules.
Findings
Fed-TaLoRA outperforms strong baselines on four benchmarks.
It significantly reduces communication and computation costs.
The method effectively mitigates forgetting in non-IID federated settings.
Abstract
Federated Parameter-Efficient Fine-Tuning (Fed-PEFT) enables lightweight adaptation of large pre-trained models in federated learning settings by updating only a small subset of parameters. However, Fed-PEFT methods typically assume a fixed label space and static downstream tasks, which is restrictive in realistic application scenarios where clients continuously encounter new classes over time. This leads to an emerging problem, known as \emph{Federated Continual Fine-Tuning} (FCFT). In FCFT, clients collaboratively fine-tune a pre-trained model over a sequence of tasks, where each client observes disjoint sets of new classes over time, and task identity is unavailable at inference time. FCFT is challenging because it simultaneously suffers from severe forgetting under non-IID client data distributions, parameter growth and task-specific inference caused by task-wise modules, and…
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.
