Timezone: »
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
-
2022 Poster: Instance-Based Uncertainty Estimation for Gradient-Boosted Regression Trees »
Jonathan Brophy · Daniel Lowd -
2020 Poster: Learning from Positive and Unlabeled Data with Arbitrary Positive Shift »
Zayd Hammoudeh · Daniel Lowd -
2018 : Invited Talk 6 »
Pedro Domingos -
2018 Poster: Submodular Field Grammars: Representation, Inference, and Application to Image Parsing »
Abram Friesen · Pedro Domingos -
2015 : Discussion Panel with Morning Speakers (Day 1) »
Pedro Domingos · Stephen H Muggleton · Rina Dechter · Josh Tenenbaum -
2015 : Sum-Product Networks and Tractable Markov Logic: And End-to-End Neural-Symbolic System »
Pedro Domingos -
2014 Poster: Deep Symmetry Networks »
Robert Gens · Pedro Domingos -
2012 Poster: Discriminative Learning of Sum-Product Networks »
Robert Gens · Pedro Domingos -
2012 Oral: Discriminative Learning of Sum-Product Networks »
Robert Gens · Pedro Domingos -
2010 Poster: Learning Efficient Markov Networks »
Vibhav Gogate · William A Webb · Pedro Domingos