Neural Foundations · 1997
Bidirectional Recurrent Neural Networks
Schuster and Paliwal introduced the bidirectional recurrent network, which runs two recurrent networks over a sequence in opposite directions and combines their states, so each position's representation can use both past and future context, solving the limitation that a forward-only network cannot see later inputs.
Editorial record
Plain-language summary
The architecture processes a sequence left-to-right with one recurrent network and right-to-left with a second, then merges the two hidden states at each position before making a prediction. This gives every output access to the entire input sequence rather than only the elements seen so far. Because it requires the whole sequence up front it suits offline labeling tasks like speech and text tagging, and the bidirectional design later combined with LSTMs to become a standard component for sequence labeling.
Knowledge graph
Relationships
Antecedents
GeneralizesEvidence: Strongly supported
BERT: Pre-training of Deep Bidirectional Transformers
Bidirectionality realized by BERT
P-013
Descendants
ExtendsEvidence: Direct
Long Short-Term Memory (LSTM)
BiRNN runs LSTMs both directions
A-023
Source record
Provenance
- Record ID
- A-023
- Record created
- 2026-07-13
- Last reviewed
- 2026-07-14
- Record version
- 2
Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.