arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.12281cs.LGeess.SP
收藏

具有自适应局部链接的高效全分布式联邦学习

Efficient Fully Distributed Federated Learning with Adaptive Local Links

University of Patras(帕特雷大学)

Evangelos Georgatos, Christos Mavrokefalidis, Kostas Berberidis

摘要:

如今,数据驱动、机器和深度学习方法在各种复杂任务(包括图像分类和目标检测)以及自动驾驶汽车、医疗成像和无线通信等各种应用领域中提供了前所未有的性能。传统上,这些方法与所涉及的数据集一起部署在独立设备上。最近,已经观察到向所谓的边缘机器学习的转变,其中采用集中式架构,允许具有本地计算和存储资源的多个设备在集中式服务器的协助下进行协作。众所周知的联邦学习方法能够通过允许仅与服务器交换参数来利用这种架构,同时保持数据集对每个贡献设备的私有性。在这项工作中,我们提出了一个完全分布式的,基于扩散的学习算法,不需要一个中央服务器,并提出了一个自适应的组合规则的设备的合作。通过在MNIST数据集上采用分类任务,通过减少在非IID数据集场景中实现可接受的准确度水平所需的协作回合数,证明了所提出的算法相对于相应对应方的功效。

英文摘要:

Nowadays, data-driven, machine and deep learning approaches have provided unprecedented performance in various complex tasks, including image classification and object detection, and in a variety of application areas, like autonomous vehicles, medical imaging and wireless communications. Traditionally, such approaches have been deployed, along with the involved datasets, on standalone devices. Recently, a shift has been observed towards the so-called Edge Machine Learning, in which centralized architectures are adopted that allow multiple devices with local computational and storage resources to collaborate with the assistance of a centralized server. The well-known federated learning approach is able to utilize such architectures by allowing the exchange of only parameters with the server, while keeping the datasets private to each contributing device. In this work, we propose a fully distributed, diffusion-based learning algorithm that does not require a central server and propose an adaptive combination rule for the cooperation of the devices. By adopting a classification task on the MNIST dataset, the efficacy of the proposed algorithm over corresponding counterparts is demonstrated via the reduction of the number of collaboration rounds required to achieve an acceptable accuracy level in non- IID dataset scenarios.

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

↑