Training Restricted Boltzmann Machines on Word Observations

By George E. Dahl, Ryan P. Adams, Hugo Larochelle. 2012

96 citations recorded by the source corpus.

The restricted Boltzmann machine (RBM) is a flexible model for complex data. However, using RBMs for high-dimensional multinomial observations poses significant computational difficulties. In natural language processing applications, words are naturally modeled by K-ary discrete distributions, where K is determined by the vocabulary size and can easily be in the hundred thousands. The conventional approach to training RBMs on word observations is limited because it requires sampling the states of K-way softmax visible units during block Gibbs updates, an operation that takes time linear in K. In this work, we address this issue with a more general class of Markov chain Monte Carlo operators on the visible units, yielding updates with computational complexity independent of K. We demonstrate the success of our approach by training RBMs on hundreds of millions of word n-grams using larger vocabularies than previously feasible with RBMs and by using the learned features to improve performance on chunking and sentiment classification tasks, achieving state-of-the-art results on the latter.

Subfields: Artificial Intelligence, 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. Mohit Bansal
  2. Kyunghyun Cho
  3. Jianfeng Gao
  4. Yoshua Bengio
  5. Quoc V. Le
  6. Furu Wei
  7. Percy Liang
  8. Graham Neubig

In Representation & Self-Supervised Learning

  1. Yoshua Bengio
  2. Ting-Wei Liu
  3. Christopher D. Manning
  4. Quoc V. Le
  5. Noah A. Smith
  6. Bing Qin
  7. Duyu Tang
  8. Phil Blunsom

Citations in the corpus