Publication | Open Access
Expectation Propagation for approximate Bayesian inference
1.5K
Citations
11
References
2013
Year
Bayesian StatisticEngineeringMachine LearningLoopy Belief PropagationNetwork AnalysisEducationBayesian InferenceData ScienceUncertainty QuantificationStatisticsBelief PropagationExpectation PropagationGraphical ModelBayesian NetworkProbability TheoryComputer ScienceBayesian NetworksStatistical InferenceApproximate Bayesian Computation
Expectation Propagation unifies assumed‑density filtering and loopy belief propagation, both of which aim to approximate the true distribution in KL divergence, but loopy belief propagation is limited to purely discrete networks. This paper introduces Expectation Propagation as a new deterministic approximation technique for Bayesian networks. Expectation Propagation approximates belief states by iteratively matching selected expectations, such as mean and variance, until they are consistent throughout the network. Experiments on Gaussian mixture models show that Expectation Propagation outperforms Laplace, variational Bayes, and Monte Carlo methods while enabling efficient training of Bayes point machine classifiers and handling hybrid networks with richer belief states.
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation", unifies two previous techniques: assumed-density filtering, an extension of the Kalman filter, and loopy belief propagation, an extension of belief propagation in Bayesian networks. All three algorithms try to recover an approximate distribution which is close in KL divergence to the true distribution. Loopy belief propagation, because it propagates exact belief states, is useful for a limited class of belief networks, such as those which are purely discrete. Expectation Propagation approximates the belief states by only retaining certain expectations, such as mean and variance, and iterates until these expectations are consistent throughout the network. This makes it applicable to hybrid networks with discrete and continuous nodes. Expectation Propagation also extends belief propagation in the opposite direction - it can propagate richer belief states that incorporate correlations between nodes. Experiments with Gaussian mixture models show Expectation Propagation to be convincingly better than methods with similar computational cost: Laplace's method, variational Bayes, and Monte Carlo. Expectation Propagation also provides an efficient algorithm for training Bayes point machine classifiers.
| Year | Citations | |
|---|---|---|
Page 1
Page 1