Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

S2FGL: Spatial Spectral Federated Graph Learning

Created by
  • Haebom

Author

Zihan Tan, Suyuan Huang, Guancheng Wan, Wenke Huang, He Li, Mang Ye

Outline

In this paper, we present Federated Graph Learning (FGL), which combines the privacy-preserving capabilities of Federated Learning (FL) with the powerful graph modeling capabilities of Graph Neural Networks (GNNs). Existing studies only address subgraph FL from a structural perspective, overlooking the propagation of graph signals in spatial and spectral domains. From a spatial perspective, subgraph FL causes edge disconnection between clients, which leads to label signal disruption and class knowledge degradation of global GNNs. From a spectral perspective, spectral heterogeneity causes signal frequency mismatch between subgraphs, which causes local GNNs to overfit to local signal propagation schemes. As a result, spectral client drift occurs, which deteriorates global generalization. To address these issues, we propose a global knowledge repository that mitigates label signal disruption and a frequency alignment that addresses spectral client drift. We construct the S2FGL framework by combining spatial and spectral strategies. We demonstrate the superiority of S2FGL through extensive experiments on multiple datasets. The code can be found at https://github.com/Wonder7racer/S2FGL.git .

Takeaways, Limitations

Takeaways:
We propose a novel federated graph learning framework, S2FGL, that considers graph signal propagation in spatial and spectral domains.
Effectively address label signal interruption and spectral client drift issues to improve global generalization performance.
We experimentally verify the superiority of S2FGL on various datasets.
Reproducibility has been improved through open source code.
Limitations:
Additional analysis of the computational complexity and scalability of the proposed method may be required.
Further verification of robustness against various graph structures and data distributions is required.
It is likely to perform well only for certain types of graphs. Experiments are needed on a wider range of graph structures.
👍