FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs
Not on the map. Why?
Abstract (arXiv)
Federated Graph Learning (FGL) empowers clients to collaboratively train Graph neural networks (GNNs) in a distributed manner while preserving data privacy. However, FGL methods usually require that the graph data owned by all clients is homophilic to ensure similar neighbor distribution patterns of nodes. Such an assumption ensures that the learned knowledge is consistent across the local models from all clients. Therefore, these local models can be properly aggregated as a global model without undermining the overall performance. Nevertheless, when the neighbor distribution patterns of nodes vary across different clients (e.g., when clients hold graphs with different levels of heterophily), their local models may gain different and even conflict knowledge from their node-level predictive tasks. Consequently, aggregating these local models usually leads to catastrophic performance deterioration on the global model. To address this challenge, we propose FedHERO, an FGL framework designed to harness and share insights from heterophilic graphs effectively. At the heart of FedHERO is a dual-channel GNN equipped with a structure learner, engineered to discern the structural knowledge encoded in the local graphs. With this specialized component, FedHERO enables the local model for each client to identify and learn patterns that are universally applicable across graphs with different patterns of node neighbor distributions. FedHERO not only enhances the performance of individual client models by leveraging both local and shared structural insights but also sets a new precedent in this field to effectively handle graph data with various node neighbor distribution patterns. We conduct extensive experiments to validate the superior performance of FedHERO against existing alternatives.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 75 of its 105 references that are in the map. First posted on arXiv 29 Apr 2025.
Builds on
75 of 105 references.
References · 75
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2019Graph Neural Networks for Social Recommendationcited by 714
38 more
- 2020Benchmarking Graph Neural Networkscited by 680
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
- 2019Diffusion Improves Graph Learningcited by 414
- 2020Explainability in Graph Neural Networks: A Taxonomic Surveycited by 384
- 2020Graph Structure Learning for Robust Graph Neural Networkscited by 371
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
- 2018Session-based Recommendation with Graph Neural Networkscited by 312
- 2020Towards Deeper Graph Neural Networkscited by 296
- 2019Learning Discrete Structures for Graph Neural Networkscited by 231
- 2020Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddingscited by 214
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
- 2020Data Augmentation for Graph Neural Networkscited by 203
- 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2020Graph Information Bottleneckcited by 168
- 2017Data Decisions and Theoretical Implications when Adversarially Learning Fair Representationscited by 165
- 2018Adaptive Graph Convolutional Neural Networkscited by 155
- 2019AliGraph: A Comprehensive Graph Neural Network Platformcited by 153
- 2016How to learn a graph from smooth signalscited by 146
- 2021Graph Learning: A Surveycited by 141
- 2021Subgraph Federated Learning with Missing Neighbor Generationcited by 132
- 2020Learning to Drop: Robust Graph Neural Network via Topological Denoisingcited by 127
- 2020AM-GCN: Adaptive Multi-channel Graph Convolutional Networkscited by 121
- 2022A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainabilitycited by 118
- 2021Federated Graph Classification over Non-IID Graphscited by 114
- 2022Towards Unsupervised Deep Graph Structure Learningcited by 114
- 2019Learning Disentangled Representations for Recommendationcited by 110
- 2022How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervisioncited by 102
- 2021Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patternscited by 95
- 2018Bayesian graph convolutional neural networks for semi-supervised classificationcited by 89
- 2022Federated Learning on Non-IID Graphs via Structural Knowledge Sharingcited by 88
50 most cited of 75 All 75 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.