REVIEW 5 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
FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks
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.
Forward citations
Cited by 5 Pith papers
-
STAGE: Tackling Semantic Drift in Multimodal Federated Graph Learning
STAGE builds a shared semantic space through feature translation and controlled graph propagation to reduce semantic drift in multimodal federated graph learning, delivering state-of-the-art results with lower communi...
-
Federated Learning of Nonlinear Temporal Dynamics with Graph Attention-based Cross-Client Interpretability
A federated framework uses per-client nonlinear state space models and a central graph attention network on latent states to learn and interpret cross-client temporal dynamics with convergence guarantees.
-
Provably Communication-Efficient and Privacy-Preserving Federated Graph Neural Networks
CE-FedGNN enables federated GNN training on coupled distributed graphs via infrequent aggregated representation exchange, moving-average estimation for staleness, and metric-DP, with O(1/sqrt(T)) convergence and O(T^{...
-
PRISM: Topology-Aware Cross-Modal Imputation for Modality-Deficient Federated Graph Learning
PRISM proposes a topology-aware cross-modal imputation framework for client-level modality-deficient multimodal federated graph learning that improves deficient clients by 4.48% on average over baselines across six datasets.
-
UMEDA: Unified Multi-modal Efficient Data Fusion for Privacy-Preserving Graph Federated Learning via Spectral-Gated Attention and Diffusion-Based Operator Alignment
UMEDA is a new graph federated learning method that uses low-rank spectral filtering and diffusion over a shared integral operator to fuse multi-modal data privately, outperforming baselines on MM-Fi and RELI11D under...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.