Pith. sign in

REVIEW 2 cited by

FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks

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 2104.07145 v2 pith:5JVLBHWO submitted 2021-04-14 cs.LG cs.AIcs.DC

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

Graph Neural Network (GNN) research is rapidly growing thanks to the capacity of GNNs in learning distributed representations from graph-structured data. However, centralizing a massive amount of real-world graph data for GNN training is prohibitive due to privacy concerns, regulation restrictions, and commercial competitions. Federated learning (FL), a trending distributed learning paradigm, provides possibilities to solve this challenge while preserving data privacy. Despite recent advances in vision and language domains, there is no suitable platform for the FL of GNNs. To this end, we introduce FedGraphNN, an open FL benchmark system that can facilitate research on federated GNNs. FedGraphNN is built on a unified formulation of graph FL and contains a wide range of datasets from different domains, popular GNN models, and FL algorithms, with secure and efficient system support. Particularly for the datasets, we collect, preprocess, and partition 36 datasets from 7 domains, including both publicly available ones and specifically obtained ones such as hERG and Tencent. Our empirical analysis showcases the utility of our benchmark system, while exposing significant challenges in graph FL: federated GNNs perform worse in most datasets with a non-IID split than centralized GNNs; the GNN model that attains the best result in the centralized setting may not maintain its advantage in the FL setting. These results imply that more research efforts are needed to unravel the mystery behind federated GNNs. Moreover, our system performance analysis demonstrates that the FedGraphNN system is computationally efficient and secure to large-scale graphs datasets. We maintain the source code at https://github.com/FedML-AI/FedGraphNN.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data

    cs.DC 2025-09 conditional novelty 6.0 of 10

    DUPLEX jointly optimizes P2P network topology and per-device graph sampling ratios via deep reinforcement learning, cutting completion time by 20-49% and communication cost by 17-38% while improving accuracy.

  2. Secure Federated Graph-Filtering for Recommender Systems

    cs.IR 2025-01 conditional novelty 4.0 of 10

    PriviRec and PriviRec-k compute graph-based recommendation filters in a federated, confidential manner with centralized-equal accuracy and reduced communication via low-rank approximations.

Pith tools