HyperSPNs: Compact and Expressive Probabilistic Circuits
Andy Shih, Dorsa Sadigh, Stefano Ermon
Abstract
Probabilistic circuits (PCs) are a family of generative models which allows for the computation of exact likelihoods and marginals of its probability distributions. PCs are both expressive and tractable, and serve as popular choices for discrete density estimation tasks. However, large PCs are susceptible to overfitting, and only a few regularization strategies (e.g., dropout, weight-decay) have been explored. We propose HyperSPNs: a new paradigm of generating the mixture weights of large PCs using a small-scale neural network. Our framework can be viewed as a soft weight-sharing strategy, which combines the greater expressiveness of large models with the better generalization and memory-footprint properties of small models. We show the merits of our regularization strategy on two state-of-theart PC families introduced in recent literature -RAT-SPNs and EiNETs -and demonstrate generalization improvements in both models on a suite of density estimation benchmarks in both discrete and continuous domains. 35th Conference on Neural Information Processing Systems (NeurIPS 2021).
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 ca4b8c72-5b1f-4ddc-bc53-b62afa66a605Cited by top-tier papers5
- Continuous Mixtures of Tractable Probabilistic ModelsAlvaro H. C. Correia, Gennaro Gala, Erik Quaeghebeur, Cassio P. de Campos et al.AAAI 2023 · 26 citations
- Sparse Probabilistic Circuits via Pruning and GrowingMeihua Dang, Anji Liu, Guy Van den BroeckNeurIPS 2022 · 25 citations
- Probabilistic Neural CircuitsPedro Zuidberg Dos MartiresAAAI 2024 · 11 citations
- Scaling Up Probabilistic Circuits by Latent Variable DistillationAnji Liu, Honghua Zhang, Guy Van den BroeckICLR 2023 · 5 citations
- Tractable Sharpness-Aware Learning of Probabilistic CircuitsHrithik Suresh, Sahil Sidheekh, Vishnu Shreeram M. P, Sriraam Natarajan et al.AAAI 2026 · 2 citations
Builds on7
- Deep Double Descent: Where Bigger Models and More Data HurtPreetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang et al.ICLR 2020 · 1,108 citations
- Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic CircuitsRobert Peharz, Steven Lang, Antonio Vergari, Karl Stelzner et al.ICML 2020 · 155 citations
- Tractable Regularization of Probabilistic CircuitsAnji Liu, Guy Van den BroeckNeurIPS 2021 · 50 citations
- Interventional Sum-Product Networks: Causal Inference with Tractable Probabilistic ModelsMatej Zecevic, Devendra Singh Dhami, Athresh Karanam, Sriraam Natarajan et al.NeurIPS 2021 · 42 citations
- Probabilistic Circuits for Variational Inference in Discrete Graphical ModelsAndy Shih, Stefano ErmonNeurIPS 2020 · 29 citations
Related papers
- Characteristic CircuitsZhongjie Yu, Martin Trapp, Kristian KerstingNeurIPS 2023 · 8 citations
- Scaling Continuous Latent Variable Models as Probabilistic Integral CircuitsGennaro Gala, Cassio P. de Campos, Antonio Vergari, Erik QuaeghebeurNeurIPS 2024 · 12 citations
- Scaling Probabilistic Circuits via Monarch MatricesHonghua Zhang, Meihua Dang, Benjie Wang, Stefano Ermon et al.ICML 2025
- Probabilistic Generating CircuitsHonghua Zhang, Brendan Juba, Guy Van den BroeckICML 2021 · 5 citations
- Scaling Tractable Probabilistic Circuits: A Systems PerspectiveAnji Liu, Kareem Ahmed, Guy Van den BroeckICML 2024 · 26 citations
