AdaDelay: Delay Adaptive Distributed Stochastic Convex Optimization

By Suvrit Sra, Adams Wei Yu, Mu Li, Alex Smola. 2015

31 citations recorded by the source corpus.

We study distributed stochastic convex optimization under the delayed gradient model where the server nodes perform parameter updates, while the worker nodes compute stochastic gradients. We discuss, analyze, and experiment with a setup motivated by the behavior of real-world distributed computation networks, where the machines are differently slow at different time. Therefore, we allow the parameter updates to be sensitive to the actual delays experienced, rather than to worst-case bounds on the maximum delay. This sensitivity leads to larger stepsizes, that can help gain rapid initial convergence without having to wait too long for slower machines, while maintaining the same asymptotic complexity. We obtain encouraging improvements to overall convergence for distributed experiments on real datasets with up to billions of examples and features.

Subfields: Artificial Intelligence, Computational Mechanics

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. Sebastian U. Stich
  2. Martin Jaggi
  3. Ji Liu
  4. Peter Richtárik
  5. Jakub Konecný
  6. Hanlin Tang
  7. Nati Srebro
  8. Tong Zhang

In Computational Mechanics

  1. Nati Srebro
  2. Sebastian U. Stich
  3. Peter Richtárik
  4. Ji Liu
  5. Ohad Shamir
  6. Jakub Konecný
  7. Yossi Arjevani
  8. Hanlin Tang

Citations in the corpus