sHGCN: Simplified hyperbolic graph convolutional neural networks

Pol Arévalo, Alexis Molina, Álvaro Ciudad
6/17/2025
cs.LGcs.AI

No official code found. Best implementation: pol-arevalo-soler/Hyperbolic-GCN (2 stars, MIT, last commit 2024-11-26).

Abstract

Hyperbolic geometry has emerged as a powerful tool for modeling complex, structured data, particularly where hierarchical or tree-like relationships are present. By enabling embeddings with lower distortion, hyperbolic neural networks offer promising alternatives to Euclidean-based models for capturing intricate data structures. Despite these advantages, they often face performance challenges, particularly in computational efficiency and tasks requiring high precision. In this work, we address these limitations by simplifying key operations within hyperbolic neural networks, achieving notable improvements in both runtime and performance. Our findings demonstrate that streamlined hyperbolic operations can lead to substantial gains in computational speed and predictive accuracy, making hyperbolic neural networks a more viable choice for a broader range of applications.

View on arXivView PDF

Code Implementations(1)

MIT

Hyperbolic graph convolutional neural networks

20Shell, PythonNov 5, 20241 years agoMIT

Similar Papers

Cite this paper

@article{arvalo2025shgcn,
  title  = {sHGCN: Simplified hyperbolic graph convolutional neural networks},
  author = {Pol Arévalo and Alexis Molina and Álvaro Ciudad},
  year   = {2025},
  eprint = {2506.14438},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.14438v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.14438.svg)](https://codeofpaper.com/paper/2506.14438)

Discussion