解决多服务器联邦学习中的客户端冲突问题,提升训练效率。
Conflict-Aware Client Selection for Multi-Server Federated Learning
- 用隐马尔可夫模型预测客户端选择冲突风险,实现去中心化决策。
- 通过公平性奖励机制降低通信延迟,减少资源争用,提升收敛速度。
- 适合大规模分布式训练场景,尤其适用于边缘计算环境。
联邦学习(FL)作为一种分布式机器学习范式,使客户端在不共享原始数据的前提下协作训练模型,有效保护用户隐私并降低通信开销。然而,传统单服务器联邦学习因需聚合大量客户端模型而面临高通信延迟问题。尽管多服务器联邦学习通过将任务分配至多个边缘服务器来分担负载,但客户端覆盖重叠与选择不协调常引发资源竞争,导致带宽冲突和训练失败。为此,本文提出一种基于冲突风险预测的去中心化强化学习方法(RL-CRP),以优化多服务器联邦学习中的客户端选择。具体而言,各服务器利用其稀疏的历史客户端选择序列,通过类别型隐马尔可夫模型估计客户端选择冲突的可能性;同时引入公平性感知奖励机制,鼓励长期客户端参与,从而最小化训练延迟与资源争用。大量实验表明,所提的RL-CRP框架能有效降低服务器间冲突,并显著提升训练效率,体现在收敛速度加快与通信成本降低上。
原文摘要 · Abstract (English)
Federated learning (FL) has emerged as a promising distributed machine learning (ML) that enables collaborative model training across clients without exposing raw data, thereby preserving user privacy and reducing communication costs. Despite these benefits, traditional single-server FL suffers from high communication latency due to the aggregation of models from a large number of clients. While multi-server FL distributes workloads across edge servers, overlapping client coverage and uncoordinated selection often lead to resource contention, causing bandwidth conflicts and training failures. To address these limitations, we propose a decentralized reinforcement learning with conflict risk prediction, named RL CRP, to optimize client selection in multi-server FL systems. Specifically, each server estimates the likelihood of client selection conflicts using a categorical hidden Markov model based on its sparse historical client selection sequence. Then, a fairness-aware reward mechanism is incorporated to promote long-term client participation for minimizing training latency and resource contention. Extensive experiments demonstrate that the proposed RL-CRP framework effectively reduces inter-server conflicts and significantly improves training efficiency in terms of convergence speed and communication cost.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。