FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference

• URL: http://arxiv.org/abs/2410.20105v1
• Date: Sat, 26 Oct 2024 07:09:27 GMT
• Title: FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference
• Authors: Zihan Tan, Guancheng Wan, Wenke Huang, Mang Ye,
• Abstract summary: Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural Networks (GNNs) without compromising privacy. Previous pFGL methods incorrectly share non-generic knowledge globally and fail to tailor personalized solutions locally. We propose our pFGL framework FedSSP which Shares generic Spectral knowledge while satisfying graph Preferences.
• Score: 31.796411806840087
• License:
• Abstract: Personalized Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural Networks (GNNs) without compromising privacy while accommodating personalized requirements for non-IID participants. In cross-domain scenarios, structural heterogeneity poses significant challenges for pFGL. Nevertheless, previous pFGL methods incorrectly share non-generic knowledge globally and fail to tailor personalized solutions locally under domain structural shift. We innovatively reveal that the spectral nature of graphs can well reflect inherent domain structural shifts. Correspondingly, our method overcomes it by sharing generic spectral knowledge. Moreover, we indicate the biased message-passing schemes for graph structures and propose the personalized preference module. Combining both strategies, we propose our pFGL framework FedSSP which Shares generic Spectral knowledge while satisfying graph Preferences. Furthermore, We perform extensive experiments on cross-dataset and cross-domain settings to demonstrate the superiority of our framework. The code is available at https://github.com/OakleyTan/FedSSP.

Related papers

• Learning to Model Graph Structural Information on MLPs via Graph Structure Self-Contrasting [50.181824673039436]
  We propose a Graph Structure Self-Contrasting (GSSC) framework that learns graph structural information without message passing. The proposed framework is based purely on Multi-Layer Perceptrons (MLPs), where the structural information is only implicitly incorporated as prior knowledge. It first applies structural sparsification to remove potentially uninformative or noisy edges in the neighborhood, and then performs structural self-contrasting in the sparsified neighborhood to learn robust node representations.
  arXiv  Detail & Related papers  (2024-09-09T12:56:02Z)
• Federated Graph Learning with Structure Proxy Alignment [43.13100155569234]
  Federated Graph Learning (FGL) aims to learn graph learning models over graph data distributed in multiple data owners. We propose FedSpray, a novel FGL framework that learns local class-wise structure proxies in the latent space. Our goal is to obtain the aligned structure proxies that can serve as reliable, unbiased neighboring information for node classification.
  arXiv  Detail & Related papers  (2024-08-18T07:32:54Z)
• A Pure Transformer Pretraining Framework on Text-attributed Graphs [50.833130854272774]
  We introduce a feature-centric pretraining perspective by treating graph structure as a prior. Our framework, Graph Sequence Pretraining with Transformer (GSPT), samples node contexts through random walks. GSPT can be easily adapted to both node classification and link prediction, demonstrating promising empirical success on various datasets.
  arXiv  Detail & Related papers  (2024-06-19T22:30:08Z)
• HiFGL: A Hierarchical Framework for Cross-silo Cross-device Federated Graph Learning [12.073150043485084]
  Federated Graph Learning (FGL) has emerged as a promising way to learn high-quality representations from distributed graph data. We propose a Hierarchical Federated Graph Learning framework for cross-silo cross-device FGL. Specifically, we devise a unified hierarchical architecture to safeguard federated GNN training on heterogeneous clients.
  arXiv  Detail & Related papers  (2024-06-15T12:34:40Z)
• Privacy-preserving design of graph neural networks with applications to vertical federated learning [56.74455367682945]
  We present an end-to-end graph representation learning framework called VESPER. VESPER is capable of training high-performance GNN models over both sparse and dense graphs under reasonable privacy budgets.
  arXiv  Detail & Related papers  (2023-10-31T15:34:59Z)
• Federated Learning on Non-IID Graphs via Structural Knowledge Sharing [47.140441784462794]
  federated graph learning (FGL) enables clients to train strong GNN models in a distributed manner without sharing their private data. We propose FedStar, an FGL framework that extracts and shares the common underlying structure information for inter-graph learning tasks. We perform extensive experiments over both cross-dataset and cross-domain non-IID FGL settings, demonstrating FedStar's superiority.
  arXiv  Detail & Related papers  (2022-11-23T15:12:16Z)
• FedEgo: Privacy-preserving Personalized Federated Graph Learning with Ego-graphs [22.649780281947837]
  In some practical scenarios, graph data are stored separately in multiple distributed parties, which may not be directly shared due to conflicts of interest. We propose FedEgo, a federated graph learning framework based on ego-graphs to tackle the challenges above.
  arXiv  Detail & Related papers  (2022-08-29T15:47:36Z)
• Towards Unsupervised Deep Graph Structure Learning [67.58720734177325]
  We propose an unsupervised graph structure learning paradigm, where the learned graph topology is optimized by data itself without any external guidance. Specifically, we generate a learning target from the original data as an "anchor graph", and use a contrastive loss to maximize the agreement between the anchor graph and the learned graph.
  arXiv  Detail & Related papers  (2022-01-17T11:57:29Z)
• Spectral Graph Convolutional Networks With Lifting-based Adaptive Graph Wavelets [81.63035727821145]
  Spectral graph convolutional networks (SGCNs) have been attracting increasing attention in graph representation learning. We propose a novel class of spectral graph convolutional networks that implement graph convolutions with adaptive graph wavelets.
  arXiv  Detail & Related papers  (2021-08-03T17:57:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.