An edge deletion semantics for belief propagation and its practical impact on approximation quality

Authors:
Arthur Choi;Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Year:
2006

Citing 14
Cited 10

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
A revolution: belief propagation in graphs with cycles

NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Recursive conditioning

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
A family of algorithms for approximate bayesian inference

A family of algorithms for approximate bayesian inference
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
On the choice of regions for generalized belief propagation

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
On the revision of probabilistic beliefs using uncertain evidence

Artificial Intelligence
Exploiting causal independence in Bayesian network inference

Journal of Artificial Intelligence Research
Compiling Bayesian networks with local structure

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Loopy belief propagation for approximate inference: an empirical study

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Iterative join-graph propagation

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Tree-based reparameterization framework for analysis of sum-product and related algorithms

IEEE Transactions on Information Theory
Constructing free-energy approximations and generalized belief propagation algorithms

IEEE Transactions on Information Theory

An Analysis of Bayesian Network Model-Approximation Techniques

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Focusing generalizations of belief propagation on targeted queries

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Many-pairs mutual information for adding structure to belief propagation approximations

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Exploiting problem structure for solution counting

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Lineage processing over correlated probabilistic databases

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Join-graph propagation algorithms

Journal of Artificial Intelligence Research
Relax, compensate and then recover: a theory of anytime, approximate inference

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
SampleSearch: Importance sampling in presence of determinism

Artificial Intelligence
Relax, compensate and then recover

JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Decomposition and Approximation of Loopy Bayesian Networks

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the ...