2000 character limit reached
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks (1302.3586v1)
Published 13 Feb 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.