`

Timezone: »

 
Poster
Approximate Inference by Compilation to Arithmetic Circuits
Daniel Lowd · Pedro Domingos

Tue Dec 07 12:00 AM -- 12:00 AM (PST) @ None #None

Arithmetic circuits (ACs) exploit context-specific independence and determinism to allow exact inference even in networks with high treewidth. In this paper, we introduce the first ever approximate inference methods using ACs, for domains where exact inference remains intractable. We propose and evaluate a variety of techniques based on exact compilation, forward sampling, AC structure learning, Markov network parameter learning, variational inference, and Gibbs sampling. In experiments on eight challenging real-world domains, we find that the methods based on sampling and learning work best: one such method (AC2-F) is faster and usually more accurate than loopy belief propagation, mean field, and Gibbs sampling; another (AC2-G) has a running time similar to Gibbs sampling but is consistently more accurate than all baselines.

Author Information

Daniel Lowd (University of Oregon)
Pedro Domingos (University of Washington)

More from the Same Authors