arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.01774cs.DCcs.LG
收藏

用于加速联邦学习的高效数据分布估计

Efficient Data Distribution Estimation for Accelerated Federated Learning

Boston University(波士顿大学)

Yuanli Wang, Lei Huang

AI总结:

针对大规模联邦学习中客户端选择算法的开销问题,提出一种高效的数据分布摘要计算算法,在真实环境中使数据摘要时间最高减少30倍,聚类时间最高减少360倍。

摘要:

联邦学习(FL)是一种保护隐私的机器学习范式,其中全局模型在大量分布式边缘设备上进行原位训练。这些系统通常由数百万个用户设备组成,每个 epoch 中只能使用一部分可用设备进行训练。鉴于设备在系统资源和训练数据方面高度异构,设计设备选择策略极具挑战性。这种异构性使得设备选择对于模型的及时收敛和足够的模型准确度至关重要。为了解决 FL 客户端异构性问题,人们开发了各种客户端选择算法,在模型覆盖率和准确度方面展现出有前景的性能提升。在本研究中,我们探讨了大规模 FL 环境中客户端选择算法的开销。随后,我们提出了一种高效的数据分布摘要计算算法,以减少真实世界大规模 FL 环境中的开销。评估表明,我们提出的解决方案在数据摘要时间上最高可实现 30 倍的缩减,在聚类时间上最高可实现 360 倍的缩减。

英文摘要:

Federated Learning(FL) is a privacy-preserving machine learning paradigm where a global model is trained in-situ across a large number of distributed edge devices. These systems are often comprised of millions of user devices and only a subset of available devices can be used for training in each epoch. Designing a device selection strategy is challenging, given that devices are highly heterogeneous in both their system resources and training data. This heterogeneity makes device selection very crucial for timely model convergence and sufficient model accuracy. To tackle the FL client heterogeneity problem, various client selection algorithms have been developed, showing promising performance improvement in terms of model coverage and accuracy. In this work, we study the overhead of client selection algorithms in a large scale FL environment. Then we propose an efficient data distribution summary calculation algorithm to reduce the overhead in a real-world large scale FL environment. The evaluation shows that our proposed solution could achieve up to 30x reduction in data summary time, and up to 360x reduction in clustering time.

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

↑