Simple Recurrent Units for Highly Parallelizable Recurrence

Tao Lei, Yu Zhang, Sida I. Wang, Hui Dai, Yoav Artzi
9/8/2017
cs.CLcs.NE

Official code: asappresearch/sru (2,108 stars, MIT, PyTorch, last commit 2022-01-04).

Abstract

Common recurrent neural architectures scale poorly due to the intrinsic difficulty in parallelizing their state computations. In this work, we propose the Simple Recurrent Unit (SRU), a light recurrent unit that balances model capacity and scalability. SRU is designed to provide expressive recurrence, enable highly parallelized implementation, and comes with careful initialization to facilitate training of deep models. We demonstrate the effectiveness of SRU on multiple NLP tasks. SRU achieves 5--9x speed-up over cuDNN-optimized LSTM on classification and question answering datasets, and delivers stronger results than LSTM and convolutional models. We also obtain an average of 0.7 BLEU improvement over the Transformer model on translation by incorporating SRU into the architecture.

View on arXivView PDF

Code Implementations(1)

asappresearch/sruOfficial100%
PyTorchMIT

Training RNNs as Fast as CNNs (https://arxiv.org/abs/1709.02755)

2,108304C++, CudaAug 28, 20174 years agoMIT
deep-learningnlppytorchrecurrent-neural-networks

Similar Papers

Cite this paper

@article{lei2017simple,
  title  = {Simple Recurrent Units for Highly Parallelizable Recurrence},
  author = {Tao Lei and Yu Zhang and Sida I. Wang and Hui Dai and Yoav Artzi},
  year   = {2017},
  eprint = {1709.02755},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1709.02755}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1709.02755.svg)](https://codeofpaper.com/paper/1709.02755)

Discussion