2 papers
cs.AI2025
On the Hardness of Approximating Distributions with Tractable Probabilistic Models
John Leland, YooJung Choi
A fundamental challenge in probabilistic modeling is to balance expressivity and inference efficiency. Tractable probabilistic models (TPMs) aim to directly address this tradeoff b…
cs.AI2025
Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets
Jaikrishna Manojkumar Patil, Nathaniel Lee, Al Mehdi Saadat Chowdhury +2
Rule-based methods for knowledge graph completion provide explainable results, but often require tens of thousands of rules to achieve competitive performance. Although individual…