The Community for Technology Leaders
Neural Networks, IEEE - INNS - ENNS International Joint Conference on (2000)
Como, Italy
July 24, 2000 to July 27, 2000
ISSN: 1098-7576
ISBN: 0-7695-0619-4
pp: 3189
ABSTRACT
The size of the time intervals between events conveys information essential for numerous sequential tasks such as motor control and rhythm detection. While Hidden Markov Models tend to ignore this information, recurrent neural networks (RNNs) can in principle learn to make use of it. We focus on Long Short-Term Memory (LSTM) because it usually outperforms other RNNs. Surprisingly, LSTM augmented by “peephole connections” from its internal cells to its multiplicative gates can learn the fine distinction between sequences of spikes separated by either 50 or 49 discrete time steps, without the help of any short training exemplars. Without external resets or teacher forcing or loss of performance on tasks reported earlier, our LSTM variant also learns to generate very stable sequences of highly nonlinear, precisely timed spikes. This makes LSTM a promising approach for real-world tasks that require to time and count.
INDEX TERMS
CITATION

J. Schmidhuber and F. A. Gers, "Recurrent Nets that Time and Count," Neural Networks, IEEE - INNS - ENNS International Joint Conference on(IJCNN), Como, Italy, 2000, pp. 3189.
doi:10.1109/IJCNN.2000.861302
82 ms
(Ver 3.3 (11022016))