Relaxations for inference in restricted Boltzmann machinesDownload PDF

29 Nov 2024 (modified: 24 Dec 2013)ICLR 2014Readers: 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.
3 Replies

Loading