Learning Arithmetic Circuits
Daniel Lowd, Pedro Domingos

TL;DR
This paper introduces a method for learning arithmetic circuits that directly penalize inference cost, resulting in more accurate and tractable models with large treewidth, efficiently learned compared to traditional Bayesian network methods.
Contribution
It proposes a novel algorithm for learning arithmetic circuits with a size-based penalty, improving inference efficiency and prediction accuracy over standard Bayesian network learners.
Findings
Learned models have lower inference cost and larger treewidth.
Achieved more accurate predictions in less time.
Efficiently learned models without full circuit compilation for each candidate.
Abstract
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, because it requires approximate inference. We propose an alternative: learning models with a score function that directly penalizes the cost of inference. Specifically, we learn arithmetic circuits with a penalty on the number of edges in the circuit (in which the cost of inference is linear). Our algorithm is equivalent to learning a Bayesian network with context-specific independence by greedily splitting conditional distributions, at each step scoring the candidates by compiling the resulting network into an arithmetic circuit, and using its size as the penalty. We show how this can be done efficiently, without compiling a circuit from scratch for each candidate. Experiments on several real-world domains show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Machine Learning and Algorithms · Machine Learning and Data Classification
