LGMay 25, 2025

FedSKC: Federated Learning with Non-IID Data via Structural Knowledge Collaboration

arXiv:2505.18981v11 citationsh-index: 12Has Code2025 IEEE International Conference on Web Services (ICWS)
Originality Incremental advance
AI Analysis

This addresses a major challenge in federated learning for edge computing by enhancing model performance under non-IID data conditions, though it appears incremental as it builds on existing FL methods.

The paper tackles the data heterogeneity issue in federated learning, which causes biased labeling preferences and degrades model performance, by proposing FedSKC, a method that uses structural knowledge collaboration to improve convergence and achieve superior results in experiments.

With the advancement of edge computing, federated learning (FL) displays a bright promise as a privacy-preserving collaborative learning paradigm. However, one major challenge for FL is the data heterogeneity issue, which refers to the biased labeling preferences among multiple clients, negatively impacting convergence and model performance. Most previous FL methods attempt to tackle the data heterogeneity issue locally or globally, neglecting underlying class-wise structure information contained in each client. In this paper, we first study how data heterogeneity affects the divergence of the model and decompose it into local, global, and sampling drift sub-problems. To explore the potential of using intra-client class-wise structural knowledge in handling these drifts, we thus propose Federated Learning with Structural Knowledge Collaboration (FedSKC). The key idea of FedSKC is to extract and transfer domain preferences from inter-client data distributions, offering diverse class-relevant knowledge and a fair convergent signal. FedSKC comprises three components: i) local contrastive learning, to prevent weight divergence resulting from local training; ii) global discrepancy aggregation, which addresses the parameter deviation between the server and clients; iii) global period review, correcting for the sampling drift introduced by the server randomly selecting devices. We have theoretically analyzed FedSKC under non-convex objectives and empirically validated its superiority through extensive experimental results.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes