Graph Federated Unlearning for Privacy Preservation
Ruotong Ma, Wentao Yu, Qizhou Wang, Jie Yang, Chen Gong

TL;DR
This paper proposes a novel graph federated unlearning method to effectively remove user data for privacy preservation, addressing challenges of performance degradation and topology maintenance in decentralized graph learning.
Contribution
It introduces two key adjustments—orthogonal unlearning updates and virtual clients—to improve unlearning effectiveness without sacrificing model performance in GFL.
Findings
Our approach outperforms seven baseline methods in privacy preservation.
The method maintains high model accuracy after user data removal.
A new membership inference framework validates privacy guarantees.
Abstract
Graph federated learning (GFL) facilitates decentralized training on distributed graph data while keeping sensitive user information local, aligning with policies such as GDPR and CCPA that grant users the right to freely join or withdraw from learning systems. However, even decentralized, user information can persist after quitting, potentially propagating to central servers and then redistributing to malicious clients. This privacy leakage during user withdrawal, despite its importance, has received seldom attention in GFL. To fill the gap, we explore the potential of machine unlearning (MU) to thoroughly remove user information. However, classical MU methods are known to degrade overall performance, a problem that is exacerbated in GFL due to local message passing and global model collaboration. To this end, we make two adjustments to mitigate this challenge for GFL. First, we ensure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
