Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 5568-5578· 0 citations· 13 references
TL;DR
FedDUA is proposed, a novel disagreement-aware and uncertainty-guided framework for subgraph FL that first models cross-client semantic disagreement via a lightweight semantic anchor graph and derives adaptive aggregation weights for reliable global federated knowledge.
Abstract
Subgraph federated learning (subgraph FL) enables collaborative graph neural network training without sharing raw graph data, but suffers from severe Non-IID distributions and structural fragmentation. In such settings, Non-IID distributions induce pronounced client specialization, where each client excels in a subset of nodes but remains insufficiently trained on others. However, existing similarity-based aggregation and distillation methods fail to balance client specialization and global generalization, often reinforcing dominant local representations and impairing generalization on under-represented nodes, or over-incorporating global knowledge and thereby disrupting well-optimized local specialization. In this paper, we propose FedDUA, a novel disagreement-aware and uncertainty-guided framework for subgraph FL. Specifically, FedDUA first models cross-client semantic disagreement via a lightweight semantic anchor graph and derives adaptive aggregation weights for reliable global federated knowledge. On the client side, FedDUA introduces an uncertainty-aware local-global semantic alignment mechanism that selectively reinforces representations of confident nodes while guiding uncertain nodes with aggregated global knowledge, thereby balancing local specialization and global generalization. Extensive experiments on six real-world datasets demonstrate that FedDUA consistently outperforms the state-of-the-art subgraph FL methods across varying numbers of clients. Further analyses validate the robustness and effectiveness of the proposed disagreement modeling and uncertainty-aware local-global semantic alignment strategies.
FedPrism is proposed, a novel framework that shifts alignment granularity from the coarse client level to the precise instance level and devise a Posterior-Guided Performance Distillation mechanism that leverages experts' actual training loss as self-supervision to autonomously refine routing policies without explicit...
Ke Wang, Shao-Jing Fu, Yu-Chuan Luo et al.· Proceedings of the Thirty-Fi...· 0 citations
In this work, we investigate the task of Federated Generalized Category Discovery (Fed-GCD), which aims to leverage labeled data from known classes to cluster unlabeled samples from both known and unknown classes through privacy-preserving collaboration among clients. Existing Fed-GCD methods predominantly emphasize im...
Wen-Jing Li, Nan Pu, Jessica Fan et al.· IEEE Transactions on Informa...· 0 citations
This work proposes a counterfactual multi-view framework to explicitly learn a structure masker for extracting consensus subgraphs and proposes a history-aware adaptive multi-channel aggregation mechanism to enable dynamic and personalized sharing driven by channel similarity while preventing collaborative oscillation.
Wan Zhang, Xiao-Qian Jiang, Ye Wang et al.· Proceedings of the Thirty-Fi...· 0 citations
Real-world data for knowledge graph question answering is often distributed across different organizations due to governance and data sovereignty constraints. While centralized systems exist, they cannot answer multi-hop questions when the required facts are split across vertically partitioned silos. In this paper, we...
Md. Saikat Islam Khan Bappy, O. Seneviratne· 2 citations
In personalized federated learning, the coexistence of model heterogeneity and non-independent and identically distributed (non-IID) data makes cross-client collaboration challenging. Client models may have inconsistent architectures and distinct local knowledge distributions, while conventional parameter aggregation o...
Jia-Qi Yan, Xuan Yang, De-Sheng Wang et al.· Journal of King Saud Univers...· 0 citations
This work introduces structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs and develops a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unrel...
Ming-Can Wang, Jun-Chang Xin, Zhong-Ming Yao et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.