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.
|Number of pages||6|
|Journal||IEEE International Conference on Neural Networks - Conference Proceedings|
|Publication status||Published - Dec 1 2004|
|Event||2004 IEEE International Joint Conference on Neural Networks - Proceedings - Budapest, Hungary|
Duration: Jul 25 2004 → Jul 29 2004
ASJC Scopus subject areas