10 citations · 11 across the 2 of their papers we have counts for
3 papers
Soft Learning Probabilistic Circuits
Soroush Ghandi, Benjamin Quost, Cassio de Campos
Probabilistic Circuits (PCs) are prominent tractable probabilistic models, allowing for a range of exact inferences. This paper focuses on the main algorithm for training PCs, Lear…
Probabilistic Circuits with Constraints via Convex Optimization
Soroush Ghandi, Benjamin Quost, Cassio de Campos
This work addresses integrating probabilistic propositional logic constraints into the distribution encoded by a probabilistic circuit (PC). PCs are a class of tractable models tha…
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks
Diarmaid Conaty, Denis D. Mauá, Cassio P. de Campos
We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction fro…