Vural, Nuri Mertİlhan, FatihYılmaz, Selim FıratErgüt, S.Kozat, Süleyman Serdar2022-03-042022-03-042021-06-172162-237Xhttp://hdl.handle.net/11693/77682Recurrent neural networks (RNNs) are widely used for online regression due to their ability to generalize nonlinear temporal dependencies. As an RNN model, long short-term memory networks (LSTMs) are commonly preferred in practice, as these networks are capable of learning long-term dependencies while avoiding the vanishing gradient problem. However, due to their large number of parameters, training LSTMs requires considerably longer training time compared to simple RNNs (SRNNs). In this article, we achieve the online regression performance of LSTMs with SRNNs efficiently. To this end, we introduce a first-order training algorithm with a linear time complexity in the number of parameters. We show that when SRNNs are trained with our algorithm, they provide very similar regression performance with the LSTMs in two to three times shorter training time. We provide strong theoretical analysis to support our experimental results by providing regret bounds on the convergence rate of our algorithm. Through an extensive set of experiments, we verify our theoretical work and demonstrate significant performance improvements of our algorithm with respect to LSTMs and the other state-of-the-art learning models.EnglishNeural network trainingOnline gradient descentOnline learningRecurrent neural networks (RNNs)RegressionArticle10.1109/TNNLS.2021.30860292162-2388