LGNov 18, 2015

Staleness-aware Async-SGD for Distributed Deep Learning

arXiv:1511.05950v5280 citations
Originality Incremental advance
AI Analysis

This addresses the problem of achieving convergence and linear speedup in distributed deep learning for practitioners, but it is incremental as it builds on existing ASGD methods.

The paper tackles the challenge of tuning hyperparameters like learning rate in asynchronous SGD for distributed deep learning by proposing a variant that modulates the learning rate based on gradient staleness, with experimental verification on CIFAR10 and Imagenet showing superior effectiveness compared to synchronous SGD and conventional ASGD.

Deep neural networks have been shown to achieve state-of-the-art performance in several machine learning tasks. Stochastic Gradient Descent (SGD) is the preferred optimization algorithm for training these networks and asynchronous SGD (ASGD) has been widely adopted for accelerating the training of large-scale deep networks in a distributed computing environment. However, in practice it is quite challenging to tune the training hyperparameters (such as learning rate) when using ASGD so as achieve convergence and linear speedup, since the stability of the optimization algorithm is strongly influenced by the asynchronous nature of parameter updates. In this paper, we propose a variant of the ASGD algorithm in which the learning rate is modulated according to the gradient staleness and provide theoretical guarantees for convergence of this algorithm. Experimental verification is performed on commonly-used image classification benchmarks: CIFAR10 and Imagenet to demonstrate the superior effectiveness of the proposed approach, compared to SSGD (Synchronous SGD) and the conventional ASGD algorithm.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes