Expectation Propagation
Expectation Propagation (EP) is a deterministic message-passing algorithm for approximate posterior inference in Bayesian models, introduced by Thomas P. Minka at UAI 2001. It iteratively refines a set of local approximate factors — each drawn from the exponential family — so that their product closely matches the true intractable posterior, achieving higher accuracy than mean-field variational inference on many probabilistic machine learning tasks.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
- Minka, T. P. (2001). Expectation propagation for approximate Bayesian inference. In Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI-01), pp. 362–369. Morgan Kaufmann. · URL
- Minka, T. P. (2001/2013). Expectation propagation for approximate Bayesian inference. arXiv:1301.2294 [cs.AI]. · URL
- Bishop, C. M. (2006). Pattern Recognition and Machine Learning. Springer. (Chapter 10: Approximate Inference; Section 10.7 covers Expectation Propagation.) · ISBN 978-0387310732
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.