Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion
Abstract
Graph Representation Learning (GRL) can be fundamentally modeled as a physical process of seeking an energy equilibrium state for a node system on a latent manifold. However, existing Graph Neural Networks (GNNs) often suffer from uncontrolled energy dissipation during message passing, driving the system towards a state of Thermal Death—manifested as feature collapse or over-smoothing—due to the absence of explicit thermodynamic constraints. To address this, we propose HyperGRL, a thermodynamics-driven framework that embeds nodes on a unit hypersphere by minimizing a Helmholtz free energy objective composed of two competing potentials. First, we introduce Structural Binding Energy (via Neighbor-Mean Alignment), which functions as a local binding force to strengthen structural cohesion, encouraging structurally related nodes to form compact local clusters. Second, to counteract representation collapse, we impose a Mean-Field Repulsive Potential (via Sampling-Free Uniformity), which acts as a global entropic force to maximize representation dispersion without the need for negative sampling. Crucially, to govern the trade-off between local alignment and global uniformity, we devise an Adaptive Thermostat. This entropy-guided strategy dynamically regulates the system's ``temperature'' during training, guiding the representation towards a robust metastable state that balances local cohesion with global discriminability. Extensive experiments on node classification, node clustering, and link prediction show that HyperGRL consistently achieves strong performance across diverse benchmark datasets, yielding more discriminative and robust representations while alleviating over-smoothing.
Benchmark Results
Tested on 2 datasets 15 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | |
| 89 | HyperGRL | 0.9424
±0.0002 | This paper |
| 103 | SGRL | 0.9395
±0.0003 | prev best: Learn Beneficial Noise as Graph Augmentation (ICML 2025) |
| 105 | Str-GCL | 0.9390
±0.0026 | This paper |
| 155 | PaGCL | 0.9349
±0.0031 | This paper |
| 157 | SGCL | 0.9346
±0.0030 | This paper |
| 172 | BGRL | 0.9337
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) |
| 186 | CCA-SSG | 0.9325
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 191 | GCA | 0.9320
±0.0060 best reported | best at pub: Unifying Graph Contrastive Learning with Flexible Contextual Scopes (2022) best today: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 194 | SUGRL | 0.9320
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Difference within reported uncertainty; not counted as underperformance. |
| 203 | GRACE | 0.9313
±0.0017 best reported | best at pub: Learn Beneficial Noise as Graph Augmentation (ICML 2025) |
| 206 | MVGRL | 0.9310
±0.0040 best reported | best at pub: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 213 | DGI | 0.9309
±0.0008 best reported | |
| 317 | VGAE | 0.9224 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) Difference within reported uncertainty; not counted as underperformance. |
| 390 | MLP | 0.9128
±0.0063 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 408 | GMI | 0.9081
±0.0015 | prev best: Localized Graph Contrastive Learning (2022) Improvement within reported uncertainty; not highlighted. |
| 444 | DeepWalk | 0.9005
±0.0008 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) |
| 457 | Node2Vec | 0.8970
±0.0010 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: Multiplex Graph Contrastive Learning with Soft Negatives (2024) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GCN | 0.9302
±0.0011 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) |
| 2 | RSE + RGCN (70b) | 0.8852
±0.0019 | |
| 3 | LEMP+T | 0.8825 | |
| 9 | SAGE | 0.8771 | |
| 31 | GAT | 0.8533 best reported | |
| 65 | HyperGRL | 0.8188
±0.0015 | This paper |
| 66 | Transformer | 0.8188
±0.0015 | prev best: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 69 | GraphSAGE | 0.8146
±0.0010 | |
| 87 | PaGCL | 0.8045
±0.0051 | This paper |
| 94 | GRACE | 0.8014
±0.0048 best reported | best at pub: Large-Scale Representation Learning on Graphs via Bootstrapping (ICLR 2021) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 100 | BGRL | 0.8000
±0.0010 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) |
| 103 | SGCL | 0.7985
±0.0053 | This paper |
| 115 | SGRL | 0.7940
±0.0010 | This paper |
| 130 | CCA-SSG | 0.7908
±0.0053 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) best today: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) |
| 138 | SUGRL | 0.7897
±0.0022 best reported | best at pub: Graph Soft-Contrastive Learning via Neighborhood Ranking (2022) best today: Rethinking Graph Contrastive Learning through Relative Similarity Preservation (IJCAI 2025) Difference within reported uncertainty; not counted as underperformance. |
| 151 | DGI | 0.7865
±0.0690 best reported | best at pub: Quantizing Text-attributed Graphs for Semantic-Structural Integration (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 162 | GCA | 0.7840
±0.0013 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) Difference within reported uncertainty; not counted as underperformance. |
| 180 | VGAE | 0.7787
±0.0053 best reported | best at pub: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 190 | MVGRL | 0.7757
±0.0046 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) best today: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Difference within reported uncertainty; not counted as underperformance. |
| 198 | DeepWalk | 0.7721 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) |
| 234 | GMI | 0.7490
±0.0010 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) Difference within reported uncertainty; not counted as underperformance. |
| 237 | MLP | 0.7469
±0.0085 best reported | best at pub: View Space: Learning Representation across Arbitrary Graphs (ICML 2025) |
| 258 | Node2Vec | 0.7180
±0.0010 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) Difference within reported uncertainty; not counted as underperformance. |
