Motif Learning in Knowledge Graphs Using Trajectories Of Differential Equations
Mojtaba Nayyeri, Chengjin Xu, Jens Lehmann, Sahar Vahdati

TL;DR
This paper introduces a novel knowledge graph embedding method using neural differential equations to model complex geometric structures, improving the preservation of graph motifs and reducing inference errors.
Contribution
It proposes a neuro differential KGE that embeds entities via ODE trajectories on manifolds, capturing complex structures better than flat geometry models.
Findings
ODE-based embeddings preserve graph motifs effectively
The method outperforms state-of-the-art models on synthetic and real datasets
Reduces incorrect inferences in knowledge graph link prediction
Abstract
Knowledge Graph Embeddings (KGEs) have shown promising performance on link prediction tasks by mapping the entities and relations from a knowledge graph into a geometric space (usually a vector space). Ultimately, the plausibility of the predicted links is measured by using a scoring function over the learned embeddings (vectors). Therefore, the capability in preserving graph characteristics including structural aspects and semantics highly depends on the design of the KGE, as well as the inherited abilities from the underlying geometry. Many KGEs use the flat geometry which renders them incapable of preserving complex structures and consequently causes wrong inferences by the models. To address this problem, we propose a neuro differential KGE that embeds nodes of a KG on the trajectories of Ordinary Differential Equations (ODEs). To this end, we represent each relation (edge) in a KG…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
