Rethinking One-Shot Federated Graph Learning: Training-Free Statistical Estimation
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2609.06499v1 Announce Type: new Abstract: One-shot federated graph learning (FGL) requires the server to estimate client contributions from highly compressed information, yet conventional volum...
arXiv:2603. 06952v2 Announce Type: replace Abstract: As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods.
arXiv:2607. 08368v1 Announce Type: new Abstract: With the widespread deployment of basic models in edge intelligence, communication bandwidth has become a core bottleneck restricting the scalability of federated learning.
arXiv:2607. 11577v1 Announce Type: cross Abstract: We introduce a constrained two-view framework for node prediction that aligns structure-conditioned GNN embeddings with a structure-free feature prior learned by an anchor model.
arXiv:2608. 06441v1 Announce Type: new Abstract: Full-graph GNN training delivers high accuracy but scales poorly on multi-server clusters due to heavy, irregular inter-node embedding exchanges.
arXiv:2509. 18171v5 Announce Type: replace Abstract: Federated graph learning (FGL) trains a shared graph model across clients whose local graphs differ in node features, labels, and connectivity while keeping raw graph data decentralized.