Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Jaakkola et al. (2013) studied this question.