arXiv:2506.10102cs.LGcs.AI2025-06

通过动态图协作,让不同客户端高效个性化学习。

Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach

  • 用特征锚和分类头实现轻量通信,避免传输完整模型。
  • 构建动态图并聚类,仅让相似客户端间协作,提升效果。
  • 适合数据异构、资源受限的分布式学习场景。

我们提出一种新型联邦多任务学习方法,利用跨客户端相似性实现个性化学习。为避免向参数服务器传输完整模型,提出通信高效的方案:引入特征锚(feature anchor),即紧凑的向量表示,用于总结客户端本地类别所学特征,并与服务器共享以反映本地分布。同时,客户端共享分类头(轻量线性层),并通过图正则化实现客户端间协作。将客户端协作建模为动态图,并持续更新与优化该图,以应对客户端分布漂移。为确保有益知识迁移并防止负向协作,采用基于社区检测的方法,将动态图划分为同质社区,最大化各社区内任务相似度(以图边权重表示)之和。此机制限制协作仅在高度相似客户端间进行,保障正向互动并保留个性化。在两个异构数据集上的大量实验表明,该方法显著优于现有先进基线。此外,其计算与通信效率更高,且促进客户端间的公平性。

原文摘要 · Abstract (English)

We present a novel federated multi-task learning method that leverages cross-client similarity to enable personalized learning for each client. To avoid transmitting the entire model to the parameter server, we propose a communication-efficient scheme that introduces a feature anchor, a compact vector representation that summarizes the features learned from the client's local classes. This feature anchor is shared with the server to account for local clients' distribution. In addition, the clients share the classification heads, a lightweight linear layer, and perform a graph-based regularization to enable collaboration among clients. By modeling collaboration between clients as a dynamic graph and continuously updating and refining this graph, we can account for any drift from the clients. To ensure beneficial knowledge transfer and prevent negative collaboration, we leverage a community detection-based approach that partitions this dynamic graph into homogeneous communities, maximizing the sum of task similarities, represented as the graph edges' weights, within each community. This mechanism restricts collaboration to highly similar clients within their formed communities, ensuring positive interaction and preserving personalization. Extensive experiments on two heterogeneous datasets demonstrate that our method significantly outperforms state-of-the-art baselines. Furthermore, we show that our method exhibits superior computation and communication efficiency and promotes fairness across clients.

联邦学习多任务学习图神经网络

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。