Pith. sign in

REVIEW 2 cited by

OpenFGL: A Comprehensive Benchmark for Federated Graph Learning

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 2408.16288 v2 pith:O3XDXJPJ submitted 2024-08-29 cs.LG cs.AIcs.DBcs.SI

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

Federated graph learning (FGL) is a promising distributed training paradigm for graph neural networks across multiple local systems without direct data sharing. This approach inherently involves large-scale distributed graph processing, which closely aligns with the challenges and research focuses of graph-based data systems. Despite the proliferation of FGL, the diverse motivations from real-world applications, spanning various research backgrounds and settings, pose a significant challenge to fair evaluation. To fill this gap, we propose OpenFGL, a unified benchmark designed for the primary FGL scenarios: Graph-FL and Subgraph-FL. Specifically, OpenFGL includes 42 graph datasets from 18 application domains, 8 federated data simulation strategies that emphasize different graph properties, and 5 graph-based downstream tasks. Additionally, it offers 18 recently proposed SOTA FGL algorithms through a user-friendly API, enabling a thorough comparison and comprehensive evaluation of their effectiveness, robustness, and efficiency. Our empirical results demonstrate the capabilities of FGL while also highlighting its potential limitations, providing valuable insights for future research in this growing field, particularly in fostering greater interdisciplinary collaboration between FGL and data systems.

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 Effective Federated Multimodal Graph Learning via Navigating Multifaceted Heterogeneity

    cs.LG 2026-08 conditional novelty 6.0 of 10

    A federated multimodal graph-learning method that uses server-side routing of topology-aware prototypes to align clients across tasks, modalities, and topologies, outperforming baselines on 8 datasets.

  2. FedOGL: Combating Catastrophic Forgetting in Federated Open-World Multimodal Graph Learning

    cs.LG 2026-07 conditional novelty 5.0 of 10

    FedOGL blends replay, distillation, structure-basis gradient shielding, and prototype consolidation to cut catastrophic forgetting in federated open-world multimodal graph learning, reporting 42.67% less forgetting th...

Pith tools