Structural Negative Transfer in Federated Graph Neural Networks: Diagnosis, Causal Investigation, and the Limits of Divergence-Aware Mitigation
Not on the map. Why?
Abstract (arXiv)
Federated learning lets multiple participants train a shared model without pooling raw data, by exchanging locally trained model updates instead. Federated averaging assumes that averaging local models is a reasonable way to solve one shared problem when participants' data are broadly similar. Work on non-IID federated learning has shown that this assumption can withstand differences in label and feature distributions. We ask whether it survives a different strain specific to graph neural networks, where client graphs differ not in label or feature distribution but in structure itself, requiring the same shared weights to operate over fundamentally different topologies. We call the resulting harm structural negative transfer. In a federation of real citation networks and synthetic structural proxies, a structurally atypical client lost more than half its achievable accuracy simply by joining. In an initial six-client federation, two label-free structural statistics computable before training were strongly associated with this harm. Expanding to twenty clients showed that degree divergence remained associated with harm, although more weakly, and survived removal of domain contrast. Spectral divergence did not replicate, which we trace to a confound caused by the composition of the reference pool used for leave-one-out statistics. A causal intervention isolating topology found no significant effect. A degree-normalization mechanism held across twenty-four seeds but did not explain the harm when corrected. The best of five candidate fixes beat a tuned baseline only until a matched, structurally blind control was applied, after which the gain disappeared. What survives is a modest, partially replicated, degree-specific signal that is not yet a validated predictor at scale.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 15 Sep 2026.
Builds on
24 of 34 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2020Adaptive Federated Optimizationcited by 1,046
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 906
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2021Model-Contrastive Federated Learningcited by 766
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
- 2020Personalized Federated Learning with Moreau Envelopescited by 618
12 more
- 2021Federated Learning Based on Dynamic Regularizationcited by 562
- 2019Federated Learning with Personalization Layerscited by 541
- 2021Exploiting Shared Representations for Personalized Federated Learningcited by 541
- 2020An Efficient Framework for Clustered Federated Learningcited by 511
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
- 2019Robust Aggregation for Federated Learningcited by 317
- 2021Subgraph Federated Learning with Missing Neighbor Generationcited by 132
- 2021Federated Graph Classification over Non-IID Graphscited by 114
- 2021Cross-Node Federated Graph Neural Network for Spatio-Temporal Data Modelingcited by 69
- 2022Personalized Subgraph Federated Learningcited by 54
- 2024OpenFGL: A Comprehensive Benchmark for Federated Graph Learningcited by 16
- 2024FedGraph: A Research Library and Benchmark for Federated Graph Learningcited by 3
Built on by
Not cited yet.