Alert button
Picture for Saurabh Mathur

Saurabh Mathur

Alert button

Explaining Deep Tractable Probabilistic Models: The sum-product network case

Oct 19, 2021
Athresh Karanam, Saurabh Mathur, Predrag Radivojac, Kristian Kersting, Sriraam Natarajan

Figure 1 for Explaining Deep Tractable Probabilistic Models: The sum-product network case
Figure 2 for Explaining Deep Tractable Probabilistic Models: The sum-product network case
Figure 3 for Explaining Deep Tractable Probabilistic Models: The sum-product network case
Figure 4 for Explaining Deep Tractable Probabilistic Models: The sum-product network case

We consider the problem of explaining a tractable deep probabilistic model, the Sum-Product Networks (SPNs).To this effect, we define the notion of a context-specific independence tree and present an iterative algorithm that converts an SPN to a CSI-tree. The resulting CSI-tree is both interpretable and explainable to the domain expert. To further compress the tree, we approximate the CSIs by fitting a supervised classifier. Our extensive empirical evaluations on synthetic, standard, and real-world clinical data sets demonstrate that the resulting models exhibit superior explainability without loss in performance.

* Main paper: 8 pages, references: 1 page. Main paper: 4 figures 
Viaarxiv icon