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

面向联邦边缘学习的数据感知设备调度

Data-Aware Device Scheduling for Federated Edge Learning

Université de Sherbrooke(舍布鲁克大学)

Afaf Taik, Zoubeir Mlika, Soumaya Cherkaoui

摘要:

联邦边缘学习(FEEL)涉及边缘设备之间的机器学习模型的协作训练,以及无线边缘网络中服务器的编排。由于频繁的模型更新,FEEL需要适应有限的通信带宽,边缘设备的稀缺能源,以及边缘设备的数据分布的统计异质性。因此,有必要仔细调度用于训练和上传模型的设备子集。与FEEL以前的工作相比,数据方面的探索不足,我们认为数据属性的心脏所提出的调度算法。为此,我们提出了一个新的调度方案,非独立和同分布(非IID)和不平衡的数据集FEEL。由于数据是学习的关键组成部分,我们提出了一套新的考虑因素,在FEEL无线调度算法的数据特性。事实上,设备收集的数据取决于本地环境和使用模式。因此,数据集在设备之间的大小和分布不同。在所提出的算法中,我们考虑数据和资源的角度。除了最小化FEEL的完成时间以及参与设备的传输能量之外,该算法还优先考虑具有丰富多样数据集的设备。我们首先定义了一个数据感知调度的总体框架和多样性评估的主轴和要求。然后,我们讨论多样性方面和一些可利用的技术和指标。接下来,我们制定的问题,并提出我们的FEEL调度算法。在不同的情况下的评估表明,我们提出的FEEL调度算法可以帮助实现高精度,在几轮降低成本。

英文摘要:

Federated Edge Learning (FEEL) involves the collaborative training of machine learning models among edge devices, with the orchestration of a server in a wireless edge network. Due to frequent model updates, FEEL needs to be adapted to the limited communication bandwidth, scarce energy of edge devices, and the statistical heterogeneity of edge devices' data distributions. Therefore, a careful scheduling of a subset of devices for training and uploading models is necessary. In contrast to previous work in FEEL where the data aspects are under-explored, we consider data properties at the heart of the proposed scheduling algorithm. To this end, we propose a new scheduling scheme for non-independent and-identically-distributed (non-IID) and unbalanced datasets in FEEL. As the data is the key component of the learning, we propose a new set of considerations for data characteristics in wireless scheduling algorithms in FEEL. In fact, the data collected by the devices depends on the local environment and usage pattern. Thus, the datasets vary in size and distributions among the devices. In the proposed algorithm, we consider both data and resource perspectives. In addition to minimizing the completion time of FEEL as well as the transmission energy of the participating devices, the algorithm prioritizes devices with rich and diverse datasets. We first define a general framework for the data-aware scheduling and the main axes and requirements for diversity evaluation. Then, we discuss diversity aspects and some exploitable techniques and metrics. Next, we formulate the problem and present our FEEL scheduling algorithm. Evaluations in different scenarios show that our proposed FEEL scheduling algorithm can help achieve high accuracy in few rounds with a reduced cost.

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

↑