Conference
On the Sample Complexity of Learning Sum-Product Networks
Abstract
Sum-Product Networks (SPNs) (Poon and Domingos, 2011; Darwiche, 2003) can be regarded as a form of deep graphical models that compactly represent deeply factored and mixed distributions. An SPN is a rooted directed acyclic graph (DAG) consisting of a set of leaves (corresponding to base distributions), a set of sum nodes (which represent mixtures of their children distributions) and a set of product nodes (representing the products of its …
Authors
Aden-Ali I; Ashtiani H
Volume
108
Pagination
pp. 4508-4518
Publication Date
January 1, 2020
Conference proceedings
Proceedings of Machine Learning Research