paper-with-me

Papers

Making Asynchronous Stochastic Gradient Descent Work for Transformers

2019-06-08 · WS 2019 11 · Alham Fikri Aji, Kenneth Heafield

Asynchronous stochastic gradient descent (SGD) is attractive from a speed perspective because workers do not wait for synchronization. However, the Transformer model converges poorly with asynchronous SGD, resulting in substantially lower quality compared to synchronous SGD. To investigate why this is the case, we isolate differences between asynchronous and synchronous methods to investigate batch size and staleness effects. We find that summing several asynchronous updates, rather than applying them immediately, restores convergence behavior. With this hybrid method, Transformer training for neural machine translation task reaches a near-convergence level 1.36x faster in single-node multi-GPU training with no impact on model quality.

📄 PDF Abstract BibTeX arXiv:1906.03496

Code (0)

등록된 구현이 없습니다.

Tasks

GPUMachine TranslationTranslation

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Position-Wise Feed-Forward Layer 설명 없음
SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…
Residual Connection 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…

Similar Papers 제목 키워드 기반

Accelerating Asynchronous Stochastic Gradient Descent for Neural Machine Translation

2018-08-27 · EMNLP 2018 10 · Nikolay Bogoychev, Marcin Junczys-Dowmunt, Kenneth Heafield, Alham Fikri Aji

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 introd…

Machine TranslationTranslation

Decoupled Asynchronous Proximal Stochastic Gradient Descent with Variance Reduction

2016-09-22 · Zhouyuan Huo, Bin Gu, Heng Huang

In the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoup…

Asynchronous Stochastic Gradient Descent with Variance Reduction for Non-Convex Optimization

2016-04-12 · Zhouyuan Huo, Heng Huang

We provide the first theoretical analysis on the convergence rate of the asynchronous stochastic variance reduced gradient (SVRG) descent algorithm on non-convex optimization. Recent studies have shown that the asynchron…

Stochastic modified equations for the asynchronous stochastic gradient descent

2018-05-21 · Jing An, Jianfeng Lu, Lexing Ying

We propose a stochastic modified equations (SME) for modeling the asynchronous stochastic gradient descent (ASGD) algorithms. The resulting SME of Langevin type extracts more information about the ASGD dynamics and eluci…

Asynchronous decentralized accelerated stochastic gradient descent

2018-09-24 · Guanghui Lan, Yi Zhou

In this work, we introduce an asynchronous decentralized accelerated stochastic gradient descent type of method for decentralized stochastic optimization, considering communication and synchronization are the major bottl…

Stochastic Optimization