Heterogeneous manifolds for curvature-aware graph embedding
- URL: http://arxiv.org/abs/2202.01185v1
- Date: Wed, 2 Feb 2022 18:18:35 GMT
- Title: Heterogeneous manifolds for curvature-aware graph embedding
- Authors: Francesco Di Giovanni, Giulia Luise, Michael Bronstein
- Abstract summary: Graph embeddings are used in a broad range of Graph ML applications.
The quality of such embeddings crucially depends on whether the geometry of the space matches that of the graph.
- Score: 6.3351090376024155
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph embeddings, wherein the nodes of the graph are represented by points in
a continuous space, are used in a broad range of Graph ML applications. The
quality of such embeddings crucially depends on whether the geometry of the
space matches that of the graph. Euclidean spaces are often a poor choice for
many types of real-world graphs, where hierarchical structure and a power-law
degree distribution are linked to negative curvature. In this regard, it has
recently been shown that hyperbolic spaces and more general manifolds, such as
products of constant-curvature spaces and matrix manifolds, are advantageous to
approximately match nodes pairwise distances. However, all these classes of
manifolds are homogeneous, implying that the curvature distribution is the same
at each point, making them unsuited to match the local curvature (and related
structural properties) of the graph. In this paper, we study graph embeddings
in a broader class of heterogeneous rotationally-symmetric manifolds. By adding
a single extra radial dimension to any given existing homogeneous model, we can
both account for heterogeneous curvature distributions on graphs and pairwise
distances. We evaluate our approach on reconstruction tasks on synthetic and
real datasets and show its potential in better preservation of high-order
structures and heterogeneous random graphs generation.
Related papers
- Ironing the Graphs: Toward a Correct Geometric Analysis of Large-Scale Graphs [2.2557806157585834]
We argue that the classical embedding techniques cannot lead to correct geometric interpretation as they miss the curvature at each point, of manifold.
We present an embedding approach, the discrete Ricci flow graph embedding (dRfge) based on the discrete Ricci flow.
A major contribution of this paper is that for the first time, we prove the convergence of discrete Ricci flow to a constant curvature and stable distance metrics over the edges.
arXiv Detail & Related papers (2024-07-31T13:47:53Z) - Hyperbolic Heterogeneous Graph Attention Networks [3.0165549581582454]
Most previous heterogeneous graph embedding models represent elements in a heterogeneous graph as vector representations in a low-dimensional Euclidean space.
We propose Hyperbolic Heterogeneous Graph Attention Networks (HHGAT) that learn vector representations in hyperbolic spaces with meta-path instances.
We conducted experiments on three real-world heterogeneous graph datasets, demonstrating that HHGAT outperforms state-of-the-art heterogeneous graph embedding models in node classification and clustering tasks.
arXiv Detail & Related papers (2024-04-15T04:45:49Z) - Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure.
We introduce a new class of manifold, named soft manifold, that can solve this situation.
Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
arXiv Detail & Related papers (2023-11-29T12:48:33Z) - Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive
Learning [69.6810940330906]
We propose a novel contrastive learning framework to learn high-quality graph embedding.
Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information.
We show that in the hyperbolic space one has to address the leaf- and height-level uniformity which are related to properties of trees.
arXiv Detail & Related papers (2023-10-27T15:31:42Z) - Curve Your Attention: Mixed-Curvature Transformers for Graph
Representation Learning [77.1421343649344]
We propose a generalization of Transformers towards operating entirely on the product of constant curvature spaces.
We also provide a kernelized approach to non-Euclidean attention, which enables our model to run in time and memory cost linear to the number of nodes and edges.
arXiv Detail & Related papers (2023-09-08T02:44:37Z) - Finding the Missing-half: Graph Complementary Learning for
Homophily-prone and Heterophily-prone Graphs [48.79929516665371]
Graphs with homophily-prone edges tend to connect nodes with the same class.
Heterophily-prone edges tend to build relationships between nodes with different classes.
Existing GNNs only take the original graph during training.
arXiv Detail & Related papers (2023-06-13T08:06:10Z) - Contrastive Graph Clustering in Curvature Spaces [74.03252813800334]
We present a novel end-to-end contrastive graph clustering model named CONGREGATE.
To support geometric clustering, we construct a theoretically grounded Heterogeneous Curvature Space.
We then train the graph clusters by an augmentation-free reweighted contrastive approach.
arXiv Detail & Related papers (2023-05-05T14:04:52Z) - Geometry Contrastive Learning on Heterogeneous Graphs [50.58523799455101]
This paper proposes a novel self-supervised learning method, termed as Geometry Contrastive Learning (GCL)
GCL views a heterogeneous graph from Euclidean and hyperbolic perspective simultaneously, aiming to make a strong merger of the ability of modeling rich semantics and complex structures.
Extensive experiments on four benchmarks data sets show that the proposed approach outperforms the strong baselines.
arXiv Detail & Related papers (2022-06-25T03:54:53Z) - Curvature Graph Generative Adversarial Networks [31.763904668737304]
Generative adversarial network (GAN) is widely used for generalized and robust learning on graph data.
Existing GAN-based graph representation methods generate negative samples by random walk or traverse in discrete space.
CurvGAN consistently and significantly outperforms the state-of-the-art methods across multiple tasks.
arXiv Detail & Related papers (2022-03-03T10:00:32Z) - Directed Graph Embeddings in Pseudo-Riemannian Manifolds [0.0]
We show that general directed graphs can be effectively represented by an embedding model that combines three components.
We demonstrate the representational capabilities of this method by applying it to the task of link prediction.
arXiv Detail & Related papers (2021-06-16T10:31:37Z)
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.