Kalman filters improve LSTM network performance in problems unsolvable by traditional recurrent nets
- 1 March 2003
- journal article
- research article
- Published by Elsevier in Neural Networks
- Vol. 16 (2) , 241-250
- https://doi.org/10.1016/s0893-6080(02)00219-8
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- LSTM recurrent networks learn simple context-free and context-sensitive languagesIEEE Transactions on Neural Networks, 2001
- Context-free and context-sensitive dynamics in recurrent neural networksConnection Science, 2000
- Learning to Forget: Continual Prediction with LSTMNeural Computation, 2000
- A Recurrent Neural Network that Learns to CountConnection Science, 1999
- Long Short-Term MemoryNeural Computation, 1997
- A Fixed Size Storage O(n3) Time Complexity Learning Algorithm for Fully Recurrent Continually Running NetworksNeural Computation, 1992
- A recurrent error propagation network speech recognition systemComputer Speech & Language, 1991
- An Efficient Gradient-Based Algorithm for On-Line Training of Recurrent Network TrajectoriesNeural Computation, 1990
- A Learning Algorithm for Continually Running Fully Recurrent Neural NetworksNeural Computation, 1989
- A Local Learning Algorithm for Dynamic Feedforward and Recurrent NetworksConnection Science, 1989