Directed Graph Embeddings in Pseudo-Riemannian Manifolds
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model that combines three components: a pseudo-Riemannian metric structure, a non-trivial global topology, and a unique likelihood function that explicitly incorporates a preferred direction in embedding space. We demonstrate the representational capabilities of this method by applying it to the task of link prediction on a series of synthetic and real directed graphs from natural language applications and biology. In particular, we show that low-dimensional cylindrical Minkowski and anti-de Sitter spacetimes can produce equal or better graph representations than curved Riemannian manifolds of higher dimensions.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph Representation LearningLink PredictionRepresentation LearningSimilar Papers 제목 키워드 기반
Pseudo-Riemannian Graph Convolutional Networks
Graph convolutional networks (GCNs) are powerful frameworks for learning embeddings of graph-structured data. GCNs are traditionally studied through the lens of Euclidean geometry. Recent works find that non-Euclidean Ri…
Graph ReconstructionInductive BiasLink PredictionNode ClassificationPR-CapsNet: Pseudo-Riemannian Capsule Network with Adaptive Curvature Routing for Graph Learning
Capsule Networks (CapsNets) show exceptional graph representation capacity via dynamic routing and vectorized hierarchical representations, but they model the complex geometries of real\-world graphs poorly by fixed\-cur…
Graph Representation LearningGraph ClassificationGraph LearningPseudo-Riemannian Embedding Models for Multi-Relational Graph Representations
In this paper we generalize single-relation pseudo-Riemannian graph embedding models to multi-relational networks, and show that the typical approach of encoding relations as manifold transformations translates from the …
Graph EmbeddingKnowledge Graph CompletionLink PredictionComputationally Tractable Riemannian Manifolds for Graph Embeddings
Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures bene…
BIG-bench Machine LearningUltrahyperbolic Knowledge Graph Embeddings
Recent knowledge graph (KG) embeddings have been advanced by hyperbolic geometry due to its superior capability for representing hierarchies. The topological structures of real-world KGs, however, are rather heterogeneou…
Knowledge Graph Embeddings