FedGTEA: Federated Class-Incremental Learning with Gaussian Task Embedding and Alignment
Not on the map. Why?
Abstract (arXiv)
We introduce a novel framework for Federated Class Incremental Learning, called Federated Gaussian Task Embedding and Alignment (FedGTEA). FedGTEA is designed to capture task-specific knowledge and model uncertainty in a scalable and communication-efficient manner. At the client side, the Cardinality-Agnostic Task Encoder (CATE) produces Gaussian-distributed task embeddings that encode task knowledge, address statistical heterogeneity, and quantify data uncertainty. Importantly, CATE maintains a fixed parameter size regardless of the number of tasks, which ensures scalability across long task sequences. On the server side, FedGTEA utilizes the 2-Wasserstein distance to measure inter-task gaps between Gaussian embeddings. We formulate the Wasserstein loss to enforce inter-task separation. This probabilistic formulation not only enhances representation learning but also preserves task-level privacy by avoiding the direct transmission of latent embeddings, aligning with the privacy constraints in federated learning. Extensive empirical evaluations on popular datasets demonstrate that FedGTEA achieves superior classification performance and significantly mitigates forgetting, consistently outperforming strong existing baselines.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 30 references that are in the map. First posted on arXiv 14 Oct 2025.
Builds on
23 of 30 references.
References · 23
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2016Conditional Image Synthesis With Auxiliary Classifier GANscited by 562
- 2017Differentially Private Federated Learning: A Client Level Perspectivecited by 451
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
11 more
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
- 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
- 2020Federated Continual Learning with Weighted Inter-client Transfercited by 158
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 144
- 2023TARGET: Federated Class-Continual Learning via Exemplar-Free Distillationcited by 64
- 2023Better Generative Replay for Continual Federated Learningcited by 53
- 2023A Data-Free Approach to Mitigate Catastrophic Forgetting in Federated Class Incremental Learning for Vision Taskscited by 41
- 2024Towards Efficient Replay in Federated Incremental Learningcited by 33
- 2023Fed-CPrompt: Contrastive Prompt for Rehearsal-Free Federated Continual Learningcited by 12
- 2025Accurate Forgetting for Heterogeneous Federated Continual Learningcited by 11
- 2023Federated Class-Incremental Learning with Promptingcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.