Next: TRIVIAL PREVIOUS LONG TIME
LSTM CAN SOLVE HARD
LONG TIME LAG PROBLEMS
Sepp Hochreiter, TUM
Jürgen Schmidhuber, IDSIA
Abstract:
Standard recurrent nets cannot deal with long minimal
time lags between relevant signals. Several recent NIPS papers
propose alternative methods. We first show: problems used to
promote various previous algorithms
can be solved more quickly by random weight guessing
than by the proposed algorithms. We then use
LSTM, our own recent algorithm, to solve hard
problems that can neither be quickly solved by random
search nor by any other recurrent net
algorithm we are aware of.
Juergen Schmidhuber
2003-02-25
Back to Recurrent Neural Networks page