# A Scheme for Approximating Probabilistic Inference

arXiv: https://arxiv.org/abs/1302.1534 · HTML: https://mlsanity.com/paper/1302.1534/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Feb 2013.

## Built on by (most cited first, 1 of 1)

- [IBIA: Bayesian Inference via Incremental Build-Infer-Approximate operations on Clique Trees](https://mlsanity.com/paper/2202.12003/) (2022)

## Abstract (arXiv)

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.