Improving Long-Term Online Prediction with Decoupled Extended Kalman Filters | BibSonomy

Improving Long-Term Online Prediction with Decoupled Extended Kalman Filters
, , , and .
Artificial Neural Networks -- ICANN 2002 (Proceedings), page 1055--1060. Berlin, Springer, (2002)

Long Short-Term Memory (LSTM) recurrent neural networks (RNNs) outperform traditional RNNs when dealing with sequences involving not only short-term but also long-term dependencies. The decoupled extended Kalman filter learning algorithm (DEKF) works well in online environments and reduces significantly the number of training steps when compared to the standard gradient-descent algorithms. Previous work on LSTM, however, has always used a form of gradient descent and has not focused on true online situations. Here we combine LSTM with DEKF and show that this new hybrid improves upon the original learning algorithm when applied to online processing.
  • @tb2332
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).