Decentralized gradient methods: does topology matter?

By Giovanni Neglia, Chuan Xu, D. Towsley, Gianmarco Calbi. 2020

67 citations recorded by the source corpus.

Consensus-based distributed optimization methods have recently been advocated as alternatives to parameter server and ring all-reduce paradigms for large scale training of machine learning models. In this case, each worker maintains a local estimate of the optimal parameter vector and iteratively updates it by averaging the estimates obtained from its neighbors, and applying a correction on the basis of its local dataset. While theoretical results suggest that worker communication topology should have strong impact on the number of epochs needed to converge, previous experiments have shown the opposite conclusion. This paper sheds lights on this apparent contradiction and show how sparse topologies can lead to faster convergence even in the absence of communication delays.

Subfields: Artificial Intelligence, Computer Networks and Communications, Optimization & Training, Federated & Distributed Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jianhua Lu
  2. Jianmin Lu
  3. Aurélien Bellet
  4. Yuanming Shi
  5. Edwige Cyffers
  6. Giovanni Neglia
  7. Othmane Marfoq
  8. Richard Vidal

In Computer Networks and Communications

  1. Yuanming Shi
  2. Jianmin Lu
  3. Jianhua Lu
  4. Khaled Ben Letaief
  5. Aurélien Bellet
  6. Giovanni Neglia
  7. Othmane Marfoq
  8. Edwige Cyffers

In Optimization & Training

  1. Khaled Ben Letaief
  2. Jianhua Lu
  3. Aurélien Bellet
  4. Giovanni Neglia
  5. Yuanming Shi
  6. Othmane Marfoq
  7. Edwige Cyffers
  8. Richard Vidal

In Federated & Distributed Learning

  1. Edwige Cyffers
  2. Othmane Marfoq
  3. Richard Vidal
  4. Giovanni Neglia
  5. Laetitia Kameni
  6. Khaled Ben Letaief
  7. Jianhua Lu
  8. Aurélien Bellet

Citations in the corpus