Tao Lei
Large language models have become increasingly difficult to train because of the growing computation time and cost. In this work, we present SRU++, a highly-efficient architecture that combines fast recurrence and attention for sequence modeling. SRU++ exhibits strong modeling capacity and training efficiency. On standard language modeling tasks such as Enwik8, Wiki-103 and Billion Word datasets, our model obtains better bits-per-character and perplexity while using 3x-10x less training cost compared to top-performing Transformer models. For instance, our model achieves a state-of-the-art result on the Enwik8 dataset using 1.6 days of training on an 8-GPU machine. We further demonstrate that SRU++ requires minimal attention for near state-of-the-art performance. Our results suggest jointly leveraging fast recurrence with little attention as a promising direction for accelerating model training and inference.
| Task | Dataset | Metric | Value | Model |
|---|---|---|---|---|
| Language Modelling | WikiText-103 | Test perplexity | 17.1 | SRU++ Large |
| Language Modelling | WikiText-103 | Validation perplexity | 16.4 | SRU++ Large |
| Language Modelling | WikiText-103 | Test perplexity | 18.3 | SRU++ Base |
| Language Modelling | WikiText-103 | Validation perplexity | 17.5 | SRU++ Base |
| Language Modelling | One Billion Word | PPL | 23.5 | SRU++ Large |
| Language Modelling | One Billion Word | PPL | 25.1 | SRU++ |
| Language Modelling | enwik8 | Bit per Character (BPC) | 0.95 | SRU++ Large |
| Language Modelling | enwik8 | Bit per Character (BPC) | 0.97 | SRU++ Base |