A multimodal federated graph unlearning framework built around target-specific representation decoupling that effectively removes requested information, preserves retained graph utility, and achieves a speedup over full retraining.
Abstract
Multimodal federated graph learning enables clients to collaboratively train graph models over structural, textual, and visual signals without sharing private local data. However, the presence of heterogeneous multimodal content also makes unlearning requests more frequent and fine-grained: users may delete accounts or interactions, remove a particular image or text while retaining the associated entity, or revoke the learned correspondence between retained modalities or graph attributes. Existing federated graph unlearning mainly handles entity/relation or client removal and cannot directly satisfy these multimodal requests. They introduce three challenges: removing only the requested information without damaging retained content, preventing the target from being recovered through remaining modalities or graph neighborhoods, and stopping related traces on other clients from re-entering the global model after aggregation. To address them, we propose \textsc{\textbf{MMFGU}}, a multimodal federated graph unlearning framework built around target-specific representation decoupling. \textsc{MMFGU} maps heterogeneous requests into unified target carriers, decouples requested representations while anchoring retained semantics, exposes and repairs propagated residuals with lightweight probes, and selectively purges affected clients through compact prototype and response signals. Experiments show that \textsc{MMFGU} effectively removes requested information, preserves retained graph utility, and achieves a $\boldsymbol{41.5\times}$ speedup over full retraining.
FedGAMMA is proposed, casting federated multimodal graph foundation learning as a two-stage semantic-structural alignment problem of federated pre-training and prompt-based fine-tuning, and outperforms competitive baselines accross multi-domain datasets on multiple tasks.
Xunkai Li, Guohao Fu, Yuming Ai et al.· 0 citations
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.
Ze-Kai Chen, Haodong Lu, Shi-Hao Li et al.· arXiv.org· 0 citations
ReCoG (Reciprocal Co-Evolution for Multimodal Graph Learning) is proposed, a new learning paradigm that tightly couples graph structure learning and multimodal representation learning through end-to-end reciprocal interaction and yields greater expressiveness than decoupled or two-stage formulations.
Federated multimodal graph learning with Topology-aware Cross-modal Routing (FedTCR) is proposed, the first systematic algorithm designed for FMGL and outperforms state-of-the-art baselines on both graph-centric and modality-centric tasks.
DIGEST is proposed, a multi-graph framework that propagates trainable ID embeddings on a denoised user—item graph and a fused modality-induced item—item graph, and interleaves message passing with dynamic graph refinement that iteratively reweights existing edges to suppress noisy connections.
Xiangyu Sai, M. Madadi, Sergio Escalera et al.· Annual International ACM SIG...· 0 citations
FedDUA is proposed, a novel disagreement-aware and uncertainty-guided framework for subgraph FL that first models cross-client semantic disagreement via a lightweight semantic anchor graph and derives adaptive aggregation weights for reliable global federated knowledge.
Keao Xi, Nan-Nan Wu, Yi-Ming Zhao et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.