Fed-CPrompt: Contrastive Prompt for Rehearsal-Free Federated Continual Learning

Gaurav Bagwe, Xiaoyong Yuan, Miao Pan, Lan Zhang
7/10/2023
cs.LGcs.AIcs.CV

No confident code implementation found for this paper.

Abstract

Federated continual learning (FCL) learns incremental tasks over time from confidential datasets distributed across clients. This paper focuses on rehearsal-free FCL, which has severe forgetting issues when learning new tasks due to the lack of access to historical task data. To address this issue, we propose Fed-CPrompt based on prompt learning techniques to obtain task-specific prompts in a communication-efficient way. Fed-CPrompt introduces two key components, asynchronous prompt learning, and contrastive continual loss, to handle asynchronous task arrival and heterogeneous data distributions in FCL, respectively. Extensive experiments demonstrate the effectiveness of Fed-CPrompt in achieving SOTA rehearsal-free FCL performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bagwe2023fedcprompt,
  title  = {Fed-CPrompt: Contrastive Prompt for Rehearsal-Free Federated Continual Learning},
  author = {Gaurav Bagwe and Xiaoyong Yuan and Miao Pan and Lan Zhang},
  year   = {2023},
  eprint = {2307.04869},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.04869v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.04869.svg)](https://codeofpaper.com/paper/2307.04869)

Discussion