Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
Artificial Intelligence
2013-02-18 v1
Abstract
We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the bounds by numerical experiments.
Cite
@article{arxiv.1302.3586,
title = {Computing Upper and Lower Bounds on Likelihoods in Intractable Networks},
author = {Tommi S. Jaakkola and Michael I. Jordan},
journal= {arXiv preprint arXiv:1302.3586},
year = {2013}
}
Comments
Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)