Relaxations for inference in restricted Boltzmann machines

Sida I. Wang, Roy Frostig, Percy Liang, Christopher D. Manning

Dec 24, 2013 (modified: Dec 24, 2013) ICLR 2014 workshop submission readers: everyone
  • Decision: submitted, no decision
  • Abstract: We propose a relaxation-based approximate inference algorithm that samples near-MAP configurations of a binary pairwise Markov random field. We experiment on MAP inference tasks in several restricted Boltzmann machines. We also use our underlying sampler to estimate the log-partition function of restricted Boltzmann machines and compare against other sampling-based methods.