Domain-Liftability of Relational Marginal Polytopes

01/15/2020
by   Ondrej Kuzelka, et al.
0

We study computational aspects of relational marginal polytopes which are statistical relational learning counterparts of marginal polytopes, well-known from probabilistic graphical models. Here, given some first-order logic formula, we can define its relational marginal statistic to be the fraction of groundings that make this formula true in a given possible world. For a list of first-order logic formulas, the relational marginal polytope is the set of all points that correspond to the expected values of the relational marginal statistics that are realizable. In this paper, we study the following two problems: (i) Do domain-liftability results for the partition functions of Markov logic networks (MLNs) carry over to the problem of relational marginal polytope construction? (ii) Is the relational marginal polytope containment problem hard under some plausible complexity-theoretic assumptions? Our positive results have consequences for lifted weight learning of MLNs. In particular, we show that weight learning of MLNs is domain-liftable whenever the computation of the partition function of the respective MLNs is domain-liftable (this result has not been rigorously proven before).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2017

Relational Marginal Problems: Theory and Estimation

In the propositional setting, the marginal problem is to find a (maximum...
research
06/18/2021

Asymptotic elimination of partially continuous aggregation functions in directed graphical models

In Statistical Relational Artificial Intelligence, a branch of AI and ma...
research
04/17/2018

VC-Dimension Based Generalization Bounds for Relational Learning

In many applications of relational learning, the available data can be s...
research
11/07/2022

Learning Probabilistic Temporal Safety Properties from Examples in Relational Domains

We propose a framework for learning a fragment of probabilistic computat...
research
07/02/2018

Inference, Learning, and Population Size: Projectivity for SRL Models

A subtle difference between propositional and relational data is that in...
research
07/03/2018

Markov Logic Networks with Statistical Quantifiers

Markov Logic Networks (MLNs) are well-suited for expressing statistics s...
research
10/26/2016

New Liftable Classes for First-Order Probabilistic Inference

Statistical relational models provide compact encodings of probabilistic...

Please sign up or login with your details

Forgot password? Click here to reset