Topology-Adaptive Hyperbolic Graph Attention Networks Guided by the Hyperbolic Sombor Index
cs.LG
Submitted: 2026-09-26
Updated: 2026-09-26
License: http://creativecommons.org/licenses/by/4.0/
The gist: Hyperbolic geometry has emerged as a principled space for representing hierarchical graphs.
Terminology
Abstract
Hyperbolic geometry has emerged as a principled space for representing hierarchical graphs. However, existing hyperbolic graph neural networks typically rely on shared curvature configurations and feature-driven attention, failing to explicitly exploit local hierarchical topological patterns. To bridge this gap, we introduce the Hyperbolic Sombor Index (HSO) as a lightweight structural prior for capturing hierarchy-indicative degree stratification. Building on this, we propose HSO-GAT, a topology-adaptive hyperbolic graph attention network that unifies geometric adaptation and message propagation. Specifically, it comprises two complementary modules: HSO-Guided Local Curvature Adaptation, which performs adaptive node-wise geometric scaling from aggregated node-level HSO signals, and HSO-Gated Hyperbolic Graph Attention, which enables structure-aware message passing through feature-conditioned gating. Theoretically, we establish the monotonic sensitivity of edge-level HSO to degree imbalance and analyze the validity and radial scaling properties of node-adaptive hyperbolic mappings. Extensive experiments on eight benchmark datasets demonstrate that HSO-GAT consistently achieves state-of-the-art performance in both node classification and link prediction tasks.
Sources
- On the Hyperbolic Sombor Index and Its Counterpart
- M-polynomial Based Mathematical Formulation of the Hyperbolic Sombor Index
- Geometric Mixture-of-Experts with Curvature-Guided Adaptive Routing for Graph Representation Learning
- On Hyperbolic Sombor index of graphs
- Semi-Supervised Classification with Graph Convolutional Networks
- Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks
- Hyperbolic Heterogeneous Graph Transformer
- Pitfalls of Graph Neural Network Evaluation
- Graph Attention Networks
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks