Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Simulation and the Monte Carlo Method
Simulation and the Monte Carlo Method
Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Permutation Problems and Channelling Constraints
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Simulation Approaches to General Probabilistic Inference on Belief Networks
UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Weighing and Integrating Evidence for Stochastic Simulation in Bayesian Networks
UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Adaptive Importance Sampling for Estimation in Structured Domains
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Hybrid Processing of Beliefs and Constraints
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Constraint Processing
Annals of Mathematics and Artificial Intelligence
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Mixtures of deterministic-probabilistic networks and their AND/OR search space
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
AND/OR search spaces for graphical models
Artificial Intelligence
Mixed deterministic and probabilistic networks
Annals of Mathematics and Artificial Intelligence
Monte Carlo Strategies in Scientific Computing
Monte Carlo Strategies in Scientific Computing
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Approximate counting by sampling the backtrack-free search space
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Cutset sampling for Bayesian networks
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
From sampling to model counting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Dynamic importance sampling in Bayesian networks based on probability trees
International Journal of Approximate Reasoning
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
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
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
A simple insight into iterative belief propagation's success
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Heuristics for fast exact model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Importance sampling algorithms for Bayesian networks: Principles and performance
Mathematical and Computer Modelling: An International Journal
Constructing free-energy approximations and generalized belief propagation algorithms
IEEE Transactions on Information Theory
Importance sampling on Bayesian networks with deterministic causalities
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Constraint propagation for efficient inference in Markov logic
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Importance sampling-based estimation over AND/OR search spaces for graphical models
Artificial Intelligence
Answering queries in hybrid Bayesian networks using importance sampling
Decision Support Systems
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
State-of-the-art of intention recognition and its use in decision making
AI Communications
Intelligent Decision Technologies
Hi-index | 0.00 |
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphical models is problematic because it generates many useless zero weight samples which are rejected yielding an inefficient sampling process. To address this rejection problem, we propose the SampleSearch scheme that augments sampling with systematic constraint-based backtracking search. We characterize the bias introduced by the combination of search with sampling, and derive a weighting scheme which yields an unbiased estimate of the desired statistics (e.g., probability of evidence). When computing the weights exactly is too complex, we propose an approximation which has a weaker guarantee of asymptotic unbiasedness. We present results of an extensive empirical evaluation demonstrating that SampleSearch outperforms other schemes in presence of significant amount of determinism.