Learning to Compose Task-Specific Tree Structures

By Jihun Choi, Kang Min Yoo, Sang-goo Lee. 2017

196 citations recorded by the source corpus.

For years, recursive neural networks (RvNNs) have been shown to be suitable for representing text into fixed-length vectors and achieved good performance on several natural language processing tasks. However, the main drawback of RvNNs is that they require structured input, which makes data preparation and model implementation hard. In this paper, we propose Gumbel Tree-LSTM, a novel tree-structured long short-term memory architecture that learns how to compose task-specific tree structures only from plain text data efficiently. Our model uses Straight-Through Gumbel-Softmax estimator to decide the parent node among candidates dynamically and to calculate gradients of the discrete decision. We evaluate the proposed model on natural language inference and sentiment analysis,  and show that our model outperforms or is at least comparable to previous models. We also find that our model converges significantly faster than other models.

Subfields: Artificial Intelligence, 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. Jianfeng Gao
  3. Caiming Xiong
  4. Luke S. Zettlemoyer
  5. Richard Socher
  6. Graham Neubig
  7. Percy Liang
  8. Yejin Choi

In Natural Language Processing

  1. Mohit Bansal
  2. Richard Socher
  3. Graham Neubig
  4. Caiming Xiong
  5. Samuel R. Bowman
  6. Jianfeng Gao
  7. Luke S. Zettlemoyer
  8. Kyunghyun Cho

In Model Architectures

  1. Chris Dyer
  2. Samuel R. Bowman
  3. Alexander M. Rush
  4. Richard Socher
  5. Yoon Kim
  6. Caiming Xiong
  7. Nitish Shirish Keskar
  8. Xipeng Qiu

Citations in the corpus