mlsanityData to 14 Oct 2026

Visualizing and Understanding Sum-Product Networks

arXiv 1608.08266 ↗First posted 29 Aug 2016cs.LG stat.MLcited by 18

Not on the map. Why?

Abstract (arXiv)

Sum-Product Networks (SPNs) are recently introduced deep tractable probabilistic models by which several kinds of inference queries can be answered exactly and in a tractable time. Up to now, they have been largely used as black box density estimators, assessed only by comparing their likelihood scores only. In this paper we explore and exploit the inner representations learned by SPNs. We do this with a threefold aim: first we want to get a better understanding of the inner workings of SPNs; secondly, we seek additional ways to evaluate one SPN model and compare it against other probabilistic models, providing diagnostic tools to practitioners; lastly, we want to empirically evaluate how good and meaningful the extracted representations are, as in a classic Representation Learning framework. In order to do so we revise their interpretation as deep neural networks and we propose to exploit several visualization techniques on their node activations and network outputs under different types of inference queries. To investigate these models as feature extractors, we plug some SPNs, learned in a greedy unsupervised fashion on image datasets, in supervised classification learning tasks. We extract several embedding types from node activations by filtering nodes by their type, by their associated feature abstraction level and by their scope. In a thorough empirical comparison we prove them to be competitive against those generated from popular feature extractors as Restricted Boltzmann Machines. Finally, we investigate embeddings generated from random probabilistic marginal queries as means to compare other tractable probabilistic models on a common ground, extending our experiments to Mixtures of Trees.

Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Aug 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 5; 2025: 6.

18 papers.

Sort:

  1. 2022Semantic Probabilistic Layers for Neuro-Symbolic Learningcited by 103
  2. 2023Subtractive Mixture Models via Squaring: Representation and Learningcited by 39
  3. 2024What is the Relationship between Tensor Factorizations and Circuits (and How Can We Exploit it)?cited by 22
  4. 2023How to Turn Your Knowledge Graph Embeddings into Generative Modelscited by 20
  5. 2022Tractable Uncertainty for Structure Learningcited by 15
  6. 2024Building Expressive and Tractable Probabilistic Generative Models: A Reviewcited by 12
  7. 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuitscited by 9
  8. 2023Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networkscited by 7
  9. 2025How to Square Tensor Networks and Circuits Without Squaring Themcited by 5
  10. 2025Tractable Representation Learning with Probabilistic Circuitscited by 4
  11. 2025Deep Polynomial Chaos Expansioncited by 4
  12. 2024Sum-Product-Set Networks: Deep Tractable Models for Tree-Structured Graphscited by 3
6 more
  1. 2024GraphSPNs: Sum-Product Networks Benefit From Canonical Orderingscited by 2
  2. 2024On Faster Marginalization with Squared Circuits via Orthonormalizationcited by 2
  3. 2021Explaining Deep Tractable Probabilistic Models: The sum-product network casecited by 1
  4. 2021A Taxonomy for Inference in Causal Model Familiescited by 1
  5. 2025Probabilistic Graph Circuits: Deep Generative Models for Tractable Probabilistic Inference over Graphscited by 1
  6. 2025Counterfactual Explanations in Medical Imaging: Exploring SPN-Guided Latent Space Manipulationcited by 0