mlsanityData to 7 Oct 2026

Accelerating Asynchronous Stochastic Gradient Descent for Neural Machine Translation

arXiv 1808.08859 ↗First posted 27 Aug 2018cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

In order to extract the best possible performance from asynchronous stochastic gradient descent one must increase the mini-batch size and scale the learning rate accordingly. In order to achieve further speedup we introduce a technique that delays gradient updates effectively increasing the mini-batch size. Unfortunately with the increase of mini-batch size we worsen the stale gradient problem in asynchronous stochastic gradient descent (SGD) which makes the model convergence poor. We introduce local optimizers which mitigate the stale gradient problem and together with fine tuning our momentum we are able to train a shallow machine translation system 27% faster than an optimized baseline with negligible penalty in BLEU.

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.