Abstract
We propose a randomized relax-and-round 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.
| Original language | English (US) |
|---|---|
| State | Published - Jan 1 2014 |
| Externally published | Yes |
| Event | 2nd International Conference on Learning Representations, ICLR 2014 - Banff, Canada Duration: Apr 14 2014 → Apr 16 2014 |
Conference
| Conference | 2nd International Conference on Learning Representations, ICLR 2014 |
|---|---|
| Country/Territory | Canada |
| City | Banff |
| Period | 4/14/14 → 4/16/14 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics
- Education