A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks
원문 초록
Hyperbolic neural networks can effectively capture the inherent hierarchy of graph datasets, and consequently a powerful choice of GNNs. However, they entangle multiple incongruent (gyro-)vector spaces within a layer, which makes them limited in terms of generalization and scalability. In this work, we propose the Poincare disk model as our search space, and apply all approximations on the disk (as if the disk is a tangent space derived from the origin), thus getting rid of all inter-space transformations. Such an approach enables us to propose a hyperbolic normalization layer and to further simplify the entire hyperbolic model to a Euclidean model cascaded with our hyperbolic normalization layer. We applied our proposed nonlinear hyperbolic normalization to the current state-of-the-art homogeneous and multi-relational graph networks. We demonstrate that our model not only leverages the power of Euclidean networks such as interpretability and efficient execution of various model components, but also outperforms both Euclidean and hyperbolic counterparts on various benchmarks. Our code is made publicly available at https://github.com/oom-debugger/ijcai23.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation Learning
MSGCN: Multiplex Spatial Graph Convolution Network for Interlayer Link Weight Prediction
Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Integrating Structural and Semantic Signals in Text-Attributed Graphs with BiGTex
토론
이 논문과 연결된 포럼 글이 아직 없습니다.