{"title":"OpenFGL:联合图学习的综合基准","authors":"Xunkai Li, Yinlin Zhu, Boyang Pang, Guochen Yan, Yeyu Yan, Zening Li, Zhengyu Wu, Wentao Zhang, Rong-Hua Li, Guoren Wang","doi":"arxiv-2408.16288","DOIUrl":null,"url":null,"abstract":"Federated graph learning (FGL) has emerged as a promising distributed\ntraining paradigm for graph neural networks across multiple local systems\nwithout direct data sharing. This approach is particularly beneficial in\nprivacy-sensitive scenarios and offers a new perspective on addressing\nscalability challenges in large-scale graph learning. Despite the proliferation\nof FGL, the diverse motivations from practical applications, spanning various\nresearch backgrounds and experimental settings, pose a significant challenge to\nfair evaluation. To fill this gap, we propose OpenFGL, a unified benchmark\ndesigned for the primary FGL scenarios: Graph-FL and Subgraph-FL. Specifically,\nOpenFGL includes 38 graph datasets from 16 application domains, 8 federated\ndata simulation strategies that emphasize graph properties, and 5 graph-based\ndownstream tasks. Additionally, it offers 18 recently proposed SOTA FGL\nalgorithms through a user-friendly API, enabling a thorough comparison and\ncomprehensive evaluation of their effectiveness, robustness, and efficiency.\nEmpirical results demonstrate the ability of FGL while also revealing its\npotential limitations, offering valuable insights for future exploration in\nthis thriving field.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"OpenFGL: A Comprehensive Benchmarks for Federated Graph Learning\",\"authors\":\"Xunkai Li, Yinlin Zhu, Boyang Pang, Guochen Yan, Yeyu Yan, Zening Li, Zhengyu Wu, Wentao Zhang, Rong-Hua Li, Guoren Wang\",\"doi\":\"arxiv-2408.16288\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Federated graph learning (FGL) has emerged as a promising distributed\\ntraining paradigm for graph neural networks across multiple local systems\\nwithout direct data sharing. This approach is particularly beneficial in\\nprivacy-sensitive scenarios and offers a new perspective on addressing\\nscalability challenges in large-scale graph learning. Despite the proliferation\\nof FGL, the diverse motivations from practical applications, spanning various\\nresearch backgrounds and experimental settings, pose a significant challenge to\\nfair evaluation. To fill this gap, we propose OpenFGL, a unified benchmark\\ndesigned for the primary FGL scenarios: Graph-FL and Subgraph-FL. Specifically,\\nOpenFGL includes 38 graph datasets from 16 application domains, 8 federated\\ndata simulation strategies that emphasize graph properties, and 5 graph-based\\ndownstream tasks. Additionally, it offers 18 recently proposed SOTA FGL\\nalgorithms through a user-friendly API, enabling a thorough comparison and\\ncomprehensive evaluation of their effectiveness, robustness, and efficiency.\\nEmpirical results demonstrate the ability of FGL while also revealing its\\npotential limitations, offering valuable insights for future exploration in\\nthis thriving field.\",\"PeriodicalId\":501032,\"journal\":{\"name\":\"arXiv - CS - Social and Information Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Social and Information Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.16288\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Social and Information Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.16288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
OpenFGL: A Comprehensive Benchmarks for Federated Graph Learning
Federated graph learning (FGL) has emerged as a promising distributed
training paradigm for graph neural networks across multiple local systems
without direct data sharing. This approach is particularly beneficial in
privacy-sensitive scenarios and offers a new perspective on addressing
scalability challenges in large-scale graph learning. Despite the proliferation
of FGL, the diverse motivations from practical applications, spanning various
research backgrounds and experimental 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 38 graph datasets from 16 application domains, 8 federated
data simulation strategies that emphasize 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.
Empirical results demonstrate the ability of FGL while also revealing its
potential limitations, offering valuable insights for future exploration in
this thriving field.