A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Simple algorithm for recurrent neural networks that can learn sequence completion
2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)
Preserved Fulltext
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.
doi:10.1109/ijcnn.2004.1379895
fatcat:l6akmpx7mfdepobjql5kayox6i