# Catastrophic Forgetting Resilient One-Shot Incremental Federated Learning

Source: [Catastrophic Forgetting Resilient One-Shot Incremental Federated Learning](<https://www.sota2.com/research/paper/6997eac409c33900fcd767de>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-02-21T05:00:09.597Z

Authors: Obaidullah Zaland, Zulfiqar Ahmad Khan, Monowar Bhuyan

Published: 2026-02-19T18:44:23.000Z

## Abstract

Modern big-data systems generate massive, heterogeneous, and geographically dispersed streams that are large-scale and privacy-sensitive, making centralization challenging. While federated learning (FL) provides a privacy-enhancing training mechanism, it assumes a static data flow and learns a collaborative model over multiple rounds, making learning with \\textit{incremental} data challenging in limited-communication scenarios. This paper presents One-Shot Incremental Federated Learning (OSI-FL), the first FL framework that addresses the dual challenges of communication overhead and catastrophic forgetting. OSI-FL communicates category-specific embeddings, devised by a frozen vision-language model (VLM) from each client in a single communication round, which a pre-trained diffusion model at the server uses to synthesize new data similar to the client's data distribution. The synthesized samples are used on the server for training. However, two challenges still persist: i) tasks arriving incrementally need to retrain the global model, and ii) as future tasks arrive, retraining the model introduces catastrophic forgetting. To this end, we augment training with Selective Sample Retention (SSR), which identifies and retains the top-p most informative samples per category and task pair based on sample loss. SSR bounds forgetting by ensuring that representative retained samples are incorporated into training in further iterations. The experimental results indicate that OSI-FL outperforms baselines, including traditional and one-shot FL approaches, in both class-incremental and domain-incremental scenarios across three benchmark datasets.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Domain-Incremental Classification on NICO\_U (test)](<https://www.sota2.com/research/sota/domain-incremental-classification-on-nico_u-test.md>): Domain-Incremental Classification; NICO\_U (test); Accuracy (T1): 59.98.

- [Domain-Incremental Classification on NICO\_C (test)](<https://www.sota2.com/research/sota/domain-incremental-classification-on-nico_c-test.md>): Domain-Incremental Classification; NICO\_C (test); Accuracy (T1): 61.78.

- [Class-incremental image classification on NICO++ U (test)](<https://www.sota2.com/research/sota/class-incremental-image-classification-on-nico-plus-plus-u-test.md>): Class-incremental image classification; NICO++ U (test); Accuracy (T1): 89.96.

- [Class-incremental image classification on NICO++ C (test)](<https://www.sota2.com/research/sota/class-incremental-image-classification-on-nico-plus-plus-c-test.md>): Class-incremental image classification; NICO++ C (test); Accuracy (T1): 79.67.

- [Domain-Incremental Classification on OpenImage (test)](<https://www.sota2.com/research/sota/domain-incremental-classification-on-openimage-test.md>): Domain-Incremental Classification; OpenImage (test); Accuracy (T1): 53.5.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2602.17625>)

[PDF](<https://arxiv.org/pdf/2602.17625.pdf>)
