An Open-Source and Reproducible Implementation of LSTM and GRU Networks for Time Series Forecasting

Bibliographic Details
Title: An Open-Source and Reproducible Implementation of LSTM and GRU Networks for Time Series Forecasting
Authors: Velarde, Gissel, Branez, Pedro, Bueno, Alejandro, Heredia, Rodrigo, Lopez-Ledezma, Mateo
Source: Eng. Proc. 2022, 18(1), 30
Publication Year: 2025
Collection: Computer Science
Subject Terms: Computer Science - Machine Learning
More Details: This paper introduces an open-source and reproducible implementation of Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU) Networks for time series forecasting. We evaluated LSTM and GRU networks because of their performance reported in related work. We describe our method and its results on two datasets. The first dataset is the S&P BSE BANKEX, composed of stock time series (closing prices) of ten financial institutions. The second dataset, called Activities, comprises ten synthetic time series resembling weekly activities with five days of high activity and two days of low activity. We report Root Mean Squared Error (RMSE) between actual and predicted values, as well as Directional Accuracy (DA). We show that a single time series from a dataset can be used to adequately train the networks if the sequences in the dataset contain patterns that repeat, even with certain variation, and are properly processed. For 1-step ahead and 20-step ahead forecasts, LSTM and GRU networks significantly outperform a baseline on the Activities dataset. The baseline simply repeats the last available value. On the stock market dataset, the networks perform just like the baseline, possibly due to the nature of these series. We release the datasets used as well as the implementation with all experiments performed to enable future comparisons and to make our research reproducible.
Comment: 12 pages
Document Type: Working Paper
DOI: 10.3390/engproc2022018030
Access URL: http://arxiv.org/abs/2504.18185
Accession Number: edsarx.2504.18185
Database: arXiv
More Details
DOI:10.3390/engproc2022018030