@inproceedings{minka2003tree-structured,
author = {Minka, Tom and Qi, Yuan},
title = {Tree-structured Approximations by Expectation Propagation},
booktitle = {NIPS 2003},
year = {2003},
month = {April},
abstract = {approximation structure plays an important role in inference on loopy graphs. As a tractable structure, tree approximations have been utilized in the variational method of Ghahramani & Jordan (1997) and the sequential projection method of Frey et al. (2000). However, belief propagation represents each factor of the graph with a product of single-node messages. In this paper, belief propagation is extended to represent factors with tree approximations, by way of the expectation propagation framework. That is, each factor sends a "message" to all pairs of nodes in a tree structure. The result is more accurate inferences and more frequent convergence than ordinary belief propagation, at a lower cost than variational trees or double-loop algorithms.},
url = {http://approjects.co.za/?big=en-us/research/publication/tree-structured-approximations-expectation-propagation/},
edition = {NIPS 2003},
}