DeepAI AI Chat
Log In Sign Up

Improving the Accuracy and Efficiency of MAP Inference for Markov Logic

by   Sebastian Riedel, et al.

In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspired by the Cutting Plane Method, it can be seen as a meta algorithm that instantiates small parts of a large and complex Markov Network and then solves these using a conventional MAP method. We evaluate CPI on two tasks, Semantic Role Labelling and Joint Entity Resolution, while plugging in two different MAP inference methods: the current method of choice for MAP inference in Markov Logic, MaxWalkSAT, and Integer Linear Programming. We observe that when used with CPI both methods are significantly faster than when used alone. In addition, CPI improves the accuracy of MaxWalkSAT and maintains the exactness of Integer Linear Programming.


page 1

page 2

page 3

page 4


RockIt: Exploiting Parallelism and Symmetry for MAP Inference in Statistical Relational Models

RockIt is a maximum a-posteriori (MAP) query engine for statistical rela...

The Integer Linear Programming Inference Cookbook

Over the years, integer linear programs have been employed to model infe...

Encoding Markov Logic Networks in Possibilistic Logic

Markov logic uses weighted formulas to compactly encode a probability di...

A Delayed Column Generation Strategy for Exact k-Bounded MAP Inference in Markov Logic Networks

The paper introduces k-bounded MAP inference, a parameterization of MAP ...

Vietnamese Semantic Role Labelling

In this paper, we study semantic role labelling (SRL), a subtask of sema...

First-Order Mixed Integer Linear Programming

Mixed integer linear programming (MILP) is a powerful representation oft...

Markov Logic Networks with Statistical Quantifiers

Markov Logic Networks (MLNs) are well-suited for expressing statistics s...