Search Results for author:
Found 6 papers, 0 papers with code
Bounding the Cost of Search-Based Lifted Inference
Given a schematic-based representation of an SRM, we show how to efficiently compute a tight upper bound on the time and space cost of exact inference from a current assignment and the remaining schematic.
Lifted Inference Rules With Constraints
Lifted inference rules exploit symmetries for fast reasoning in statistical rela-tional models.
Fast Lifted MAP Inference via Partitioning
A key advantage of these lifted algorithms is that they have much smaller computational complexity than propositional algorithms when symmetries are present in the MLN and these symmetries can be detected using lifted inference rules.
Scaling-up Importance Sampling for Markov Logic Networks
Second, they suffer from the evidence problem, which arises because evidence breaks symmetries, severely diminishing the power of lifted inference.
An Integer Polynomial Programming Based Framework for Lifted MAP Inference
In this paper, we present a new approach for lifted MAP inference in Markov logic networks (MLNs).
New Rules for Domain Independent Lifted MAP Inference
In this paper, we present two new lifting rules, which enable fast MAP inference in a large class of MLNs.
