title: Kalman filters improve LSTM network performance in problems unsolvable by traditional recurrent nets.
abstract: The long short-term memory (LSTM) network trained by gradient descent solves difficult problems which traditional recurrent neural networks in general cannot. We have recently observed that the decoupled extended Kalman filter training algorithm allows for even better performance, reducing significantly the number of training steps when compared to the original gradient descent training algorithm. In this paper we present a set of experiments which are unsolvable by classical recurrent networks but which are solved elegantly and robustly and quickly by LSTM combined with Kalman filters.
authors.affiliation: Departament de Llenguatges i Sistemes Informàtics, Universitat d'Alacant, E-03071 Alacant, Spain. japerez@dlsi.ua.es
authors.forename: Juan Antonio
authors.initials: JA
authors.lastname: Pérez-Ortiz
authors.forename: Felix A
authors.initials: FA
authors.lastname: Gers
authors.forename: Douglas
authors.initials: D
authors.lastname: Eck
authors.forename: Jürgen
authors.initials: J
authors.lastname: Schmidhuber
mesh_terms: D000465:Algorithms; D016571:Neural Networks, Computer