Learning Word Representations with Hierarchical Sparse Coding

By Dani Yogatama, Manaal Faruqui, Chris Dyer, Noah A. Smith. 2014

61 citations recorded by the source corpus.

We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perform hierarchical sparse coding on a corpus of billions of word tokens. Experiments on various benchmark tasks---word similarity ranking, analogies, sentence completion, and sentiment analysis---demonstrate that the method outperforms or is competitive with state-of-the-art methods. Our word representations are available at \url{this http URL}.

Subfields: 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 Natural Language Processing

  1. Yulia Tsvetkov
  2. Xipeng Qiu
  3. Noah A. Smith
  4. Chris Dyer
  5. Graham Neubig
  6. Xuanjing Huang
  7. Yonatan Belinkov
  8. Kai-Wei Chang

In Representation & Self-Supervised Learning

  1. Yulia Tsvetkov
  2. Kai-Wei Chang
  3. Rahul C. Deo
  4. Xipeng Qiu
  5. Xuanjing Huang
  6. Noah A. Smith
  7. Chris Dyer
  8. Manaal Faruqui

Citations in the corpus