arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.08402cs.LGcs.AIcs.DC
收藏

RobustFed:一种鲁棒联邦学习的真值推理方法

RobustFed: A Truth Inference Approach for Robust Federated Learning

Emory University(埃默里大学)

Farnaz Tahmasebian, Jian Lou, Li Xiong

摘要:

联邦学习是一个突出的框架,它使客户端(例如,移动设备或组织)来在中央服务器的编排下训练协作的全局模型,同时保持本地训练数据集的隐私。然而,联邦学习中的聚合步骤容易受到对抗攻击,因为中央服务器无法管理客户端的行为。因此,全局模型的性能和训练过程的收敛性将受到影响,在这种攻击下,为了减轻这个脆弱性问题,我们提出了一种新的鲁棒聚合算法的启发,在众包的真理推理方法,通过将工人的可靠性到聚合。我们评估我们的解决方案在三个现实世界的数据集与各种机器学习模型。实验结果表明,我们的解决方案确保了强大的联邦学习,是弹性的各种类型的攻击,包括噪声数据攻击,拜占庭攻击,标签翻转攻击。

英文摘要:

Federated learning is a prominent framework that enables clients (e.g., mobile devices or organizations) to train a collaboratively global model under a central server's orchestration while keeping local training datasets' privacy. However, the aggregation step in federated learning is vulnerable to adversarial attacks as the central server cannot manage clients' behavior. Therefore, the global model's performance and convergence of the training process will be affected under such attacks.To mitigate this vulnerability issue, we propose a novel robust aggregation algorithm inspired by the truth inference methods in crowdsourcing via incorporating the worker's reliability into aggregation. We evaluate our solution on three real-world datasets with a variety of machine learning models. Experimental results show that our solution ensures robust federated learning and is resilient to various types of attacks, including noisy data attacks, Byzantine attacks, and label flipping attacks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑