A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximate message-passing inference algorithm
2007
2007 IEEE Information Theory Workshop
In a recent result, Weitz [13] established equivalence between the marginal distribution of a node, say v, in any binary pair-wise Markov Random Field (MRF), say G, with the marginal distribution of the root node in the self-avoid walk tree of the G starting at v. Analogous result for max-marginal distribution holds for the reason that addition and multiplication commute in the same way as addition and maximum. This remarkable connection suggests a message-passing algorithm for computing exact
doi:10.1109/itw.2007.4313078
fatcat:dlcmgel3lzf6latyfw2zbeqb5e