Online Symbolic-Sequence Prediction with Discrete-Time Recurrent Neural Networks

This paper studies the use of discrete-time recurrent neural networks for predicting the next symbol in a sequence. The focus is on online prediction, a task much harder than the classical offline grammatical inference with neural networks. The results obtained show that the performance of recurrent networks working online is acceptable when sequences come from finite-state machines or even from some chaotic sources. When predicting texts in human language, however, dynamics seem to be too complex to be correctly learned in real-time by the net. Two algorithms are considered for network training: real-time recurrent learning and the decoupled extended Kalman filter.

• Type: Conference
• Year: 2001
• Where: ICANN
• Authors: Juan Antonio Pérez-Ortiz, Jorge Calera-Rubio, Mikel L. Forcada
• Keywords: ICANN 2001, Neural Networks, Recurrent Networks, Recurrent Neural Networks