Concept Matching: Clustering-based Federated Continual Learning
Not on the map. Why?
Abstract (arXiv)
Federated Continual Learning (FCL) has emerged as a promising paradigm that combines Federated Learning (FL) and Continual Learning (CL). To achieve good model accuracy, FCL needs to tackle catastrophic forgetting due to concept drift over time in CL, and to overcome the potential interference among clients in FL. We propose Concept Matching (CM), a clustering-based framework for FCL to address these challenges. The CM framework groups the client models into concept model clusters, and then builds different global models to capture different concepts in FL over time. In each round, the server sends the global concept models to the clients. To avoid catastrophic forgetting, each client selects the concept model best-matching the concept of the current data for further fine-tuning. To avoid interference among client models with different concepts, the server clusters the models representing the same concept, aggregates the model weights in each cluster, and updates the global concept model with the cluster model of the same concept. Since the server does not know the concepts captured by the aggregated cluster models, we propose a novel server concept matching algorithm that effectively updates a global concept model with a matching cluster model. The CM framework provides flexibility to use different clustering, aggregation, and concept matching algorithms. The evaluation demonstrates that CM outperforms state-of-the-art systems and scales well with the number of clients and the model size.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 12 Nov 2023.
Builds on
27 of 42 references.
References · 27
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Experience Replay for Continual Learningcited by 1,074
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
- 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
- 2019Federated Learning with Differential Privacy: Algorithms and Performance Analysiscited by 528
- 2020An Efficient Framework for Clustered Federated Learningcited by 505
- 2020Flower: A Friendly Federated Learning Research Frameworkcited by 449
- 2017CORe50: a New Dataset and Benchmark for Continuous Object Recognitioncited by 287
- 2021Online Continual Learning in Image Classification: An Empirical Surveycited by 242
- 2018Selective Experience Replay for Lifelong Learningcited by 239
- 2018Task-Free Continual Learningcited by 219
15 more
- 2022FedDC: Federated Learning with Non-IID Data via Local Drift Decoupling and Correctioncited by 181
- 2022Fine-tuning Global Model via Data-Free Knowledge Distillation for Non-IID Federated Learningcited by 172
- 2020Federated Continual Learning with Weighted Inter-client Transfercited by 158
- 2019Uncertainty-based Continual Learning with Adaptive Regularizationcited by 144
- 2021Supervised Contrastive Replay: Revisiting the Nearest Class Mean Classifier in Online Class-Incremental Continual Learningcited by 140
- 2022Federated Class-Incremental Learningcited by 126
- 2018Continuous Learning in Single-Incremental-Task Scenarioscited by 109
- 2019SAFA: a Semi-Asynchronous Protocol for Fast Federated Learning with Low Overheadcited by 82
- 2023Better Generative Replay for Continual Federated Learningcited by 53
- 2021Concept drift detection and adaptation for federated and continual learningcited by 32
- 2021Towards Federated Learning on Time-Evolving Heterogeneous Datacited by 23
- 2022Continual Learning Based on OOD Detection and Task Maskingcited by 21
- 2023Complement Sparsification: Low-Overhead Model Pruning for Federated Learningcited by 12
- 2021FLSys: Toward an Open Ecosystem for Federated Learning Mobile Appscited by 6
- 2023Zone-based Federated Learning for Mobile Sensing Datacited by 4
Built on by
Citing papers per year: 2024: 1.
1 paper.