MétaCan
Menu
Back to cohort

From RNNs to BERT: A Review of Neural Models for Sequence Learning

2025· review· en· W4414240964 on OpenAlexaff
Yuxuan Zhao

Bibliographic record

VenueTheoretical and Natural Science · 2025
Typereview
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRecurrent neural networkTransformerSequence learningArtificial neural networkLanguage modelSequence (biology)Process (computing)

Abstract

fetched live from OpenAlex

Learning sequence data is important in machine learning fields, including speech recognition, natural language processing, and time series prediction. Various approaches have been put out in recent years to manage these jobs. Early models like the Recurrent Neural Network (RNN) were able to process sequential information but encountered vanishing and exploding gradients problems. These issues were eventually addressed with the introduction of the Long Short-Term Memory (LSTM) and the Gated Recurrent Unit (GRU), which enhanced the capacity to learn long-term dependencies. The proposal of the attention mechanisms further enhanced the GRU’s performance and led the Transformer model to replace recurrence with attention, making training faster and more effective for large-scale data. Furthermore, BERT used pre-training and fine-tuning methods that brought a remarkable improvement in many NLP tasks. This paper reviews the development of these models, introduces the mechanisms of each model, compares their strengths and weaknesses, and finally discusses the challenges that still remain.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Review · Consensus signal: Review
Teacher disagreement score0.571
Threshold uncertainty score0.621

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.028
GPT teacher head0.353
Teacher spread0.325 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreReview

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueTheoretical and Natural ScienceSame topicNeural Networks and ApplicationsFrench-language works237,207