Saved in:
Bibliographic Details
Main Authors: Yan, Bo, He, Sihao, Yang, Cheng, Liu, Shang, Cao, Yang, Shi, Chuan
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2405.03911
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912162373435392
author Yan, Bo
He, Sihao
Yang, Cheng
Liu, Shang
Cao, Yang
Shi, Chuan
author_facet Yan, Bo
He, Sihao
Yang, Cheng
Liu, Shang
Cao, Yang
Shi, Chuan
contents Graph condensation (GC), which reduces the size of a large-scale graph by synthesizing a small-scale condensed graph as its substitution, has benefited various graph learning tasks. However, existing GC methods rely on centralized data storage, which is unfeasible for real-world decentralized data distribution, and overlook data holders' privacy-preserving requirements. To bridge this gap, we propose and study the novel problem of federated graph condensation (FGC) for graph neural networks (GNNs). Specifically, we first propose a general framework for FGC, where we decouple the typical gradient matching process for GC into client-side gradient calculation and server-side gradient matching, integrating knowledge from multiple clients' subgraphs into one smaller condensed graph. Nevertheless, our empirical studies show that under the federated setting, the condensed graph will consistently leak data membership privacy, i.e., the condensed graph during federated training can be utilized to steal training data under the membership inference attack (MIA). To tackle this issue, we innovatively incorporate information bottleneck principles into the FGC, which only needs to extract partial node features in one local pre-training step and utilize the features during federated training. Theoretical and experimental analyses demonstrate that our framework consistently protects membership privacy during training. Meanwhile, it can achieve comparable and even superior performance against existing centralized GC and federated graph learning (FGL) methods.
format Preprint
id arxiv_https___arxiv_org_abs_2405_03911
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Federated Graph Condensation with Information Bottleneck Principles
Yan, Bo
He, Sihao
Yang, Cheng
Liu, Shang
Cao, Yang
Shi, Chuan
Machine Learning
Artificial Intelligence
Cryptography and Security
Distributed, Parallel, and Cluster Computing
Graph condensation (GC), which reduces the size of a large-scale graph by synthesizing a small-scale condensed graph as its substitution, has benefited various graph learning tasks. However, existing GC methods rely on centralized data storage, which is unfeasible for real-world decentralized data distribution, and overlook data holders' privacy-preserving requirements. To bridge this gap, we propose and study the novel problem of federated graph condensation (FGC) for graph neural networks (GNNs). Specifically, we first propose a general framework for FGC, where we decouple the typical gradient matching process for GC into client-side gradient calculation and server-side gradient matching, integrating knowledge from multiple clients' subgraphs into one smaller condensed graph. Nevertheless, our empirical studies show that under the federated setting, the condensed graph will consistently leak data membership privacy, i.e., the condensed graph during federated training can be utilized to steal training data under the membership inference attack (MIA). To tackle this issue, we innovatively incorporate information bottleneck principles into the FGC, which only needs to extract partial node features in one local pre-training step and utilize the features during federated training. Theoretical and experimental analyses demonstrate that our framework consistently protects membership privacy during training. Meanwhile, it can achieve comparable and even superior performance against existing centralized GC and federated graph learning (FGL) methods.
title Federated Graph Condensation with Information Bottleneck Principles
topic Machine Learning
Artificial Intelligence
Cryptography and Security
Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2405.03911