ML Anthology

Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

Tommi S. Jaakkola, Michael I. Jordan
UAI 1996 pp. 340-348
/uai/1996/jaakkola1996uai-computing/

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.

UAI Semantic Scholar

Cite

Text

Jaakkola and Jordan. "Computing Upper and Lower Bounds on Likelihoods in Intractable Networks." Conference on Uncertainty in Artificial Intelligence, 1996.

Markdown

[Jaakkola and Jordan. "Computing Upper and Lower Bounds on Likelihoods in Intractable Networks." Conference on Uncertainty in Artificial Intelligence, 1996.](https://mlanthology.org/uai/1996/jaakkola1996uai-computing/)

BibTeX

@inproceedings{jaakkola1996uai-computing,
  title     = {{Computing Upper and Lower Bounds on Likelihoods in Intractable Networks}},
  author    = {Jaakkola, Tommi S. and Jordan, Michael I.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1996},
  pages     = {340-348},
  url       = {https://mlanthology.org/uai/1996/jaakkola1996uai-computing/}
}