Pith. sign in

REVIEW 1 cited by

FedGraph: Federated Graph Learning with Intelligent Sampling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.01370 v1 pith:FU4QAM64 submitted 2021-11-02 cs.LG cs.DC

classification cs.LGcs.DC
keywords graphlearningfedgraphfederatedclientssamplingtrainingaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning has attracted much research attention due to its privacy protection in distributed machine learning. However, existing work of federated learning mainly focuses on Convolutional Neural Network (CNN), which cannot efficiently handle graph data that are popular in many applications. Graph Convolutional Network (GCN) has been proposed as one of the most promising techniques for graph learning, but its federated setting has been seldom explored. In this paper, we propose FedGraph for federated graph learning among multiple computing clients, each of which holds a subgraph. FedGraph provides strong graph learning capability across clients by addressing two unique challenges. First, traditional GCN training needs feature data sharing among clients, leading to risk of privacy leakage. FedGraph solves this issue using a novel cross-client convolution operation. The second challenge is high GCN training overhead incurred by large graph size. We propose an intelligent graph sampling algorithm based on deep reinforcement learning, which can automatically converge to the optimal sampling policies that balance training speed and accuracy. We implement FedGraph based on PyTorch and deploy it on a testbed for performance evaluation. The experimental results of four popular datasets demonstrate that FedGraph significantly outperforms existing work by enabling faster convergence to higher accuracy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks

    cs.LG 2024-12 reject novelty 6.0 of 10

    FedGAT uses a truncated Chebyshev polynomial approximation of the GAT attention score to enable federated GAT training with a single pre-communication round.

Pith tools