The linearization of pairwise Markov networks

Wolfgang Gatterbauer
new [working paper (arXiv:1502.04956)], (Version Feb 2015)

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.