A restructuring algorithm converts structured probabilistic circuits between different variable-order trees in polynomial time for contiguous circuits, enabling tractable multiplication of differently structured circuits and log-depth reduction with modest size growth.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Restructuring Tractable Probabilistic Circuits
A restructuring algorithm converts structured probabilistic circuits between different variable-order trees in polynomial time for contiguous circuits, enabling tractable multiplication of differently structured circuits and log-depth reduction with modest size growth.