A Comparative study of Long Short-Term Memory and Gated Recurrent Unit
Bibliographic record
Abstract
In natural language processing (NLP), the assumption that a neural network has an independent state among data samples does not apply to sequential data.Hence recurrent neural networks (RNN) have played a key role in sequential dependency in natural language processing with the key features of providing context to the processing and tackling vanishing gradient.Long Short-Term Memory Units (LSTM) are RNN blocks that can retain essential information even if it is far from the current point of analysis (extended memory).Still, they also have a fading effect that favours closer information (short memory).Despite this, they still need to remember vital details far from their current position, which goes against the intent of the extended memory effect.Gated Recurrent Units (GRU) have shown excellent results in sequential data and were introduced to overcome the limitations of LSTM by using two vectors (update gate and reset gate) to decide what information passes to the output.They can also train to keep data for a long time without it washing it through time or removing information irrelevant to the prediction.Some scholars suggest that gated recurrent units could be a suitable replacement for long short term memory.This comparative study presented the performance difference between LSTM and GRU and their bi-directional-based neural networks when they face the task of classifying text data.The evaluation of Gated Recurrent Unit (GRU) versus Long Short Term Memory (LSTM) and their bi-directional versions were carried out on a task of a website based on its content.Our analysis showed that a gated recurrent unit (GRU) is a good substitute for long short-term memory for text data classification.The bi-directional GRU outperformed the bi-direction LSTM.We recommend a gated recurrent unit as a better alternative to Long Short Term Memory on text data classification.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".