Not all Strongly Rayleigh Distributions Have Small Probabilistic Generating Circuits
Markus Bläser
Abstract
Probabilistic modeling is a central task in machine learning. Probabilistic models should be tractable, i.e., allowing tractable probabilistic inference, but also efficient, i.e., being able to represent a large set of probability distributions. Zhang et al. (ICML 2021) recently proposed a new model, probabilistic generating circuits. They raised the question whether every strongly Rayleigh distribution can be efficiently represented by such circuits. We prove that this question has a negative answer. There are strongly Rayleigh distributions that cannot be represented by polynomial-sized probabilistic generating circuits, assuming a widely accepted complexity theoretic conjecture.
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 343215df-349c-442a-a2bd-c0d08f7f72f8Cited by top-tier papers2
- Probabilistic Generating Circuits - DemystifiedSanyam Agarwal, Markus BläserICML 2024 · 5 citations
- The Limits of Tractable MarginalizationOliver Broadrick, Sanyam Agarwal, Guy Van den Broeck, Markus BläserICML 2025
Builds on1
Related papers
- Characteristic CircuitsZhongjie Yu, Martin Trapp, Kristian KerstingNeurIPS 2023 · 8 citations
- On the Expressive Power of Tree-Structured Probabilistic CircuitsLang Yin, Han ZhaoNeurIPS 2024 · 4 citations
- On the Hardness of Approximating Distributions with Tractable Probabilistic ModelsJohn Leland, YooJung ChoiNeurIPS 2025 · 2 citations
- Continuous Mixtures of Tractable Probabilistic ModelsAlvaro H. C. Correia, Gennaro Gala, Erik Quaeghebeur, Cassio P. de Campos et al.AAAI 2023 · 26 citations
- Tractable Uncertainty for Structure LearningBenjie Wang, Matthew Wicker, Marta KwiatkowskaICML 2022 · 16 citations
