Cover Image

Probabilistic Generating Circuits -- Demystified

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Agarwal, Sanyam, Bläser, Markus
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Limits of Tractable Marginalization
by: Broadrick, Oliver, et al.
Published: (2025)

On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
by: Agarwal, Sanyam, et al.
Published: (2026)

Probabilistic and Causal Satisfiability: Constraining the Model
by: Bläser, Markus, et al.
Published: (2025)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
by: Dörfler, Julian, et al.
Published: (2024)

On the Complexity of Identification in Linear Structural Causal Models
by: Dörfler, Julian, et al.
Published: (2024)

Probabilistic Explanations for Linear Models
by: Subercaseaux, Bernardo, et al.
Published: (2024)

Demystifying the unreasonable effectiveness of online alignment methods
by: Kang, Enoch Hyunwook
Published: (2026)

The Complexity of Symmetry Breaking Beyond Lex-Leader
by: Anders, Markus, et al.
Published: (2024)

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
by: Karmakar, Pratik, et al.
Published: (2024)

Diversity of Extensions in Abstract Argumentation
by: Fichte, Johannes K., et al.
Published: (2026)

Structure-Aware Encodings of Argumentation Properties for Clique-width
by: Mahmood, Yasir, et al.
Published: (2025)

The Computational Complexity of Circuit Discovery for Inner Interpretability
by: Adolfi, Federico, et al.
Published: (2024)

On Probabilistic and Causal Reasoning with Summation Operators
by: Ibeling, Duligur, et al.
Published: (2024)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
by: Li, Xiaoyu, et al.
Published: (2025)

Universal NP-Hardness of Clustering under General Utilities
by: Majumdar, Angshul
Published: (2026)

Circuit Complexity Bounds for Visual Autoregressive Model
by: Ke, Yekun, et al.
Published: (2025)

Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
by: Susnjak, Teo, et al.
Published: (2024)

Sum of Squares Circuits
by: Loconte, Lorenzo, et al.
Published: (2024)

An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
by: Fargier, Hélène, et al.
Published: (2021)

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
by: Ledaguenel, Arthur, et al.
Published: (2024)

Circuit Complexity Bounds for RoPE-based Transformer Architecture
by: Chen, Bo, et al.
Published: (2024)

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity
by: Chen, Yifang, et al.
Published: (2024)

Reinforced Generation of Combinatorial Structures: Ramsey Numbers
by: Nagda, Ansh, et al.
Published: (2026)

Rejection in Abstract Argumentation: Harder Than Acceptance?
by: Fichte, Johannes K., et al.
Published: (2024)

Epistemic Logic Programs: Non-Ground and Counting Complexity
by: Eiter, Thomas, et al.
Published: (2025)

Exponential lower bound via exponential sums
by: Bhattacharjee, Somnath, et al.
Published: (2026)

BigO(Bench) -- Can LLMs Generate Code with Controlled Time and Space Complexity?
by: Chambon, Pierre, et al.
Published: (2025)

Journalists, Emotions, and the Introduction of Generative AI Chatbots: A Large-Scale Analysis of Tweets Before and After the Launch of ChatGPT
by: Lewis, Seth C., et al.
Published: (2024)

Solving Multiagent Path Finding on Highly Centralized Networks
by: Fioravantes, Foivos, et al.
Published: (2024)

CSPs with Few Alien Constraints
by: Jonsson, Peter, et al.
Published: (2024)

A Structural Complexity Analysis of Hierarchical Task Network Planning
by: Brand, Cornelius, et al.
Published: (2024)

ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
by: Handa, Divij, et al.
Published: (2024)

Solving Quantified Boolean Formulas with Few Existential Variables
by: Eriksson, Leif, et al.
Published: (2024)

Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
by: Varma, Om Ramakisan, et al.
Published: (2024)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
by: Ordyniak, Sebastian, et al.
Published: (2024)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
by: Fioravantes, Foivos, et al.
Published: (2024)

Barriers to Complexity-Theoretic Proofs that "AGI" Using Machine Learning is Impossible
by: Guerzhoy, Michael
Published: (2024)

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
by: Asadi, Ali, et al.
Published: (2026)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
by: Eriksson, Leif, et al.
Published: (2026)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
by: Goertzel, Ben, et al.
Published: (2026)