4 papers · 1 filter
A canonical generalization of OBDD
Florent Capelli, YooJung Choi, Stefan Mengel +2
We introduce Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes OBDD. They can be seen as a restriction of structured d-DNNF; that is, d-DNNF that respe…
Restructuring Tractable Probabilistic Circuits
Honghua Zhang, Benjie Wang, Marcelo Arenas +1
Probabilistic circuits (PCs) are a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation…
A Compositional Atlas for Algebraic Circuits
Benjie Wang, Denis Deratani Mauá, Guy Van den Broeck +1
Circuits based on sum-product structure have become a ubiquitous representation to compactly encode knowledge, from Boolean functions to probability distributions. By imposing cons…
Polynomial Semantics of Tractable Probabilistic Circuits
Oliver Broadrick, Honghua Zhang, Guy Van den Broeck
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. H…