Computing upper and lower bounds on likelihoods in intractable networks

Authors:
Tommi S. Jaakkola;Michael I. Jordan
Affiliations:
Department of Brain and Cognitive Sciences, Massachusetts Institute of Technology, Cambridge, MA;Department of Brain and Cognitive Sciences, Massachusetts Institute of Technology, Cambridge, MA
Venue:
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Year:
1996

Citing 6
Cited 14

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Connectionist learning of belief networks

Artificial Intelligence
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
The Helmholtz machine

Neural Computation
A Tractable Inference Algorithm for Diagnosing Multiple Diseases

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Mean field theory for sigmoid belief networks

Journal of Artificial Intelligence Research

An Introduction to Variational Methods for Graphical Models

Machine Learning
Efficient reasoning

ACM Computing Surveys (CSUR)
Bayesian Networks for Data Mining

Data Mining and Knowledge Discovery
Data mining tasks and methods: Probabilistic and casual networks: methodology for probabilistic networks

Handbook of data mining and knowledge discovery
Bayesian kernel methods

Advanced lectures on machine learning
Gaussian process classification for segmenting and annotating sequences

ICML '04 Proceedings of the twenty-first international conference on Machine learning
A Tighter Bound for Graphical Models

Neural Computation
Divergence measures and a general framework for local variational approximation

Neural Networks
A general algorithm for approximate inference and its application to hybrid bayes nets

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Representing and combining partially specified CPTs

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Computer generated higher order expansions

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A new class of upper bounds on the log partition function

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Using qualitative relationships for bounding probability distributions

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Structure and parameter learning for causal independence and causal interaction models

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.