Revisiting Recurrent Networks for Paraphrastic Sentence Embeddings

By John Wieting, Kevin Gimpel. 2017

78 citations recorded by the source corpus.

We consider the problem of learning general-purpose, paraphrastic sentence embeddings, revisiting the setting of Wieting et al. (2016b). While they found LSTM recurrent networks to underperform word averaging, we present several developments that together produce the opposite conclusion. These include training on sentence pairs rather than phrase pairs, averaging states to represent sequences, and regularizing aggressively. These improve LSTMs in both transfer learning and supervised settings. We also introduce a new recurrent architecture, the Gated Recurrent Averaging Network, that is inspired by averaging and LSTMs while outperforming them both. We analyze our learned models, finding evidence of preferences for particular parts of speech and dependency relations.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Natural Language Processing, Representation & Self-Supervised Learning

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. Graham Neubig
  2. Mohit Bansal
  3. Jianfeng Gao
  4. Luke S. Zettlemoyer
  5. Noah A. Smith
  6. Percy Liang
  7. Hinrich Schütze
  8. John Wieting

In Computer Vision and Pattern Recognition

  1. Graham Neubig
  2. Jianfeng Gao
  3. Luc Van Gool
  4. Mohit Bansal
  5. Dacheng Tao
  6. Trevor Darrell
  7. Ming-Hsuan Yang
  8. Xiaogang Wang

In Natural Language Processing

  1. Graham Neubig
  2. John Wieting
  3. Kevin Gimpel
  4. Mohit Bansal
  5. Hinrich Schütze
  6. Jianfeng Gao
  7. Noah A. Smith
  8. Luke S. Zettlemoyer

In Representation & Self-Supervised Learning

  1. Graham Neubig
  2. John Wieting
  3. Kevin Gimpel
  4. Sebastian Ruder
  5. Taylor Berg-Kirkpatrick
  6. Jeremy Howard
  7. Jonathan Mallinson
  8. Eduard H. Hovy

Citations in the corpus