让理智的参与方愿意留下的联邦学习新方法
Federated Learning by Utility-Constrained Stochastic Aggregation for Improving Rational Participation

- 用约束客户端自身收益的随机聚合机制,保障参与意愿
- 实验显示客户端留存率显著提升,全局模型性能更好
- 适合资源不均、参与者有自利动机的真实场景
联邦学习算法通常假设客户端会被动配合服务器请求,主动上传本地模型更新。但在真实的跨孤岛环境中,客户端往往是理性主体,可能更关注自身局部模型性能而非全局模型。在统计异质性较大的情况下,若合作带来的感知收益未达其本地效用阈值,理性客户端可能选择退出。这种流失会降低全局模型性能,甚至导致训练过程崩溃。本文提出FedUCA(基于效用约束的随机聚合联邦学习),将服务器定位为最大化全局模型性能的优化者,同时维持客户端参与。通过在标准数据集上的大量实验验证,该框架通过优先保障参与可行性,显著提升了客户端留存率,进而实现更优的全局模型性能。
原文摘要 · Abstract (English)
Federated Learning (FL) algorithms implicitly assume that clients passively comply with server-side orchestration by sharing local model updates upon server request. However, this overlooks an important aspect in real-world cross-silo environments: clients are often rational agents who may prioritize their utilities such as local model performance over that of the global model. In settings with significant statistical heterogeneity, rational clients may opt out of the federation if the perceived benefits of collaboration fail to meet their local utility thresholds. Such attrition degrades the global model performance and can lead to the collapse of the federated training process. In this work, we introduce FedUCA, (Federated Learning by Utility-Constrained Stochastic Aggregation for Improving Rational Participation), a framework that formalizes the server's role as an optimizer seeking to maximize global model performance by sustaining client participation. We substantiate our framework through extensive experiments on standard datasets demonstrating that by prioritizing participation feasibility, FedUCA achieves significantly higher client retention and, consequently, a superior global model performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。