Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets

TL;DR

This paper introduces a probabilistic circuit-based method for knowledge graph completion that significantly reduces rule set size while maintaining or improving performance, enhancing explainability and efficiency.

Contribution

It discovers meaningful rule contexts and uses probabilistic circuits to achieve high performance with fewer rules, without assuming independence.

Findings

Achieves 70-96% reduction in rules used

Outperforms baseline by up to 31× with minimal rules

Maintains 91% of peak baseline performance

Abstract

Rule-based methods for knowledge graph completion provide explainable results but often require a significantly large number of rules to achieve competitive performance. This can hinder explainability due to overwhelmingly large rule sets. We discover rule contexts (meaningful subsets of rules that work together) from training data and use learned probability distribution (i.e. probabilistic circuits) over these rule contexts to more rapidly achieve performance of the full rule set. Our approach achieves a 70-96% reduction in number of rules used while outperforming baseline by up to 31$\times$ when using equivalent minimal number of rules and preserves 91% of peak baseline performance even when comparing our minimal rule sets against baseline's full rule sets. We show that our framework is grounded in well-known semantics of probabilistic logic, does not require independence assumptions, and that our tractable inference procedure provides both approximate lower bounds and exact probability of a given query. The efficacy of our method is validated by empirical studies on 8 standard benchmark datasets where we show competitive performance by using only a fraction of the rules required by AnyBURL's standard inference method, the current state-of-the-art for rule-based knowledge graph completion. This work may have further implications for general probabilistic reasoning over learned sets of rules.