mlsanityData to 7 Oct 2026

Scaling Tractable Probabilistic Circuits: A Systems Perspective

arXiv 2406.00766 ↗First posted 2 Jun 2024cs.LGcited by 23

Not on the map. Why?

Abstract (arXiv)

Probabilistic Circuits (PCs) are a general framework for tractable deep generative models, which support exact and efficient probabilistic inference on their learned distributions. Recent modeling and training advancements have enabled their application to complex real-world tasks. However, the time and memory inefficiency of existing PC implementations hinders further scaling up. This paper proposes PyJuice, a general GPU implementation design for PCs that improves prior art in several regards. Specifically, PyJuice is 1-2 orders of magnitude faster than existing systems (including very recent ones) at training large-scale PCs. Moreover, PyJuice consumes 2-5x less GPU memory, which enables us to train larger models. At the core of our system is a compilation process that converts a PC into a compact representation amenable to efficient block-based parallelization, which significantly reduces IO and makes it possible to leverage Tensor Cores available in modern GPUs. Empirically, PyJuice can be used to improve state-of-the-art PCs trained on image (e.g., ImageNet32) and language (e.g., WikiText, CommonGen) datasets. We further establish a new set of baselines on natural image and language datasets by benchmarking existing PC structures but with much larger sizes and more training epochs, with the hope of incentivizing future research. Code is available at https://github.com/Tractables/pyjuice.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 2 Jun 2024.

Builds on

27 of 48 references.

References · 27

  1. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  2. 2016Pointer Sentinel Mixture Modelscited by 2,992
  3. 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 389
  4. 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 267
  5. 2022Semantic Probabilistic Layers for Neuro-Symbolic Learningcited by 103
  6. 2020Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic Circuitscited by 102
  7. 2013A Differential Approach to Inference in Bayesian Networkscited by 93
  8. 2021Tractable Regularization of Probabilistic Circuitscited by 39
  9. 2023Subtractive Mixture Models via Squaring: Representation and Learningcited by 39
  10. 2022Scaling Up Probabilistic Circuits by Latent Variable Distillationcited by 35
  11. 2022SIMPLE: A Gradient Estimator for k-Subset Samplingcited by 34
  12. 2022Neuro-Symbolic Entropy Regularizationcited by 27
15 more
  1. 2019SPFlow: An Easy and Extensible Library for Deep Probabilistic Learning using Sum-Product Networkscited by 26
  2. 2020Group Fairness by Probabilistic Modeling with Latent Fair Decisionscited by 22
  3. 2023Image Inpainting via Tractable Steering of Diffusion Modelscited by 22
  4. 2020Joints in Random Forestscited by 21
  5. 2023A Pseudo-Semantic Loss for Autoregressive Models with Logical Constraintscited by 21
  6. 2021Lossless Compression with Probabilistic Circuitscited by 20
  7. 2023How to Turn Your Knowledge Graph Embeddings into Generative Modelscited by 20
  8. 2022Continuous Mixtures of Tractable Probabilistic Modelscited by 19
  9. 2023Understanding the Distillation Process from Deep Generative Models to Tractable Probabilistic Circuitscited by 19
  10. 2022Sparse Probabilistic Circuits via Pruning and Growingcited by 17
  11. 2023Compositional Probabilistic and Causal Inference using Tractable Circuit Modelscited by 10
  12. 2023Probabilistic Integral Circuitscited by 8
  13. 2021DPU: DAG Processing Unit for Irregular Graphs with Precision-Scalable Posit Arithmetic in 28nmcited by 7
  14. 2023Bayesian Structure Scores for Probabilistic Circuitscited by 7
  15. 2015The Libra Toolkit for Probabilistic Modelscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 9; 2026: 9.

23 papers.

Sort:

By area:

  1. 2024KLay: Accelerating Arithmetic Circuits for Neurosymbolic AIcited by 16
  2. 2024On the Relationship Between Monotone and Squared Probabilistic Circuitscited by 14
  3. 2024Controllable Generation via Locally Constrained Resamplingcited by 11
  4. 2025Scaling Probabilistic Circuits via Monarch Matricescited by 9
  5. 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuitscited by 9
  6. 2024Restructuring Tractable Probabilistic Circuitscited by 7
  7. 2025Rethinking Probabilistic Circuit Parameter Learningcited by 4
  8. 2025Tractable Sharpness-Aware Learning of Probabilistic Circuitscited by 3
  9. 2025The DeepLog Neurosymbolic Machinecited by 3
  10. 2025The Limits of Tractable Marginalizationcited by 2
  11. 2026To Neuro-Symbolic Classification and Beyond by Compiling Description Logic Ontologies to Probabilistic Circuitscited by 2
  12. 2024Optimal Transport for Probabilistic Circuitscited by 1
11 more
  1. 2025Probabilistic Graph Circuits: Deep Generative Models for Tractable Probabilistic Inference over Graphscited by 1
  2. 2025CTSketch: Compositional Tensor Sketching for Scalable Neurosymbolic Learningcited by 1
  3. 2026Geometry-Aware Probabilistic Circuits via Voronoi Tessellationscited by 1
  4. 2026A Sobering Look at Tabular Data Generation via Probabilistic Circuitscited by 1
  5. 2026ExplainFuzz: Explainable and Constraint-Conditioned Test Generation with Probabilistic Circuitscited by 1
  6. 2026CircuitSynth: Reliable Synthetic Data Generationcited by 1
  7. 2025Learning Tractable Distributions Of Language Model Continuationscited by 0
  8. 2026REASON: Accelerating Probabilistic Logical Reasoning for Scalable Neuro-Symbolic Intelligencecited by 0
  9. 2026The Expressivity Boundary of Probabilistic Circuits: A Comparison with Large Language Modelscited by 0
  10. 2026A Probabilistic Circuit-Induced Pseudo-Metric for Out-of-Distribution Detectioncited by 0
  11. 2026A Compositional Theory of Curvature in Probabilistic Circuitscited by 0