Leveraging Manifold Embeddings for Enhanced Graph Transformer Representations and Learning
Not on the map. Why?
Abstract (arXiv)
Graph transformers typically embed every node in a single Euclidean space, blurring heterogeneous topologies. We prepend a lightweight Riemannian mixture-of-experts layer that routes each node to various kinds of manifold, mixture of spherical, flat, hyperbolic - best matching its local structure. These projections provide intrinsic geometric explanations to the latent space. Inserted into a state-of-the-art ensemble graph transformer, this projector lifts accuracy by up to 3% on four node-classification benchmarks. The ensemble makes sure that both euclidean and non-euclidean features are captured. Explicit, geometry-aware projection thus sharpens predictive power while making graph representations more interpretable.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 31 references that are in the map. First posted on arXiv 9 Jul 2025.
Builds on
24 of 31 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
- 2019Hyperbolic Graph Convolutional Neural Networkscited by 402
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
- 2018Riemannian Adaptive Optimization Methodscited by 194
- 2020Graph-Bert: Only Attention is Needed for Learning Graph Representationscited by 177
- 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 152
12 more
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 133
- 2019Constant Curvature Graph Convolutional Networkscited by 108
- 2021GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddingscited by 90
- 2023DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusioncited by 87
- 2024Position: Graph Foundation Models are Already Herecited by 86
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2021Lorentzian Graph Convolutional Networkscited by 68
- 2023Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modelingcited by 64
- 2021Pseudo-Riemannian Graph Convolutional Networkscited by 30
- 2024GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Expertscited by 24
- 2024Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learningcited by 23
- 2023GraphMETRO: Mitigating Complex Graph Distribution Shifts via Mixture of Aligned Expertscited by 19
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Geometric Mixture-of-Experts with Curvature-Guided Adaptive Routing for Graph Representation Learning
- 2025Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction
- 2022Spectral Maps for Learning on Subgraphs
- 2026DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation
- 2025Unifying and Enhancing Graph Transformers via a Hierarchical Mask Framework
- 2026DTA-GT: Direction- and Topology-Aware Graph Transformer for Neural Network Representation Learning
- 2024SGFormer: Single-Layer Graph Transformers with Approximation-Free Linear Complexity
- 2026Distilling Graph Geometry: Knowledge Gap from GNNs to MLPs