Methods › Sequential › Recurrent Neural Networks › SRU

SRU

16 papers tagged archive 2025-07-28

Introduced by Tao Lei et al. in Simple Recurrent Units for Highly Parallelizable Recurrence

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

SRU, or Simple Recurrent Unit, is a recurrent neural unit with a light form of recurrence. SRU exhibits the same level of parallelism as convolution and feed-forward nets. This is achieved by balancing sequential dependence and independence: while the state computation of SRU is time-dependent, each state dimension is independent. This simplification enables CUDA-level optimizations that parallelize the computation across hidden dimensions and time steps, effectively using the full capacity of modern GPUs.

SRU also replaces the use of convolutions (i.e., ngram filters), as in QRNN and KNN, with more recurrent connections. This retains modeling capacity, while using less computation (and hyper-parameters). Additionally, SRU improves the training of deep recurrent models by employing highway connections and a parameter initialization scheme tailored for gradient propagation in deep architectures.

A single layer of SRU involves the following computation:

fₜ =σ(W_f xₜ+v_f ⊙cₜ₋₁+b_f)

cₜ =fₜ ⊙cₜ₋₁+(1-fₜ) ⊙(W xₜ)

rₜ =σ(Wᵣ xₜ+vᵣ ⊙cₜ₋₁+bᵣ)

hₜ =rₜ ⊙cₜ+(1-rₜ) ⊙xₜ

where W, W_f and Wᵣ are parameter matrices and v_f, vᵣ, b_f and bᵥ are parameter vectors to be learnt during training. The complete architecture decomposes to two sub-components: a light recurrence and a highway network,

The light recurrence component successively reads the input vectors xₜ and computes the sequence of states cₜ capturing sequential information. The computation resembles other recurrent networks such as LSTM, GRU and RAN. Specifically, a forget gate fₜ controls the information flow and the state vector cₜ is determined by adaptively averaging the previous state cₜ₋₁ and the current observation W x₊according to fₜ.

PaperSource

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is “Selective Recurrent Unit (SRU)”, a method in the paper “Selective-Stereo: Adaptive Frequency Information Selection for Stereo Matching” (arXiv:2403.00486, 166 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:2403.00486: its page on this site · ask the lookup about it.

Near matches the lookup lists, each a different name: SRU++; SRU-Pix2Pix; Selective Recurrent Unit (SRU); Single Request Untwinning (SRU).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 16 · with a code link: 9 · where Syntology ran a sample: 4 (2 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 16 tagged: 2 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 16 of 16, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 27 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Speech Recognition4
speech-recognition4
Translation3
Data Augmentation2
General Classification2
Language Modeling2
Language Modelling2
Machine Translation2
Question Answering2
CPU1
Denoising1
Diversity1
NMT1
Quantization1
Reading Comprehension1
Retrieval1
Robot Navigation1
Session-Based Recommendations1
Speech Denoising1
Speech Enhancement1

Usage over time archive 2025-07-28

Papers per year tagged with SRU: 2017 to 2024, peak 5 5 0 2017: 1 paper 2017 2018: 2 papers 2018 2019: 2 papers 2019 2020: 5 papers 2020 2021: 1 paper 2021 2022: 1 paper 2022 2023: 3 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (16 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Recurrent Neural Networks

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections