Skip to content

HyPE-GT: where Graph Transformers meet Hyperbolic Positional Encodings

Dec 2023 · arXiv.org · Vol abs/2312.06576 · 2 citations · 48 references
Computer Science

TL;DR

Comprehensive experiments on four molecular benchmarks, including the four large-scale Open Graph Benchmark datasets, substantiate the effectiveness of hyperbolic positional encodings in enhancing the performance of Graph Transformers and provide extensive theoretical underpinnings to offer insights into the working mechanism of the HyPE framework.

Abstract

Graph Transformers (GTs) facilitate the comprehension of complex relationships on graph-structured data by leveraging self-attention of the possible pairs of nodes. The structural information or inductive bias of the input graph is provided as positional encodings to the GT. The positional encodings are mostly Euclidean and are not able to capture the complex hierarchical relationships of the corresponding nodes. To address the limitation, we introduce a novel and efficient framework, HyPE, that generates learnable positional encodings in the non-Euclidean hyperbolic space that capture the intricate hierarchical relationships of the underlying graphs. Unlike existing methods, HyPE can generate a set of hyperbolic positional encodings, empowering us to explore diverse options for the optimal selection of PEs for specific downstream tasks. Additionally, we repurpose the generated hyperbolic positional encodings to mitigate the impact of oversmoothing in deep Graph Neural Networks (GNNs). Furthermore, we provide extensive theoretical underpinnings to offer insights into the working mechanism of the HyPE framework. Comprehensive experiments on four molecular benchmarks, including the four large-scale Open Graph Benchmark (OGB) datasets, substantiate the effectiveness of hyperbolic positional encodings in enhancing the performance of Graph Transformers. We also consider Coauthor and Copurchase networks to establish the efficacy of HyPE in controlling oversmoothing in deep GNNs.

View source

Similar papers

Jul 2026

TopoFormer: Topology Meets Attention for Graph Learning

This work introduces Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences by decomposing a graph into a short, ordered sequence of topological tokens by slicing over node or edge filtrations.

Md Joshem Uddin, Astrit Tola, C. Akcora et al. · 1 citation
#machine learning Preprint Aug 2026

HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models

HOPPER is introduced, an end-to-end learnable extension of LGSM that learns how hop sequences should be extracted before processing by a modern state-space model, and demonstrates that learnable sequence extraction is a flexible and effective framework for long-range graph representation learning across synthetic, phys...

Isuru Herath, Arin Gopakumar, Sharan Sahu · 0 citations
Conference Open access Sep 2026

ADC-GNN: Adaptive Dual-level Collaborative Graph Neural Networks for Graph Classification

This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.

Wan Tang, Lu Bai, Li-Xin Cui et al. · 0 citations
Jul 2026

CondPSE: A Polynomial-Filtered Structural Encoder with Conditional Modulation for Graphs

CondPSE, a learned PSE encoder that applies a learnable polynomial graph filter bank to standard Gaussian node probes and refines the resulting structural-response branches through FiLM-style modulation conditioned on cross-filter, local message-passing, and graph-level signals, is presented.

Woohyung Lee, Hogun Park · 0 citations
Preprint Aug 2026

Differentiable Lifting for Topological Neural Networks

This work proposes $\partial$lift (DiffLift), a general framework for learning graph liftings to hypergraphs and cellular- and simplicial complexes in an end-to-end fashion and shows that $\partial$lift outperforms existing lifting methods on multiple benchmarks for graph and node classification across different TNN ar...

J. L. Franco, Gabriel Duarte, Alexander Nikitin et al. · 2 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.