# A New Algorithm for Finding MAP Assignments to Belief Networks

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

## Key facts

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

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

- [MPE inference using an Incremental Build-Infer-Approximate Paradigm](https://mlsanity.com/paper/2206.01954/) (2022)

## Abstract (arXiv)

We present a new algorithm for finding maximum a-posterior) (MAP) assignments of values to belief networks. The belief network is compiled into a network consisting only of nodes with boolean (i.e. only 0 or 1) conditional probabilities. The MAP assignment is then found using a best-first search on the resulting network. We argue that, as one would anticipate, the algorithm is exponential for the general case, but only linear in the size of the network for poly trees.