Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Tree clustering for constraint networks (research note)
Artificial Intelligence
Valuation-based systems for Bayesian decision analysis
Operations Research
Approximating probabilistic inference in Bayesian belief networks is NP-hard
Artificial Intelligence
On the hardness of approximate reasoning
Artificial Intelligence
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
A comparison of structural CSP decomposition methods
Artificial Intelligence
A general scheme for automatic generation of search heuristics from specification dependencies
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Expectation Propagation for approximate Bayesian inference
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Tree approximation for belief updating
Eighteenth national conference on Artificial intelligence
Constraint Processing
Approximation algorithms for graphical models
Approximation algorithms for graphical models
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Theory of Relational Databases
Theory of Relational Databases
AND/OR search spaces for graphical models
Artificial Intelligence
Truncating the Loop Series Expansion for Belief Propagation
The Journal of Machine Learning Research
On probabilistic inference by weighted model counting
Artificial Intelligence
Information, Physics, and Computation
Information, Physics, and Computation
An edge deletion semantics for belief propagation and its practical impact on approximation quality
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Compiling relational Bayesian networks for exact inference
International Journal of Approximate Reasoning
Sampling algorithms for probabilistic graphical models with determinism
Sampling algorithms for probabilistic graphical models with determinism
Iterative join-graph propagation
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A scheme for approximating probabilistic inference
UAI'97 Proceedings of the Thirteenth 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
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
A simple insight into iterative belief propagation's success
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
An importance sampling algorithm based on evidence pre-propagation
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Constructing free-energy approximations and generalized belief propagation algorithms
IEEE Transactions on Information Theory
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
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
Importance sampling-based estimation over AND/OR search spaces for graphical models
Artificial Intelligence
Semiring-based mini-bucket partitioning schemes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Variational algorithms for marginal MAP
The Journal of Machine Learning Research
Hi-index | 0.00 |
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start with the bounded inference mini-clustering algorithm and then move to the iterative scheme called Iterative Join-Graph Propagation (IJGP), that combines both iteration and bounded inference. Algorithm IJGP belongs to the class of Generalized Belief Propagation algorithms, a framework that allowed connections with approximate algorithms from statistical physics and is shown empirically to surpass the performance of mini-clustering and belief propagation, as well as a number of other state-of-the-art algorithms on several classes of networks. We also provide insight into the accuracy of iterative BP and IJGP by relating these algorithms to well known classes of constraint propagation schemes