Search Results for author:
Found 2 papers, 0 papers with code
Sound Abstraction and Decomposition of Probabilistic Programs
Experimentally, we also illustrate the practical benefits of our framework as a tool to decompose probabilistic program inference.
On the Completeness of First-Order Knowledge Compilation for Lifted Probabilistic Inference
To solve this problem, various lifted inference algorithms have been proposed that reason at the first-order level, about groups of objects as a whole.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
