Please use this identifier to cite or link to this item:
|Title:||Cooled and relaxed survey propagation for MRFs|
|Citation:||Chieu, H.L.,Lee, W.S.,Teh, Y.-W. (2009). Cooled and relaxed survey propagation for MRFs. Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference. ScholarBank@NUS Repository.|
|Abstract:||We describe a new algorithm, Relaxed Survey Propagation (RSP), for finding MAP configurations in Markov random fields. We compare its performance with state-of-the-art algorithms including the max-product belief propagation, its sequential tree-reweighted variant, residual (sum-product) belief propagation, and tree-structured expectation propagation. We show that it outperforms all approaches for Ising models with mixed couplings, as well as on a web person disambiguation task formulated as a supervised clustering problem.|
|Source Title:||Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.