Differentiable Reasoning about Knowledge Graphs with Region-based Graph Neural Networks

• URL: http://arxiv.org/abs/2406.09529v1
• Date: Thu, 13 Jun 2024 18:37:24 GMT
• Title: Differentiable Reasoning about Knowledge Graphs with Region-based Graph Neural Networks
• Authors: Aleksandar Pavlovic, Emanuel Sallinger, Steven Schockaert,
• Abstract summary: Methods for knowledge graph (KG) completion need to capture semantic regularities and use these regularities to infer plausible knowledge that is not explicitly stated. Most embedding-based methods are opaque in the kinds of regularities they can capture, although region-based KG embedding models have emerged as a more transparent alternative. We propose RESHUFFLE, a simple model based on ordering constraints that can faithfully capture a much larger class of rule bases than existing approaches.
• Score: 62.93577376960498
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Methods for knowledge graph (KG) completion need to capture semantic regularities and use these regularities to infer plausible knowledge that is not explicitly stated. Most embedding-based methods are opaque in the kinds of regularities they can capture, although region-based KG embedding models have emerged as a more transparent alternative. By modeling relations as geometric regions in high-dimensional vector spaces, such models can explicitly capture semantic regularities in terms of the spatial arrangement of these regions. Unfortunately, existing region-based approaches are severely limited in the kinds of rules they can capture. We argue that this limitation arises because the considered regions are defined as the Cartesian product of two-dimensional regions. As an alternative, in this paper, we propose RESHUFFLE, a simple model based on ordering constraints that can faithfully capture a much larger class of rule bases than existing approaches. Moreover, the embeddings in our framework can be learned by a monotonic Graph Neural Network (GNN), which effectively acts as a differentiable rule base. This approach has the important advantage that embeddings can be easily updated as new knowledge is added to the KG. At the same time, since the resulting representations can be used similarly to standard KG embeddings, our approach is significantly more efficient than existing approaches to differentiable reasoning.

Related papers

• Generating grid maps via the snake model [10.489493860187348]
  The grid map, often referred to as the tile map, stands as a vital tool in geospatial visualization. It transforms geographic regions into grids, which requires the displacement of both region centroids and boundary nodes to establish a coherent grid arrangement. Existing approaches typically displace region centroids and boundary nodes separately, potentially resulting in self-intersected boundaries. We introduce a novel approach that leverages the Snake displacement algorithm from cartographic generalization to concurrently displace region centroids and boundary nodes.
  arXiv  Detail & Related papers  (2024-06-04T02:24:39Z)
• Capturing Knowledge Graphs and Rules with Octagon Embeddings [17.49288661342947]
  Region based knowledge graph embeddings represent relations as geometric regions. Existing approaches are severely restricted in their ability to model composition. We show that our octagon embeddings can properly capture a non-trivial class of rule bases.
  arXiv  Detail & Related papers  (2024-01-29T16:18:54Z)
• TANGOS: Regularizing Tabular Neural Networks through Gradient Orthogonalization and Specialization [69.80141512683254]
  We introduce Tabular Neural Gradient Orthogonalization and gradient (TANGOS) TANGOS is a novel framework for regularization in the tabular setting built on latent unit attributions. We demonstrate that our approach can lead to improved out-of-sample generalization performance, outperforming other popular regularization methods.
  arXiv  Detail & Related papers  (2023-03-09T18:57:13Z)
• Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation [79.13041340708395]
  Lipschitz constants are connected to many properties of neural networks, such as robustness, fairness, and generalization. Existing methods for computing Lipschitz constants either produce relatively loose upper bounds or are limited to small networks. We develop an efficient framework for computing the $ell_infty$ local Lipschitz constant of a neural network by tightly upper bounding the norm of Clarke Jacobian.
  arXiv  Detail & Related papers  (2022-10-13T22:23:22Z)
• Semantic Segmentation by Early Region Proxy [53.594035639400616]
  We present a novel and efficient modeling that starts from interpreting the image as a tessellation of learnable regions. To model region-wise context, we exploit Transformer to encode regions in a sequence-to-sequence manner. Semantic segmentation is now carried out as per-region prediction on top of the encoded region embeddings.
  arXiv  Detail & Related papers  (2022-03-26T10:48:32Z)
• Variational Inference with Locally Enhanced Bounds for Hierarchical Models [38.73307745906571]
  We propose a new family of variational bounds for hierarchical models based on the application of tightening methods. We show that our approach naturally allows the use of subsampling to get unbiased gradients, and that it fully leverages the power of methods that build tighter lower bounds.
  arXiv  Detail & Related papers  (2022-03-08T22:53:43Z)
• EngineKGI: Closed-Loop Knowledge Graph Inference [37.15381932994768]
  EngineKGI is a novel closed-loop KG inference framework. It combines KGE and rule learning to complement each other in a closed-loop pattern. Our model outperforms other baselines on link prediction tasks.
  arXiv  Detail & Related papers  (2021-12-02T08:02:59Z)
• Rewriting a Deep Generative Model [56.91974064348137]
  We introduce a new problem setting: manipulation of specific rules encoded by a deep generative model. We propose a formulation in which the desired rule is changed by manipulating a layer of a deep network as a linear associative memory. We present a user interface to enable users to interactively change the rules of a generative model to achieve desired effects.
  arXiv  Detail & Related papers  (2020-07-30T17:58:16Z)
• Attentive Normalization for Conditional Image Generation [126.08247355367043]
  We characterize long-range dependence with attentive normalization (AN), which is an extension to traditional instance normalization. Compared with self-attention GAN, our attentive normalization does not need to measure the correlation of all locations. Experiments on class-conditional image generation and semantic inpainting verify the efficacy of our proposed module.
  arXiv  Detail & Related papers  (2020-04-08T06:12:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.