Kalman filters improve LSTM network performance in problems unsolvable by traditional recurrent nets

  • Authors:
  • Juan Antonio Pérez-Ortiz;Felix A. Gers;Douglas Eck;Jürgen Schmidhuber

  • Affiliations:
  • Departament de Llenguatges i Sistemes Informàtics, Universitat d'Alacant, E-03071 Alacant, Spain;Mantik Bioinformatik GmbH, Neue Gruenstrasse 18, 10179 Berlin, Germany;IDSIA, Galleria 2, 6928 Manno, Switzerland;IDSIA, Galleria 2, 6928 Manno, Switzerland

  • Venue:
  • Neural Networks
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

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.