Skip to content

LSTM: A Search Space Odyssey

Klaus Greff, Jan Koutník, Bas R. Steunebrink, Jürgen Schmidhuber

IEEE Transactions on Neural Networks and Learning Systems · 2016 · 7,381 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Greff, K., Srivastava, R. K., Koutník, J., Steunebrink, B. R., & Schmidhuber, J. (2016). LSTM: A search space odyssey. IEEE Transactions on Neural Networks and Learning Systems, 28(10), 2222–2232. https://doi.org/10.1109/tnnls.2016.2582924

In text: (Greff et al., 2016)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Several variants of the long short-term memory (LSTM) architecture for recurrent neural networks have been proposed since its inception in 1995. In recent years, these networks have become the state-of-the-art models for a variety of machine learning problems. This has led to a renewed interest in understanding the role and utility of various computational components of typical LSTM variants. In this paper, we present the first large-scale analysis of eight LSTM variants on three representative tasks: speech recognition, handwriting recognition, and polyphonic music modeling. The hyperparameters of all LSTM variants for each task were optimized separately using random search, and their importance was assessed using the powerful functional ANalysis Of VAriance framework. In total, we summarize the results of 5400 experimental runs ( ≈ 15 years of CPU time), which makes our study the largest of its kind on LSTM networks. Our results show that none of the variants can improve upon the standard LSTM architecture significantly, and demonstrate the forget gate and the output activation function to be its most critical components. We further observe that the studied hyperparameters are virtually independent and derive guidelines for their efficient adjustment.

  1. Long Short-Term Memory1997
  2. Gradient-based learning applied to document recognition1998
  3. Particle swarm optimization2002
  4. Greedy function approximation: A gradient boosting machine.2001
  5. Statistical Learning Theory1999

Metadata from OpenAlex (CC0). Citations are generated from the published record.