Emergent Mind
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
(1302.3586)
Published Feb 13, 2013
in
cs.AI
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.