Scaling Continuous Latent Variable Models as Probabilistic Integral Circuits
Gennaro Gala, Cassio P. de Campos, Antonio Vergari, Erik Quaeghebeur
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9a26e3ab-e9b8-4b8e-9a5c-14fc2a2fddf0Cited by top-tier papers7
- Sum of Squares CircuitsLorenzo Loconte, Stefan Mengel, Antonio VergariAAAI 2025 · 20 citations
- Fast and Expressive Multi-Byte Prediction with Probabilistic CircuitsAndreas Grivas, Lorenzo Loconte, Emile van Krieken, Piotr Nawrot et al.ICML 2026 · 9 citations
- How to Square Tensor Networks and Circuits Without Squaring ThemLorenzo Loconte, Adrián Javaloy, Antonio VergariICLR 2026 · 6 citations
- Exploiting Dynamic Sparsity in EinsumChristoph Staudt, Mark Blacher, Tim Hoffmann, Lea Kasche et al.NeurIPS 2025 · 1 citation
- Fast Reconstruction of Mixtures of Bernoulli Product DistributionsSanyam Agarwal, Pranjal Dutta, Markus BläserICML 2026
Builds on12
- Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional DomainsMatthew Tancik, Pratul P. Srinivasan, Ben Mildenhall, Sara Fridovich-Keil et al.NeurIPS 2020 · 4,036 citations
- Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic CircuitsRobert Peharz, Steven Lang, Antonio Vergari, Karl Stelzner et al.ICML 2020 · 155 citations
- A Compositional Atlas of Tractable Circuit Operations for Probabilistic InferenceAntonio Vergari, YooJung Choi, Anji Liu, Stefano Teso et al.NeurIPS 2021 · 112 citations
- Tractable Control for Autoregressive Language GenerationHonghua Zhang, Meihua Dang, Nanyun Peng, Guy Van den BroeckICML 2023 · 63 citations
- Tractable Regularization of Probabilistic CircuitsAnji Liu, Guy Van den BroeckNeurIPS 2021 · 50 citations
Related papers
- Continuous Mixtures of Tractable Probabilistic ModelsAlvaro H. C. Correia, Gennaro Gala, Erik Quaeghebeur, Cassio P. de Campos et al.AAAI 2023 · 26 citations
- Probabilistic Neural CircuitsPedro Zuidberg Dos MartiresAAAI 2024 · 11 citations
- Sparse Probabilistic Circuits via Pruning and GrowingMeihua Dang, Anji Liu, Guy Van den BroeckNeurIPS 2022 · 25 citations
- Scaling Up Probabilistic Circuits by Latent Variable DistillationAnji Liu, Honghua Zhang, Guy Van den BroeckICLR 2023 · 5 citations
- Scaling Tractable Probabilistic Circuits: A Systems PerspectiveAnji Liu, Kareem Ahmed, Guy Van den BroeckICML 2024 · 26 citations
