New liftable classes for first-order probabilistic inference

Kazemi, Seyed Mehran, Kimmig, Angelika ORCID: https://orcid.org/0000-0002-6742-4057, Broeck, Guy Van den and Poole, David 2016. New liftable classes for first-order probabilistic inference. Presented at: Neural Information Processing Systems, Barcelona, Spain, 5-10 December 2016.

Preview

PDF - Accepted Post-Print Version Download (502kB) | Preview

Abstract

Statistical relational models provide compact encodings of probabilistic dependencies in relational domains, but result in highly intractable graphical models. The goal of lifted inference is to carry out probabilistic inference without needing to reason about each individual separately, by instead treating exchangeable, undistinguished objects as a whole. In this paper, we study the domain recursion inference rule, which, despite its central role in early theoretical results on domain-lifted inference, has later been believed redundant. We show that this rule is more powerful than expected, and in fact significantly extends the range of models for which lifted inference runs in time polynomial in the number of individuals in the domain. This includes an open problem called S4, the symmetric transitivity model, and a first-order logic encoding of the birthday paradox. We further identify new classes S2FO2 and S2RU of domain-liftable theories, which respectively subsume FO2 and recursively unary theories, the largest classes of domain-liftable theories known so far, and show that using domain recursion can achieve exponential speedup even in theories that cannot fully be lifted with the existing set of inference rules.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Acceptance
Status:	Unpublished
Schools:	Computer Science & Informatics
Date of First Compliant Deposit:	5 August 2019
Date of Acceptance:	12 August 2016
Last Modified:	26 Oct 2022 07:23
URI:	https://orca.cardiff.ac.uk/id/eprint/124716

Citation Data

Cited 23 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item