Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Operations Research
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
On the generation of alternative explanations with implications for belief revision
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Computation and action under bounded resources
Computation and action under bounded resources
Approximating probabilistic inference in Bayesian belief networks is NP-hard
Artificial Intelligence
On Fourier's algorithm for linear arithmetic constraints
Journal of Automated Reasoning
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
On the hardness of approximate reasoning
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Approximating Bayesian Belief Networks by Arc Removal
IEEE Transactions on Pattern Analysis and Machine Intelligence
Iterative decoding
Graphical models for machine learning and digital communication
Graphical models for machine learning and digital communication
A revolution: belief propagation in graphs with cycles
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Introduction to Monte Carlo methods
Learning in graphical models
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Synthesizing constraint expressions
Communications of the ACM
A general scheme for automatic generation of search heuristics from specification dependencies
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Nonserial Dynamic Programming
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
A new algorithm for finding MAP assignments to belief networks
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Pre-processing for Triangulation of Probabilistic Networks
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Tree approximation for belief updating
Eighteenth national conference on Artificial intelligence
Accuracy vs. efficiency trade-offs in probabilistic diagnosis
Eighteenth national conference on Artificial intelligence
Localized partial evaluation of belief networks
Localized partial evaluation of belief networks
Mini-buckets: a general scheme for generating approximations in automated reasoning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
Diagnosing tree-decomposable circuits
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Mini-bucket heuristics for improved search
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
MAP complexity results and approximation methods
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Tractable inference for complex stochastic processes
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Empirical evaluation of approximation algorithms for probabilistic decoding
UAI'98 Proceedings of the Fourteenth 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
Deterministic approximation of marginal probabilities in Bayes nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Accuracy vs. efficiency trade-offs in probabilistic diagnosis
Eighteenth national conference on Artificial intelligence
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
A logic of soft constraints based on partially ordered preferences
Journal of Heuristics
Bucket elimination for multiobjective optimization problems
Journal of Heuristics
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
Algebraic Structures for Bipolar Constraint-Based Reasoning
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Multi-Objective Propagation in Constraint Programming
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
An Analysis of Bayesian Network Model-Approximation Techniques
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Memory intensive branch-and-bound search for graphical models
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Approximate counting by sampling the backtrack-free search space
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Focusing generalizations of belief propagation on targeted queries
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Efficient stochastic local search for MPE solving
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Exploiting decomposition on constraint problems with high tree-width
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Variable and value ordering for MPE search
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient computation of jointree bounds for systematic MAP search
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approximating weighted Max-SAT problems by compensating for relaxations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Bisimulation-based approximate lifted inference
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Fault diagnosis in IP networks via multicast probing: noisy measurements
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
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
Active tuples-based scheme for bounding posterior beliefs
Journal of Artificial Intelligence Research
On mini-buckets and the min-fill elimination ordering
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Mini-bucket elimination with bucket propagation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Systematic vs. non-systematic algorithms for solving the MPE task
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Solving MAP exactly using systematic search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Incorporating inference into evolutionary algorithms for Max-CSP
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Duality in optimization and constraint satisfaction
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Relax, compensate and then recover
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Importance sampling algorithms for Bayesian networks: Principles and performance
Mathematical and Computer Modelling: An International Journal
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
Bucket and mini-bucket schemes for m best solutions over graphical models
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Resolution procedures for multiple-valued optimization
Information Sciences: an International Journal
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
Semiring-based mini-bucket partitioning schemes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Approximation algorithms for max-sum-product problems
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 |
This article presents a class of approximation algorithms that extend the idea of bounded-complexity inference, inspired by successful constraint propagation algorithms, to probabilistic inference and combinatorial optimization. The idea is to bound the dimensionality of dependencies created by inference algorithms. This yields a parameterized scheme, called mini-buckets, that offers adjustable trade-off between accuracy and efficiency. The mini-bucket approach to optimization problems, such as finding the most probable explanation (MPE) in Bayesian networks, generates both an approximate solution and bounds on the solution quality. We present empirical results demonstrating successful performance of the proposed approximation scheme for the MPE task, both on randomly generated problems and on realistic domains such as medical diagnosis and probabilistic decoding.