解决多模态联邦图学习中的精准删除难题,支持细粒度数据清除。
MMFGU: Multimodal Federated Graph Unlearning

- 通过目标特异性表征解耦,实现只删指定信息不伤保留内容。
- 在真实场景下删除请求后仍保持图结构可用性,速度比重训练快41.5倍。
- 适合需要隐私合规与细粒度数据管理的多模态图学习应用。
多模态联邦图学习使客户端可在不共享私有数据的前提下,协同利用结构、文本和视觉信号训练图模型。然而,异构的多模态内容导致删除请求更频繁且更细粒度:用户可能注销账号或移除特定图文,但保留实体本身,或撤销保留模态间的关联关系。现有联邦图学习主要处理实体/关系或客户端整体移除,无法满足此类多模态请求。其面临三大挑战:仅删除请求内容而不破坏保留信息、防止目标通过剩余模态或图邻域恢复、阻止其他客户端上的相关痕迹在聚合后重新进入全局模型。为此,我们提出 extsc{MMFGU},一种基于目标特异性表征解耦的多模态联邦图删除框架。该框架将异构请求统一为目标载体,解耦请求表征同时锚定保留语义,用轻量探针暴露并修复传播残余,并通过紧凑原型与响应信号选择性清理受影响客户端。实验表明, extsc{MMFGU} 能有效删除请求内容,保持保留图的可用性,且相比全量重训练提速 41.5 倍。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。