Our prior work “Linearized and Single-Pass Belief Propagation ” proposed to approximate the solution of loopy Belief Propagation in graphs (i.e. pairwise Markov networks) with one that requires to solve a simple linear equation system. That work was still restricted to the case in which all edges in the network carry the same symmetric, doubly stochastic potential. This paper generalizes that approach to any pairwise Markov network.
http://bt.tepper.cmu.edu/wp-content/uploads/2016/07/Sample-Icon.png 250 250 bt-admin http://bt-tepper.org/wp-content/uploads/2017/01/COLOR-TEPPER-LOGO.jpg bt-admin2015-02-15 19:51:252017-01-31 21:25:49The linearization of pairwise Markov networks