Efficient Language Modeling for Low-Resource Settings with Hybrid RNN-Transformer Architectures
Not on the map. Why?
Abstract (arXiv)
Transformer-based language models have recently been at the forefront of active research in text generation. However, these models' advances come at the price of prohibitive training costs, with parameter counts in the billions and compute requirements measured in petaflop/s-decades. In this paper, we investigate transformer-based architectures for improving model performance in a low-data regime by selectively replacing attention layers with feed-forward and quasi-recurrent neural network layers. We test these architectures on the standard Enwik8 and Wikitext-103 corpora. Our results show that our reduced architectures outperform existing models with a comparable number of parameters, and obtain comparable performance to larger models while significantly reducing the number of parameters.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 34 of its 45 references that are in the map. First posted on arXiv 2 Feb 2025.
Builds on
34 of 45 references.
References · 34
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
- 2022LaMDA: Language Models for Dialog Applicationscited by 1,218
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,046
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 699
22 more
- 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 632
- 2019Green AIcited by 620
- 2013Generating Sequences With Recurrent Neural Networkscited by 549
- 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 469
- 2021Towards Understanding and Mitigating Social Biases in Language Modelscited by 294
- 2018Adaptive Input Representations for Neural Language Modelingcited by 226
- 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 223
- 2020Understanding the Difficulty of Training Transformerscited by 210
- 2017Regularizing and Optimizing LSTM Language Modelscited by 205
- 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 189
- 2021Primer: Searching for Efficient Transformers for Language Modelingcited by 162
- 2019Adaptive Attention Span in Transformerscited by 148
- 2022Block-Recurrent Transformerscited by 107
- 2016Quasi-Recurrent Neural Networkscited by 87
- 2016Efficient softmax approximation for GPUscited by 67
- 2017Simple Recurrent Units for Highly Parallelizable Recurrencecited by 60
- 2021When Attention Meets Fast Recurrence: Training Language Models with Reduced Computecited by 34
- 2018An Analysis of Neural Language Modeling at Multiple Scalescited by 31
- 2019Modeling Recurrence for Transformercited by 26
- 2019Single Headed Attention RNN: Stop Thinking With Your Headcited by 25
- 2021Controllable and Diverse Text Generation in E-commercecited by 13
- 2020Pay Attention when Requiredcited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.