Expectation propagation

Expectation propagation (EP) is a technique in Bayesian machine learning.^[1]

EP finds approximations to a probability distribution.^[1] It uses an iterative approach that leverages the factorization structure of the target distribution.^[1] It differs from other Bayesian approximation approaches such as variational Bayesian methods.^[1]

More specifically, suppose we wish to approximate an intractable probability distribution $p({\mathbf {x}})$ with a tractable distribution $q(\mathbf {x} )$ . Expectation propagation achieves this approximation by minimizing the Kullback-Leibler divergence $\mathrm {KL} (p||q)$ .^[1] Variational Bayesian methods minimize $\mathrm {KL} (q||p)$ instead.^[1]

If $q(\mathbf {x} )$ is a Gaussian ${\mathcal {N}}(\mathbf {x} |\mu ,\Sigma )$ , then $\mathrm {KL} (p||q)$ is minimized with $\mu$ and $\Sigma$ being equal to the mean of $p({\mathbf {x}})$ and the covariance of $p({\mathbf {x}})$ , respectively; this is called moment matching.^[1]

Applications

Expectation propagation via moment matching plays a vital role in approximation for indicator functions that appear when deriving the message passing equations for TrueSkill.

References

Thomas Minka (August 2–5, 2001). "Expectation Propagation for Approximate Bayesian Inference". In Jack S. Breese, Daphne Koller. UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (PDF). University of Washington, Seattle, Washington, USA. pp. 362–369.

External links

1 2 3 4 5 6 7 Bishop, Christopher (2007). Pattern Recognition and Machine Learning. New York: Springer-Verlag New York Inc. ISBN 978-0387310732.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[bishop-1] 1 2 3 4 5 6 7 Bishop, Christopher (2007). Pattern Recognition and Machine Learning. New York: Springer-Verlag New York Inc. ISBN 978-0387310732.