arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2010.00239cs.AIcs.DCcs.DS
收藏

异构联邦学习设备的最优任务分配

Optimal Task Assignment to Heterogeneous Federated Learning Devices

Univ. Paris-Saclay(巴黎萨克雷大学);CNRS(法国国家科学研究中心);Laboratoire de Recherche en Informatique (LRI)(计算机科学与信息学实验室(LRI));Orsay(奥赛)

Laércio Lima Pilla

摘要:

联邦学习为训练机器学习模型提供了新的机会,同时尊重数据隐私。该技术基于异构设备,这些设备一起工作以迭代地训练模型,而从不共享它们自己的数据。鉴于此训练的同步性质,联邦学习系统的性能由最慢的设备(也称为落后者)决定。在本文中,我们研究了通过控制每个设备用于训练的数据量来最小化联邦学习轮次的持续时间的问题。我们制定这个问题作为一个最大完工时间最小化问题,具有相同的,独立的,原子的任务,必须分配到异构资源的非递减成本函数,同时尊重每个资源的任务的下限和上限。基于这个公式,我们提出了一个多项式时间算法命名为OLAR,并证明它提供了最优的时间表。我们评估OLAR在一个广泛的实验评估使用模拟,包括比较其他算法的最先进的和新的扩展。我们的研究结果表明,OLAR提供了一个小的执行时间的最佳解决方案。他们还表明,每个资源的任务的下限和上限的存在消除了次优算法在算法执行时间方面可以提供的任何好处。

英文摘要:

Federated Learning provides new opportunities for training machine learning models while respecting data privacy. This technique is based on heterogeneous devices that work together to iteratively train a model while never sharing their own data. Given the synchronous nature of this training, the performance of Federated Learning systems is dictated by the slowest devices, also known as stragglers. In this paper, we investigate the problem of minimizing the duration of Federated Learning rounds by controlling how much data each device uses for training. We formulate this problem as a makespan minimization problem with identical, independent, and atomic tasks that have to be assigned to heterogeneous resources with non-decreasing cost functions while respecting lower and upper limits of tasks per resource. Based on this formulation, we propose a polynomial-time algorithm named OLAR and prove that it provides optimal schedules. We evaluate OLAR in an extensive experimental evaluation using simulation that includes comparisons to other algorithms from the state of the art and new extensions to them. Our results indicate that OLAR provides optimal solutions with a small execution time. They also show that the presence of lower and upper limits of tasks per resource erase any benefits that suboptimal heuristics could provide in terms of algorithm execution time.

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

↑