A Scheme for Approximating Probabilistic Inference
arXiv:1302.1534
Abstract
This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency. We analyze the approximation for several tasks: finding the most probable explanation, belief updating and finding the maximum a posteriori hypothesis. We identify regions of completeness and provide preliminary empirical evaluation on randomly generated networks.
Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)
Cited by in corpus (6)
- Tractable Inference for Complex Stochastic Processes
- Iterative Join-Graph Propagation
- Mini-Bucket Heuristics for Improved Search
- Systematic vs. Non-systematic Algorithms for Solving the MPE Task
- Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
- Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding