HackerPapers

arXiv:1709.02755cs.CL

Simple Recurrent Units for Highly Parallelizable Recurrence

Tao Lei, Yu Zhang, Sida I. Wang, Hui Dai, Yoav Artzi

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
EMNLP
Journal reference
DOI
Subjects
cs.CLComputation and Language cs.NENeural and Evolutionary Computing

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2024 to Oct 2024. Found in 3 HN submissions from Sep 2017 to Sep 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Were RNNs all we needed? 1 comment
    • Excited to see more people working on RNNs but wish their citations were better. In 2016 my team from Salesforce Research published our work on the Quasi-Recurrent Neural Network[1] (QRNN). The QRNN variants we describe are near identical (minGRU) or highly similar (minLSTM) to…

      SmerityView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.