The reviewed record of science sign in
Pith

arxiv: 2304.03626 · v1 · pith:VU3PEARV · submitted 2023-04-07 · cs.LG · cs.CV

Asynchronous Federated Continual Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VU3PEARVrecord.jsonopen to challenge →

classification cs.LG cs.CV
keywords learningfederatedasynchronouscontinualdifferenttasksclientfedspace
0
0 comments X
read the original abstract

The standard class-incremental continual learning setting assumes a set of tasks seen one after the other in a fixed and predefined order. This is not very realistic in federated learning environments where each client works independently in an asynchronous manner getting data for the different tasks in time-frames and orders totally uncorrelated with the other ones. We introduce a novel federated learning setting (AFCL) where the continual learning of multiple tasks happens at each client with different orderings and in asynchronous time slots. We tackle this novel task using prototype-based learning, a representation loss, fractal pre-training, and a modified aggregation policy. Our approach, called FedSpace, effectively tackles this task as shown by the results on the CIFAR-100 dataset using 3 different federated splits with 50, 100, and 500 clients, respectively. The code and federated splits are available at https://github.com/LTTM/FedSpace.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.