Sum-Product-Set Networks

Milan Papez, Martin Rektoris, Tomáš Pevný, Vaclav Smidl

Keywords: Sum-product networks, probabilistic circuits, graph neural networks, tree-structured graphs, tree-structured data, supervised learning

TL;DR: We propose sum-product-set networks, an extension of probabilistic circuits for tree-structured graphs.

Abstract: Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution over undirected cyclic graphs. This assumption of a generic graph structure brings various computational challenges, and, more importantly, the presence of non-linearities in neural networks does not permit tractable probabilistic inference. We address these problems by proposing sum-product-set networks, an extension of probabilistic circuits from unstructured tensor data to tree-structured graph data. To this end, we use random finite sets to reflect a variable number of nodes and edges in the graph and to allow for exact and efficient inference. We demonstrate that our tractable model performs comparably to various intractable models based on neural networks.

Submission Number: 5