Visualizing and Understanding Recurrent Networks

By Andrej Karpathy, Justin Johnson, Li Fei-Fei. 2015

1,142 citations recorded by the source corpus.

Recurrent Neural Networks (RNNs), and specifically a variant with Long Short-Term Memory (LSTM), are enjoying renewed interest as a result of successful applications in a wide range of machine learning problems that involve sequential data. However, while LSTMs provide exceptional results in practice, the source of their performance and their limitations remain rather poorly understood. Using character-level language models as an interpretable testbed, we aim to bridge this gap by providing an analysis of their representations, predictions and error types. In particular, our experiments reveal the existence of interpretable cells that keep track of long-range dependencies such as line lengths, quotes and brackets. Moreover, our comparative analysis with finite horizon n-gram models traces the source of the LSTM improvements to long-range structural dependencies. Finally, we provide analysis of the remaining errors and suggests areas for further study.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Jianfeng Gao
  3. Yonatan Belinkov
  4. Percy Liang
  5. Graham Neubig
  6. Luke S. Zettlemoyer
  7. Yoshua Bengio
  8. Yejin Choi

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Trevor Darrell
  4. Xiaogang Wang
  5. Ming-Hsuan Yang
  6. Jitendra Malik
  7. Yi Yang
  8. Andrew Zisserman

In Natural Language Processing

  1. Yonatan Belinkov
  2. Mohit Bansal
  3. Graham Neubig
  4. Jianfeng Gao
  5. Luke S. Zettlemoyer
  6. Percy Liang
  7. Yejin Choi
  8. Noah A. Smith

Citations in the corpus