mlsanityData to 7 Oct 2026

Scaling Continuous Latent Variable Models as Probabilistic Integral Circuits

arXiv 2406.06494 ↗First posted 10 Jun 2024cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Probabilistic integral circuits (PICs) have been recently introduced as probabilistic models enjoying the key ingredient behind expressive generative models: continuous latent variables (LVs). PICs are symbolic computational graphs defining continuous LV models as hierarchies of functions that are summed and multiplied together, or integrated over some LVs. They are tractable if LVs can be analytically integrated out, otherwise they can be approximated by tractable probabilistic circuits (PC) encoding a hierarchical numerical quadrature process, called QPCs. So far, only tree-shaped PICs have been explored, and training them via numerical quadrature requires memory-intensive processing at scale. In this paper, we address these issues, and present: (i) a pipeline for building DAG-shaped PICs out of arbitrary variable decompositions, (ii) a procedure for training PICs using tensorized circuit architectures, and (iii) neural functional sharing techniques to allow scalable training. In extensive experiments, we showcase the effectiveness of functional sharing and the superiority of QPCs over traditional PCs.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 24 of its 60 references that are in the map. First posted on arXiv 10 Jun 2024.

Builds on

24 of 60 references.

References · 24

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  4. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  5. 2022Diffusion Models: A Comprehensive Survey of Methods and Applicationscited by 1,107
  6. 2020Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic Circuitscited by 102
  7. 2019Practical Lossless Compression with Latent Variables using Bits Back Codingcited by 85
  8. 2019Integer Discrete Flows and Lossless Compressioncited by 82
  9. 2023Tractable Control for Autoregressive Language Generationcited by 65
  10. 2019Bit-Swap: Recursive Bits-Back Coding for Lossless Compression with Hierarchical Latent Variablescited by 51
  11. 2016On the Latent Variable Interpretation in Sum-Product Networkscited by 40
  12. 2021Tractable Regularization of Probabilistic Circuitscited by 39
12 more
  1. 2023Subtractive Mixture Models via Squaring: Representation and Learningcited by 39
  2. 2022Scaling Up Probabilistic Circuits by Latent Variable Distillationcited by 35
  3. 2020Joints in Random Forestscited by 21
  4. 2021Lossless Compression with Probabilistic Circuitscited by 20
  5. 2023How to Turn Your Knowledge Graph Embeddings into Generative Modelscited by 20
  6. 2021Improving Lossless Compression Rates via Monte Carlo Bits-Back Codingcited by 19
  7. 2022Continuous Mixtures of Tractable Probabilistic Modelscited by 19
  8. 2023Understanding the Distillation Process from Deep Generative Models to Tractable Probabilistic Circuitscited by 19
  9. 2022Sparse Probabilistic Circuits via Pruning and Growingcited by 17
  10. 2023Probabilistic Integral Circuitscited by 8
  11. 2023Bayesian Structure Scores for Probabilistic Circuitscited by 7
  12. 2019Sum-Product Network Decompilationcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 2.

9 papers.