Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent

10Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

One key element behind the progress of machine learning in recent years has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. In particular, we propose and analyze a new synchronization-avoiding scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification.

Cite

CITATION STYLE

APA

Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D. (2021). Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent. In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 10B, pp. 9037–9045). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v35i10.17092

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free