Answers are grounded in this paper and cite their sources.
Recently, variational approximations such as the mean field approximation received much interest. We extend the standard mean field method by using approximating distribution that factorises into cluster potentials. This undirected graphs, directed acyclic graphs and junction trees. We generalized mean field equations to optimize the cluster potentials. We that the method bridges the gap between the standard mean field and the exact junction tree algorithm. In addition, we address problem of how to choose the graphical structure of the approximating. From the generalised mean field equations we derive rules to the structure of the approximating distribution in advance without the quality of the approximation. We also show how the method fits some other variational approximations that are currently popular.
No takes yet. Share an insight, caveat, or question.
Wim Wiegerinck (2013) studied this question.