Skip to content

FedOGL: Combating Catastrophic Forgetting in Federated Open-World Multimodal Graph Learning

Jul 2026 · arXiv.org · Vol abs/2607.27665 · 0 citations · 20 references
Computer Science

TL;DR

FedOGL preserves historical decision behavior through replay and task-start distillation, while protecting graph-propagation memory via projection onto a globally shared structure basis via projection onto a globally shared structure basis.

Abstract

Federated graph learning enables collaborative training over decentralized graph data without sharing raw graph information. As such risks evolve, clients must learn emerging classes from private multimodal graph streams, retain historical categories, and reject samples outside the known class space. In this setting, clients must learn emerging classes from private multimodal graph streams while preserving historical categories and rejecting samples outside the current known class space. The core challenge is catastrophic forgetting, which in federated multimodal graphs is not merely a classifier-level failure: old knowledge can be erased through modality-semantic overwriting, topology-induced structural erosion, and federated memory fragmentation. To address this challenge, we propose \textbf{FedOGL}, a semantic-structural memory preservation framework. On the client side, FedOGL preserves historical decision behavior through replay and task-start distillation, while protecting graph-propagation memory via projection onto a globally shared structure basis. On the server side, FedOGL maintains and transfers compact category prototypes to facilitate cross-client knowledge sharing without exposing raw graph data. Extensive experiments demonstrate that, compared with the best-performing baselines, FedOGL reduces performance degradation caused by catastrophic forgetting by \textbf{42.67\%}, while maintaining or improving performance on downstream tasks.

View source

Similar papers

Book Open access Aug 2026

FedFST: Mitigating Spectral Catastrophic Forgetting in Federated Graph Continual Learning

FedFST is a spectral-aware framework that mitigates dual spectral forgetting in Federated Graph Continual Learning, and comprises Historical High-Frequency Knowledge Restoration to reconstruct and preserve high-frequency inconsistency knowledge, and Historical Low-Frequency Semantic Transfer to stabilize low-frequency...

Hanyao Guo, Zihan Tan, Wen-Ke Huang et al. · 0 citations
#federated learning Open access Aug 2026

Structure-aware federated hypergraph continual learning

FedSHARP (Federated Structure-aware Hypergraph Anchored Representation Preservation), a structure-aware framework for federated hypergraph continual learning, is proposed and evaluated, demonstrating that preserving both node-level semantics and high-order hyperedge structures is important for federated hypergraph cont...

Yanxin Hu, Xiaoman Liu, Zhenzhen Xie et al. · 0 citations
#machine learning Preprint Sep 2026

ReSCENE: Server-Side Replay for Structural Mitigation of Catastrophic Forgetting in Federated Continual Learning

Federated continual learning must integrate new tasks over time without losing earlier-task knowledge. Most existing methods attach an anti-forgetting mechanism to the client-trained, server-aggregated loop of federated learning, which holds back new learning to preserve earlier knowledge and burdens resource-constrain...

Sung-Min Kang, Zheng-Zhong Tu, Sun-Woo Lee · 0 citations
Open access Sep 2026

FedTIP: Communication-Efficient Federated Temporal Prompting for Few-Shot Dynamic Graph Adaptation

Temporal interaction streams are often distributed across data owners, while downstream labels and communication budgets remain limited. Existing temporal graph prompts typically adapt at a centralized trainer, whereas federated graph methods commonly exchange larger trainable states. This paper presents FedTIP, a prom...

Xi-Jun Wu, Xin-Ming Zhang · 0 citations
#artificial intelligence Preprint Aug 2026

Let Prompts Bridge Defense Knowledge: Transferable Graph Purification via Vulnerability-Aware GPL

This work proposes a transferable graph purification scheme, named ProGAP, to bridge adversarial defense knowledge via vulnerability-aware graph prompt learning, and achieves 1%-9% improvement, and reduces the time consumption by up to 2.2x.

Shuo-Min Xue, Jing-Yuan Li, Ju Jia et al. · 0 citations
Conference Open access Sep 2026

FedFINFO: A General Full-Informativeness Federated Graph Learning from Open Cross-Domain Data

This work proposes a counterfactual multi-view framework to explicitly learn a structure masker for extracting consensus subgraphs and proposes a history-aware adaptive multi-channel aggregation mechanism to enable dynamic and personalized sharing driven by channel similarity while preventing collaborative oscillation.

Wan Zhang, Xiao-Qian Jiang, Ye Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.