Simple algorithm for recurrent neural networks that can learn sequence completion

István Szita, András Lorincz

Research output: Contribution to journalConference article


We can memorize long sequences like melodies or poems and it is intriguing to develop efficient connectionist representations for this problem. Recurrent neural networks have been proved to offer a reasonable approach here. We start from a few axiomatic assumptions and provide a simple mathematical framework that encapsulates the problem. A gradient-descent based algorithm is derived in this framework. Demonstrations on a benchmark problem show the applicability of our approach.

Original languageEnglish
Pages (from-to)183-188
Number of pages6
JournalIEEE International Conference on Neural Networks - Conference Proceedings
Publication statusPublished - Dec 1 2004
Event2004 IEEE International Joint Conference on Neural Networks - Proceedings - Budapest, Hungary
Duration: Jul 25 2004Jul 29 2004

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Simple algorithm for recurrent neural networks that can learn sequence completion'. Together they form a unique fingerprint.

  • Cite this