SPIRE, a Structural Entropy-Driven Graph Diffusion Generation method that introduces topology-aware client differentiation into one-shot FGL, employs first-order degree-distribution structural entropy as a compact descriptor of degree-mass dispersion and uses it to derive structural client weights, providing an inductive bias that accounts for differences in graph topology beyond data volume.
Abstract
One-shot federated graph learning (FGL) requires the server to estimate client contributions from highly compressed information, yet conventional volume-based weighting captures the amount of client data while overlooking how its connectivity is organized. In this paper, we propose SPIRE, a Structural Entropy-Driven Graph Diffusion Generation method that introduces topology-aware client differentiation into one-shot FGL. Specifically, we employ first-order degree-distribution structural entropy as a compact descriptor of degree-mass dispersion and use it to derive structural client weights, providing an inductive bias that accounts for differences in graph topology beyond data volume. On the generation side, a graph diffusion model on the server synthesizes pseudographs conditioned on the weighted client prototypes, capturing both semantic and structural information without requiring additional client-side training. The generated pseudographs are then assembled via disjoint union fusion to train a global graph neural network. Extensive experiments on seven real-world graph datasets demonstrate that SPIRE consistently outperforms conventional and one-shot FGL methods, with particularly strong gains under highly heterogeneous (non-IID) and graph-perturbed settings.
One-shot federated graph learning generally aims to train Graph Neural Networks (GNNs) across clients with disconnected subgraphs in a single communication round. Existing methods predominantly design advanced optimization strategies under the premise that local GNN training is indispensable. However, empirical observa...
A small transported correction can augment a complete Local model when receiver evidence supports it while leaving the Local prediction unchanged otherwise, and the central result is that a small transported correction can augment a complete Local model when receiver evidence supports it while leaving the Local predict...
Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...
Aleksandar Tomčić, Milos Savic, Milos Radovanovic· 0 citations
Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.
Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al.· Proceedings of the Thirty-Fi...· 0 citations
Experiments on synthetic and real-world datasets show that GraphK outperforms existing methods, accurately learns graph structures, and generates synthetic graphs without explicit definitions.
Resul Tugay, Eren Olug, Elif Ak et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comJul 13, 2026
Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.