en
0.25
0.5
0.75
1.25
1.5
1.75
2
On the Complexity and Approximation of Binary Evidence in Lifted Inference
Published on 2014-11-071757 Views
Lifted inference algorithms exploit symmetries in probabilistic models to speed up inference. They show impressive performance when calculating unconditional probabilities in relational models, but of
Related categories
Presentation
On the Complexity and Approximation of Binary Evidence in Lifted Inference00:00
Complexity of Probabilistic Inference01:02
Analogy with Treewidth in Bayesian Networks02:10
Over-Symmetric Evidence Approximation02:54