Tree-Structured Composition in Neural Networks without Tree-Structured Architectures

By Samuel R. Bowman, Christopher D. Manning, Christopher Potts. 2015

76 citations recorded by the source corpus.

Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models like LSTMs are in fact able to discover and implicitly use recursive compositional structure, at least for tasks with clear cues to that structure in the data. We demonstrate this possibility using an artificial data task for which recursive compositional structure is crucial, and find an LSTM-based sequence model can indeed learn to exploit the underlying tree structure. However, its performance consistently lags behind that of tree models, even on large training sets, suggesting that tree-structured models are more effective at exploiting recursive structure.

Subfields: Artificial Intelligence, Information Systems, Natural Language Processing, Model Architectures

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. Yoav Goldberg
  3. Kyunghyun Cho
  4. Yonatan Belinkov
  5. Yoshua Bengio
  6. Jianfeng Gao
  7. Luke S. Zettlemoyer
  8. Percy Liang

In Information Systems

  1. Kyunghyun Cho
  2. Aaron C. Courville
  3. Hong Yu
  4. Gilles Louppe
  5. Alessandro Sordoni
  6. Yoav Goldberg
  7. Tal Linzen
  8. Alexander M. Rush

In Natural Language Processing

  1. Yoav Goldberg
  2. Mohit Bansal
  3. Kyunghyun Cho
  4. Samuel R. Bowman
  5. Alexander M. Rush
  6. Yonatan Belinkov
  7. Jianfeng Gao
  8. Graham Neubig

In Model Architectures

  1. Alexander M. Rush
  2. Yoav Goldberg
  3. Kyunghyun Cho
  4. Aaron C. Courville
  5. Yoon Kim
  6. Yoshua Bengio
  7. Hong Yu
  8. Tsendsuren Munkhdalai

Citations in the corpus