mlsanityData to 7 Oct 2026

SPFlow: An Easy and Extensible Library for Deep Probabilistic Learning using Sum-Product Networks

arXiv 1901.03704 ↗First posted 11 Jan 2019cs.LG stat.MLcited by 26

Not on the map. Why?

Abstract (arXiv)

We introduce SPFlow, an open-source Python library providing a simple interface to inference, learning and manipulation routines for deep and tractable probabilistic models called Sum-Product Networks (SPNs). The library allows one to quickly create SPNs both from data and through a domain specific language (DSL). It efficiently implements several probabilistic inference routines like computing marginals, conditionals and (approximate) most probable explanations (MPEs) along with sampling as well as utilities for serializing, plotting and structure statistics on an SPN. Moreover, many of the algorithms proposed in the literature to learn the structure and parameters of SPNs are readily available in SPFlow. Furthermore, SPFlow is extremely extensible and customizable, allowing users to promptly distill new inference and learning routines by injecting custom code into a lightweight functional-oriented API framework. This is achieved in SPFlow by keeping an internal Python representation of the graph structure that also enables practical compilation of an SPN into a TensorFlow graph, C, CUDA or FPGA custom code, significantly speeding-up computations.

Key facts. Cited by 26 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jan 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 9; 2023: 4; 2024: 2; 2025: 4; 2026: 2.

26 papers.

Sort:

  1. 2022Concrete Score Matching: Generalized Score Matching for Discrete Datacited by 144
  2. 2023Tractable Control for Autoregressive Language Generationcited by 65
  3. 2022Training and Inference on Any-Order Autoregressive Models the Right Waycited by 64
  4. 2021Tractable Regularization of Probabilistic Circuitscited by 39
  5. 2022Scaling Up Probabilistic Circuits by Latent Variable Distillationcited by 35
  6. 2024Scaling Tractable Probabilistic Circuits: A Systems Perspectivecited by 23
  7. 2023Understanding the Distillation Process from Deep Generative Models to Tractable Probabilistic Circuitscited by 19
  8. 2022Sparse Probabilistic Circuits via Pruning and Growingcited by 17
  9. 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 17
  10. 2025A Survey on Active Feature Acquisition Strategiescited by 16
  11. 2022Tractable Boolean and Arithmetic Circuitscited by 9
  12. 2021A Compositional Atlas of Tractable Circuit Operations: From Simple Transformations to Complex Information-Theoretic Queriescited by 7
14 more
  1. 2023Probabilistic Circuits That Know What They Don't Knowcited by 7
  2. 2024Generating Likely Counterfactuals Using Sum-Product Networkscited by 6
  3. 2025Rethinking Probabilistic Circuit Parameter Learningcited by 4
  4. 2021Exchangeability-Aware Sum-Product Networkscited by 2
  5. 2022Certified Data Removal in Sum-Product Networkscited by 2
  6. 2022DeeProb-kit: a Python Library for Deep Probabilistic Modellingcited by 2
  7. 2021Explaining Deep Tractable Probabilistic Models: The sum-product network casecited by 1
  8. 2022Variational Flow Graphical Modelcited by 1
  9. 2021Fast Private Parameter Learning and Inference for Sum-Product Networkscited by 0
  10. 2022Outlier Explanation via Sum-Product Networkscited by 0
  11. 2025Counterfactual Explanations in Medical Imaging: Exploring SPN-Guided Latent Space Manipulationcited by 0
  12. 2025Tractable Probabilistic Models for Investment Planningcited by 0
  13. 2026The Expressivity Boundary of Probabilistic Circuits: A Comparison with Large Language Modelscited by 0
  14. 2026Diverse and Plausible Algorithmic Recourse via Tractable Recourse Distributionscited by 0