通过课程学习缓解子图联邦学习中的过拟合问题,实现更有效的个性化模型聚合。
Curriculum Guided Personalized Subgraph Federated Learning
- 采用课程学习动态选择边进行训练,先学通用结构再学客户端特有结构。
- 在六个基准数据集上优于现有方法,显著提升个性化模型性能。
- 适合处理数据异构性强、子图稀疏的分布式图神经网络场景。
子图联邦学习(Subgraph Federated Learning, FL)旨在跨分布式的私有子图上训练图神经网络(GNN),但面临严重的数据异构性问题。为缓解此问题,加权模型聚合通过赋予相似子图特征的客户端更大权重来个性化本地GNN。然而,稀疏且有偏的子图常导致快速过拟合,使客户端相似性矩阵停滞甚至崩溃,致使聚合失效,各客户端强化自身偏差而非共享多样化知识。为此,本文提出一种新型个性化子图联邦学习框架——课程引导的个性化子图联邦学习(CUFL)。客户端侧采用课程学习(CL),根据重构得分自适应选择训练边,优先暴露于更易的、跨客户端的通用子结构,后期再引入更难的客户端特定结构。这种渐进式暴露可防止早期对有偏模式的过拟合,实现逐步个性化。同时,课程机制调节个性化过程,将服务器聚合从交换通用知识转变为传播客户端特定知识。此外,CUFL通过在随机参考图上重建细粒度结构指标来改进加权聚合的客户端相似性估计。在六个基准数据集上的大量实验表明,CUFL显著优于相关基线方法。代码已开源。
原文摘要 · Abstract (English)
Subgraph Federated Learning (FL) aims to train Graph Neural Networks (GNNs) across distributed private subgraphs, but it suffers from severe data heterogeneity. To mitigate data heterogeneity, weighted model aggregation personalizes each local GNN by assigning larger weights to parameters from clients with similar subgraph characteristics inferred from their current model states. However, the sparse and biased subgraphs often trigger rapid overfitting, causing the estimated client similarity matrix to stagnate or even collapse. As a result, aggregation loses effectiveness as clients reinforce their own biases instead of exploiting diverse knowledge otherwise available. To this end, we propose a novel personalized subgraph FL framework called Curriculum guided personalized sUbgraph Federated Learning (CUFL). On the client side, CUFL adopts Curriculum Learning (CL) that adaptively selects edges for training according to their reconstruction scores, exposing each GNN first to easier, generic cross-client substructures and only later to harder, client-specific ones. This paced exposure prevents early overfitting to biased patterns and enables gradual personalization. By regulating personalization, the curriculum also reshapes server aggregation from exchanging generic knowledge to propagating client-specific knowledge. Further, CUFL improves weighted aggregation by estimating client similarity using fine-grained structural indicators reconstructed on a random reference graph. Extensive experiments on six benchmark datasets confirm that CUFL achieves superior performance compared to relevant baselines. Code is available at https://github.com/Kang-Min-Ku/CUFL.git.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。