arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.01656cs.DCcs.LG
收藏

异步联邦并行移动边缘学习的自适应任务分配

Adaptive Task Allocation for Asynchronous Federated and Parallelized Mobile Edge Learning

University of Idaho(爱达荷大学);Queen’s University(女王大学)

Umair Mohammad, Sameh Sorour

摘要:

本文提出了一种方案,以异步方式有效地执行分布式学习任务,同时最大限度地减少梯度老化的异构计算和通信能力的无线边缘节点。本文中考虑的方法确保所有设备在一定的持续时间内工作,该持续时间涵盖数据/模型分发、学习迭代、模型收集和全局聚合的时间。所得到的问题是一个整数非凸规划,二次等式约束以及线性等式和不等式约束。由于该问题是NP-难的,我们放松了整数约束,以便有效地解决它与可用的求解器。分析边界推导出使用KKT条件和拉格朗日分析结合的最佳和改进的方法。实验结果表明,该方法降低了梯度失效率,并能提供更好的准确性比同步计划和异步计划的平等任务分配。

英文摘要:

This paper proposes a scheme to efficiently execute distributed learning tasks in an asynchronous manner while minimizing the gradient staleness on wireless edge nodes with heterogeneous computing and communication capacities. The approach considered in this paper ensures that all devices work for a certain duration that covers the time for data/model distribution, learning iterations, model collection and global aggregation. The resulting problem is an integer non-convex program with quadratic equality constraints as well as linear equality and inequality constraints. Because the problem is NP-hard, we relax the integer constraints in order to solve it efficiently with available solvers. Analytical bounds are derived using the KKT conditions and Lagrangian analysis in conjunction with the suggest-and-improve approach. Results show that our approach reduces the gradient staleness and can offer better accuracy than the synchronous scheme and the asynchronous scheme with equal task allocation.

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

↑