Pith. sign in

REVIEW 4 cited by

Hyperbolic Graph Neural Networks: A Review of Methods and Applications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.13852 v4 pith:A3CKO4TR submitted 2022-02-28 cs.LG

classification cs.LG
keywords graphhyperboliclearningmodelsstructuresapplicationscomplexcomprehensive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph representation learning in Euclidean space, despite its widespread adoption and proven utility in many domains, often struggles to effectively capture the inherent hierarchical and complex relational structures prevalent in real-world data, particularly for datasets exhibiting a highly non-Euclidean latent anatomy or power-law distributions. Hyperbolic geometry, with its constant negative curvature and exponential growth property, naturally accommodates such structures, offering a promising alternative for learning rich graph representations. This survey paper provides a comprehensive review of the rapidly evolving field of Hyperbolic Graph Learning (HGL). We systematically categorize and analyze existing methods broadly dividing them into (1) hyperbolic graph embedding-based techniques, (2) graph neural network-based hyperbolic models, and (3) emerging paradigms. Beyond methodologies, we extensively discuss diverse applications of HGL across multiple domains, including recommender systems, knowledge graphs, bioinformatics, and other relevant scenarios, demonstrating the broad applicability and effectiveness of hyperbolic geometry in real-world graph learning tasks. Most importantly, we identify several key challenges that serve as directions for advancing HGL, including handling complex data structures, developing geometry-aware learning objectives, ensuring trustworthy and scalable implementations, and integrating with foundation models, e.g., large language models. We highlight promising research opportunities in this exciting interdisciplinary area. A comprehensive repository can be found at https://github.com/digailab/awesome-hyperbolic-graph-learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. sHGCN: Simplified hyperbolic graph convolutional neural networks

    cs.LG 2025-06 conditional novelty 4.0 of 10

    A simplified hyperbolic GCN that avoids redundant log/exp computations is competitive or faster than prior HGCN variants on four benchmark graphs.

  2. Clique detection using symmetry-restricted quantum circuits

    quant-ph 2025-06 reject novelty 4.0 of 10

    Permutation-invariant quantum circuits label cliques in small random graphs more accurately than cyclic-invariant or standard ansatze in simulation.

  3. Towards Non-Euclidean Foundation Models: Advancing AI Beyond Euclidean Frameworks

    cs.CG 2025-05 unverdicted novelty 2.0 of 10

    A workshop proposal outlining the case for combining non-Euclidean geometry with foundation models for web applications.

  4. Hyperbolic Deep Learning for Foundation Models: A Survey

    cs.LG 2025-07 conditional novelty 1.0 of 10

    A structured survey of hyperbolic-geometry methods for foundation models, concluding the approach is promising but showing limited independent evidence at scale.

Pith tools