Skip to Main content Skip to Navigation
New interface
Conference papers

A Delay-tolerant Proximal-Gradient Algorithm for Distributed Learning

Abstract : Distributed learning aims at computing high-quality models by training over scattered data. This covers a diversity of scenarios, including computer clusters or mobile agents. One of the main challenges is then to deal with heterogeneous machines and unreliable communications. In this setting, we propose and analyze a flexible asynchronous optimization algorithm for solving nonsmooth learning problems. Unlike most existing methods, our algorithm is adjustable to various levels of communication costs, machines computational powers, and data distribution evenness. We prove that the algorithm converges linearly with a fixed learning rate that does not depend on communication delays nor on the number of machines. Although long delays in communication may slow down performance, no delay can break convergence.
Complete list of metadata
Contributor : Franck Iutzeler Connect in order to contact the contributor
Submitted on : Monday, January 28, 2019 - 2:48:20 PM
Last modification on : Wednesday, July 6, 2022 - 4:24:52 AM


  • HAL Id : hal-01996562, version 1


Konstantin Mishchenko, Franck Iutzeler, Jérôme Malick, Massih-Reza Amini. A Delay-tolerant Proximal-Gradient Algorithm for Distributed Learning. International Conference on Machine Learning, Jul 2018, Stockholm, Sweden. pp.3587-3595. ⟨hal-01996562⟩



Record views