mlsanityData to 14 Oct 2026

Sliced Recurrent Neural Networks

arXiv 1807.02291 ↗First posted 6 Jul 2018cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Recurrent neural networks have achieved great success in many NLP tasks. However, they have difficulty in parallelization because of the recurrent structure, so it takes much time to train RNNs. In this paper, we introduce sliced recurrent neural networks (SRNNs), which could be parallelized by slicing the sequences into many subsequences. SRNNs have the ability to obtain high-level information through multiple layers with few extra parameters. We prove that the standard RNN is a special case of the SRNN when we use linear activation functions. Without changing the recurrent units, SRNNs are 136 times as fast as standard RNNs and could be even faster when we train longer sequences. Experiments on six largescale sentiment analysis datasets show that SRNNs achieve better performance than standard RNNs.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Jul 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 1; 2025: 0; 2026: 1.

7 papers.