Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
classification
💻 cs.AI
keywords
boundscomputinglowernetworkssizetechniquesupperbecome
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.