Node-Specific Space Selection via Localized Geometric Hyperbolicity in Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Many graph neural networks have been developed to learn graph representations in either Euclidean or hyperbolic space, with all nodes' representations embedded in a single space. However, a graph can have hyperbolic and Euclidean geometries at different regions of the graph. Thus, it is sub-optimal to indifferently embed an entire graph into a single space. In this paper, we explore and analyze two notions of local hyperbolicity, describing the underlying local geometry: geometric (Gromov) and model-based, to determine the preferred space of embedding for each node. The two hyperbolicities' distributions are aligned using the Wasserstein metric such that the calculated geometric hyperbolicity guides the choice of the learned model hyperbolicity. As such our model Joint Space Graph Neural Network (JSGNN) can leverage both Euclidean and hyperbolic spaces during learning by allowing node-specific geometry space selection. We evaluate our model on both node classification and link prediction tasks and observe promising performance compared to baseline models.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 41 references that are in the map. First posted on arXiv 3 Mar 2023.
Builds on
30 of 41 references.
References · 30
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
- 2019Hyperbolic Graph Convolutional Neural Networkscited by 400
- 2021GRAND: Graph Neural Diffusioncited by 258
18 more
- 2019Hyperbolic Graph Neural Networkscited by 244
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2019Generalized Sliced Wasserstein Distancescited by 205
- 2019Constant Curvature Graph Convolutional Networkscited by 106
- 2022Decoupling the Depth and Scope of Graph Neural Networkscited by 94
- 2021Beltrami Flow and Neural Diffusion on Graphscited by 84
- 2019Hyperbolic Graph Attention Networkcited by 69
- 2021Lorentzian Graph Convolutional Networkscited by 66
- 2020Graph Geometry Interaction Learningcited by 55
- 2021Local Augmentation for Graph Neural Networkscited by 52
- 2018Large-Margin Classification in Hyperbolic Spacecited by 41
- 2022Hyperbolic Graph Neural Networks: A Review of Methods and Applicationscited by 40
- 2021Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendationcited by 38
- 2019Orthogonal Estimation of Wasserstein Distancescited by 32
- 2021A Self-supervised Mixed-curvature Graph Neural Networkcited by 32
- 2021Pseudo-Riemannian Graph Convolutional Networkscited by 30
- 2021Curvature Graph Neural Networkcited by 24
- 2022Enhancing Hyperbolic Graph Embeddings via Contrastive Learningcited by 20
Built on by
Citing papers per year: 2026: 2.
2 papers.