mlsanityData to 14 Oct 2026

Asynchronous Distributed Semi-Stochastic Gradient Optimization

arXiv 1508.01633 ↗First posted 7 Aug 2015cs.LG cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

With the recent proliferation of large-scale learning problems,there have been a lot of interest on distributed machine learning algorithms, particularly those that are based on stochastic gradient descent (SGD) and its variants. However, existing algorithms either suffer from slow convergence due to the inherent variance of stochastic gradients, or have a fast linear convergence rate but at the expense of poorer solution quality. In this paper, we combine their merits by proposing a fast distributed asynchronous SGD-based algorithm with variance reduction. A constant learning rate can be used, and it is also guaranteed to converge linearly to the optimal solution. Experiments on the Google Cloud Computing Platform demonstrate that the proposed algorithm outperforms state-of-the-art distributed asynchronous algorithms in terms of both wall clock time and solution quality.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 7 Aug 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.