Name
Abstract | ||
|---|---|---|
Graph Neural Networks (GNNs) have achieved remarkable performance by taking advantage of graph data. The success of GNN models always depends on rich features and adjacent relationships. However, in practice, such data are usually isolated by different data owners (clients) and thus are likely to be Non-Independent and Identically Distributed (Non-IID). Meanwhile, considering the limited network status of data owners, hyper-parameters optimization for collaborative learning approaches is time-consuming in data isolation scenarios. To address these problems, we propose an Automated Separated-Federated Graph Neural Network (ASFGNN) learning paradigm. ASFGNN consists of two main components, i.e., the training of GNN and the tuning of hyper-parameters. Specifically, to solve the data Non-IID problem, we first propose a separated-federated GNN learning model, which decouples the training of GNN into two parts: the message passing part that is done by clients separately, and the loss computing part that is learnt by clients federally. To handle the time-consuming parameter tuning problem, we leverage Bayesian optimization technique to automatically tune the hyper-parameters of all the clients. We conduct experiments on benchmark datasets and the results demonstrate that ASFGNN significantly outperforms the naive federated GNN, in terms of both accuracy and parameter-tuning efficiency. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s12083-021-01074-w | PEER-TO-PEER NETWORKING AND APPLICATIONS |
Keywords | DocType | Volume |
Graph neural network, Federated learning, Bayesian optimization, Privacy preserving | Journal | 14 |
Issue | ISSN | Citations |
3 | 1936-6442 | 1 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Longfei Zheng | 1 | 2 | 1.38 |
| Jun Zhou | 2 | 10 | 2.89 |
| Chaochao Chen | 3 | 115 | 19.04 |
| Bingzhe Wu | 4 | 18 | 6.41 |
| Li Wang | 5 | 11 | 11.78 |
| Benyu Zhang | 6 | 2 | 1.04 |