arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.08907cs.LGmath.OCstat.ML
收藏

鲁棒联邦学习:仿射分布偏移的情形

Robust Federated Learning: The Case of Affine Distribution Shifts

UC Santa Barbara(加州大学圣巴巴拉分校);Massachusetts Institute of Technology(麻省理工学院)

Amirhossein Reisizadeh, Farzan Farnia, Ramtin Pedarsani, Ali Jadbabaie

摘要:

联邦学习是一种分布式范例,其旨在使用分布在网络中的多个用户之间的样本来训练模型,同时将样本保存在用户的设备上,以提高效率并保护用户隐私。在这样的设置中,训练数据通常在统计上是异构的,并且表现出跨用户的各种分布偏移,这降低了学习模型的性能。本文的主要目标是开发一个强大的联邦学习算法,实现令人满意的性能对分布偏移在用户的样本。为了实现这一目标,我们首先考虑用户数据中的结构化仿射分布偏移,它捕获联邦设置中依赖于设备的数据异构性。该扰动模型适用于各种联邦学习问题,例如图像分类,其中图像经历依赖于设备的缺陷,例如不同的强度、对比度和亮度。为了解决用户之间的仿射分布偏移,我们提出了一个联邦学习框架对仿射分布偏移(FLRA)的鲁棒性,该框架可证明对观察样本的仿射Wasserstein偏移具有鲁棒性。为了解决FLRA的分布式极大极小问题,我们提出了一种快速有效的优化方法,并通过梯度下降上升(GDA)方法提供收敛保证。我们进一步证明了泛化误差界的学习分类器,以显示适当的推广,从经验分布的样本,真正的底层分布。我们进行了几个数值实验,经验支持FLRA。我们表明,仿射分布偏移确实足以显着降低新测试用户中学习分类器的性能,并且与标准的联邦学习和对抗训练方法相比,我们提出的算法取得了显着的收益。

英文摘要:

Federated learning is a distributed paradigm that aims at training models using samples distributed across multiple users in a network while keeping the samples on users' devices with the aim of efficiency and protecting users privacy. In such settings, the training data is often statistically heterogeneous and manifests various distribution shifts across users, which degrades the performance of the learnt model. The primary goal of this paper is to develop a robust federated learning algorithm that achieves satisfactory performance against distribution shifts in users' samples. To achieve this goal, we first consider a structured affine distribution shift in users' data that captures the device-dependent data heterogeneity in federated settings. This perturbation model is applicable to various federated learning problems such as image classification where the images undergo device-dependent imperfections, e.g. different intensity, contrast, and brightness. To address affine distribution shifts across users, we propose a Federated Learning framework Robust to Affine distribution shifts (FLRA) that is provably robust against affine Wasserstein shifts to the distribution of observed samples. To solve the FLRA's distributed minimax problem, we propose a fast and efficient optimization method and provide convergence guarantees via a gradient Descent Ascent (GDA) method. We further prove generalization error bounds for the learnt classifier to show proper generalization from empirical distribution of samples to the true underlying distribution. We perform several numerical experiments to empirically support FLRA. We show that an affine distribution shift indeed suffices to significantly decrease the performance of the learnt classifier in a new test user, and our proposed algorithm achieves a significant gain in comparison to standard federated learning and adversarial training methods.

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

↑