Fully Geometric Multi-Hop Reasoning on Knowledge Graphs with Transitive Relations
- URL: http://arxiv.org/abs/2505.12369v1
- Date: Sun, 18 May 2025 11:17:50 GMT
- Title: Fully Geometric Multi-Hop Reasoning on Knowledge Graphs with Transitive Relations
- Authors: Fernando Zhapa-Camacho, Robert Hoehndorf,
- Abstract summary: We introduce GeometrE, a geometric embedding method for multi-hop reasoning.<n>It does not require learning the logical operations and enables full geometric interpretability.<n>Our experiments show that GeometrE outperforms current state-of-the-art methods on standard benchmark datasets.
- Score: 50.05281461410368
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Geometric embedding methods have shown to be useful for multi-hop reasoning on knowledge graphs by mapping entities and logical operations to geometric regions and geometric transformations, respectively. Geometric embeddings provide direct interpretability framework for queries. However, current methods have only leveraged the geometric construction of entities, failing to map logical operations to geometric transformations and, instead, using neural components to learn these operations. We introduce GeometrE, a geometric embedding method for multi-hop reasoning, which does not require learning the logical operations and enables full geometric interpretability. Additionally, unlike previous methods, we introduce a transitive loss function and show that it can preserve the logical rule $\forall a,b,c: r(a,b) \land r(b,c) \to r(a,c)$. Our experiments show that GeometrE outperforms current state-of-the-art methods on standard benchmark datasets.
Related papers
- Cover Learning for Large-Scale Topology Representation [0.0]
We describe a method for learning topologically-faithful covers of geometric datasets.<n>We show that the simplicial complexes thus obtained can outperform standard topological inference approaches in terms of size.
arXiv Detail & Related papers (2025-03-12T19:10:20Z) - Transferable Foundation Models for Geometric Tasks on Point Cloud Representations: Geometric Neural Operators [0.0]
We introduce methods for obtaining pretrained Geometric Neural Operators (GNPs)<n>GNPs can serve as basal foundation models for use in obtaining geometric features.<n>We show how our GNPs can be trained to learn robust latent representations for the differential geometry of point-clouds.
arXiv Detail & Related papers (2025-03-06T17:35:37Z) - Disentangled Representation Learning with the Gromov-Monge Gap [65.73194652234848]
Learning disentangled representations from unlabelled data is a fundamental challenge in machine learning.
We introduce a novel approach to disentangled representation learning based on quadratic optimal transport.
We demonstrate the effectiveness of our approach for quantifying disentanglement across four standard benchmarks.
arXiv Detail & Related papers (2024-07-10T16:51:32Z) - Geometric Neural Operators (GNPs) for Data-Driven Deep Learning of Non-Euclidean Operators [0.0]
We introduce Geometric Neural Operators (GNPs) for accounting for geometric contributions in data-driven deep learning of operators.
We show how GNPs can be used to estimate geometric properties, such as the metric and curvatures, and to approximate Partial Differential Equations.
The developed GNPs provide approaches for incorporating the roles of geometry in data-driven learning of operators.
arXiv Detail & Related papers (2024-04-16T18:43:27Z) - A Survey of Geometric Graph Neural Networks: Data Structures, Models and Applications [71.809127869349]
This paper formalizes geometric graph as the data structure, on top of which we provide a unified view of existing models from the geometric message passing perspective.<n>We also summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation.
arXiv Detail & Related papers (2024-03-01T12:13:04Z) - Exploring Data Geometry for Continual Learning [64.4358878435983]
We study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data.
Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data.
Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.
arXiv Detail & Related papers (2023-04-08T06:35:25Z) - Geometric Clifford Algebra Networks [53.456211342585824]
We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems.
GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
arXiv Detail & Related papers (2023-02-13T18:48:33Z) - Plane Geometry Diagram Parsing [29.921409628478152]
We propose a powerful diagram based on deep learning and graph reasoning.
A modified instance segmentation method is proposed to extract geometric primitives.
The graph neural network (GNN) is leveraged to realize relation parsing and primitive classification.
arXiv Detail & Related papers (2022-05-19T07:47:01Z) - Inter-GPS: Interpretable Geometry Problem Solving with Formal Language
and Symbolic Reasoning [123.06420835072225]
We construct a new large-scale benchmark, Geometry3K, consisting of 3,002 geometry problems with dense annotation in formal language.
We propose a novel geometry solving approach with formal language and symbolic reasoning, called Interpretable Geometry Problem solver (Inter-GPS)
Inter-GPS incorporates theorem knowledge as conditional rules and performs symbolic reasoning step by step.
arXiv Detail & Related papers (2021-05-10T07:46:55Z) - Towards Automated Discovery of Geometrical Theorems in GeoGebra [0.0]
We describe a prototype of a new experimental GeoGebra command and tool Discover that analyzes geometric figures for salient patterns, properties, and theorems.
The paper focuses on the mathematical background of the implementation, as well as methods to avoid explosion when storing the interesting properties of a geometric figure.
arXiv Detail & Related papers (2020-07-24T10:59:39Z)
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.