Approximate Inference in Probabilistic Models
Abstract
We present a framework for approximate inference in probabilistic data models which is based on free energies. The free energy is constructed from two approximating distributions which encode different aspects of the intractable model. Consistency between distributions is required on a chosen set of moments. We find good performance using sets of moments which either specify factorized nodes or a spanning tree on the nodes. The abstract should summarize the contents of the paper using at least 70 and at most 150 words. It will be set in 9-point font size and be inset 1.0 cm from the right and left margins. There will be two blank lines before and after the Abstract. ...
Cite
Text
Opper and Winther. "Approximate Inference in Probabilistic Models." International Conference on Algorithmic Learning Theory, 2004. doi:10.1007/978-3-540-30215-5_37Markdown
[Opper and Winther. "Approximate Inference in Probabilistic Models." International Conference on Algorithmic Learning Theory, 2004.](https://mlanthology.org/alt/2004/opper2004alt-approximate/) doi:10.1007/978-3-540-30215-5_37BibTeX
@inproceedings{opper2004alt-approximate,
title = {{Approximate Inference in Probabilistic Models}},
author = {Opper, Manfred and Winther, Ole},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2004},
pages = {494-504},
doi = {10.1007/978-3-540-30215-5_37},
url = {https://mlanthology.org/alt/2004/opper2004alt-approximate/}
}