论文标题

电子树学习:一个新颖的分散模型学习框架

E-Tree Learning: A Novel Decentralized Model Learning Framework for Edge AI

论文作者

Yang, Lei, Lu, Yanyan, Cao, Jiannong, Huang, Jiaming, Zhang, Mingjin

论文摘要

传统上,AI模型在中央云上进行了培训,并从最终设备收集了数据。这导致沟通成本很高,响应时间和隐私问题。最近提出了Edge Edgeed AI,即Edge AI,以支持在网络边缘更接近数据源的网络边缘的AI模型学习和部署。现有的研究包括联合学习,采用了用于模型学习的集中式体系结构,其中中央服务器从客户/工人那里汇总了模型更新。集中式体系结构具有诸如性能瓶颈,差可扩展性和单点故障之类的缺点。在本文中,我们提出了一种新型的分散模型学习方法,即电子树,该方法利用了在边缘设备上施加的精心设计的树结构。树的结构以及树上的位置和聚合阶的最佳设计旨在提高训练的收敛性和模型准确性。特别是,我们通过考虑设备上的数据分布以及网络距离来设计一种由KMA命名的有效设备聚类算法,以电子树的名字命名。评估结果表明,在非IID数据下,E-Tree在模型的准确性和融合方面显着胜过基准方法,例如联合学习和八卦学习。

Traditionally, AI models are trained on the central cloud with data collected from end devices. This leads to high communication cost, long response time and privacy concerns. Recently Edge empowered AI, namely Edge AI, has been proposed to support AI model learning and deployment at the network edge closer to the data sources. Existing research including federated learning adopts a centralized architecture for model learning where a central server aggregates the model updates from the clients/workers. The centralized architecture has drawbacks such as performance bottleneck, poor scalability and single point of failure. In this paper, we propose a novel decentralized model learning approach, namely E-Tree, which makes use of a well-designed tree structure imposed on the edge devices. The tree structure and the locations and orders of aggregation on the tree are optimally designed to improve the training convergency and model accuracy. In particular, we design an efficient device clustering algorithm, named by KMA, for E-Tree by taking into account the data distribution on the devices as well as the the network distance. Evaluation results show E-Tree significantly outperforms the benchmark approaches such as federated learning and Gossip learning under NonIID data in terms of model accuracy and convergency.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源