# Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

arXiv: https://arxiv.org/abs/1302.3586 · HTML: https://mlsanity.com/paper/1302.3586/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Feb 2013.

## Built on by (most cited first, 2 of 2)

- [Viscos Flows: Variational Schur Conditional Sampling With Normalizing Flows](https://mlsanity.com/paper/2107.02474/) (2021)
- [Latent Variable Modelling Using Variational Autoencoders: A survey](https://mlsanity.com/paper/2206.09891/) (2022)

## Abstract (arXiv)

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.