The restricted Boltzmann machine (RBM) is a exible model for complex data. However, using RBMs for high-dimensional multinomial observations poses signicant computational diculties. In natural language processing applications, words are naturally modeled by K-ary discrete distributions, whereK 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 classication tasks, achieving state-of-the-art results on the latter.
['George E. Dahl', 'Hugo Larochelle', 'Ryan P. Adams']
Training Restricted Boltzmann Machines on Word Observations