mlsanityData to 14 Oct 2026

Riemannian Graph Tokenizer for Structural Knowledge Transfer

arXiv 2610.15427 ↗First posted 11 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Foundation models are at the forefront of artificial intelligence. A tokenizer, converting the raw input into discrete representations that the model can understand, plays an important role to the success of foundation models. Unlike the text tokenizer that is well studied in large language models, graph tokenizer is still at its early stage, facing the challenges of tackling the non-Euclidean structures and capturing the structural semantics. How to design a graph tokenizer for structural knowledge transfer? To this end, we propose a Riemannian Graph Tokenizer (RGT) that bridges the structural knowledge and quantized representations to support cross-domain structural knowledge transfer. The connection is established by Riemannian geometry. Specifically, we first define the geometric vocabulary (trees, cycles and sequences), which captures fundamental structural patterns and reflects the intrinsic geometry of graph. Second, we construct a Riemannian quantizer with Riemannian Straight-Through Estimator to tokenise graph structures across multiple domains into discrete tokens. To ensure consistency and transferability across diverse geometric spaces, RGT further incorporates a geometry-aligned decoder that projects manifold-specific tokens into a unified tangent space. The theoretical analysis and geometric interpretations are provided to support the effectiveness of our proposed method. Extensive experiments across diverse datasets demonstrate that RGT significantly enhances structural knowledge transferability across graph domains.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 47 of its 60 references that are in the map. First posted on arXiv 11 Oct 2026.

Builds on

47 of 60 references.

References · 47

  1. 2017Graph Attention Networkscited by 8,923
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2017Neural Discrete Representation Learningcited by 4,712
  4. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  7. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
  8. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
  9. 2023A Survey on Evaluation of Large Language Modelscited by 1,242
  10. 2018Deep Graph Infomaxcited by 1,106
  11. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  12. 2021SoundStream: An End-to-End Neural Audio Codeccited by 771
35 more
  1. 2019Multi-scale Attributed Node Embeddingcited by 548
  2. 2023VisionLLM: Large Language Model is also an Open-Ended Decoder for Vision-Centric Taskscited by 501
  3. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
  4. 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
  5. 2017struc2vec: Learning Node Representations from Structural Identitycited by 215
  6. 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 192
  7. 2021Graph Learning: A Surveycited by 141
  8. 2023GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learnercited by 132
  9. 2019Constant Curvature Graph Convolutional Networkscited by 108
  10. 2023Graph Foundation Models: Concepts, Opportunities and Challengescited by 103
  11. 2024Position: Graph Foundation Models are Already Herecited by 86
  12. 2024All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretrainingcited by 86
  13. 2024ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphscited by 85
  14. 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 85
  15. 2023Straightening Out the Straight-Through Estimator: Overcoming Optimization Challenges in Vector Quantized Networkscited by 82
  16. 2024OpenGraph: Towards Open Graph Foundation Modelscited by 78
  17. 2021Lorentzian Graph Convolutional Networkscited by 68
  18. 2020Differentiating through the Fr'echet Meancited by 53
  19. 2024Restructuring Vector Quantization with the Rotation Trickcited by 51
  20. 2022Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networkscited by 41
  21. 2024Fully-inductive Node Classification on Arbitrary Graphscited by 39
  22. 2023VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPscited by 35
  23. 2025RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometrycited by 35
  24. 2021A Self-supervised Mixed-curvature Graph Neural Networkcited by 33
  25. 2023HetGPT: Harnessing the Power of Prompt Tuning in Pre-Trained Heterogeneous Graph Neural Networkscited by 33
  26. 2024GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Expertscited by 24
  27. 2024Can Large Language Models Improve the Adversarial Robustness of Graph Neural Networks?cited by 23
  28. 2024LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clusteringcited by 21
  29. 2023Federated Heterogeneous Graph Neural Network for Privacy-preserving Recommendationcited by 19
  30. 2025Position: Beyond Euclidean -- Foundation Models Should Embrace Non-Euclidean Geometriescited by 18
  31. 2024DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashingcited by 16
  32. 2024Spiking Graph Neural Network on Riemannian Manifoldscited by 16
  33. 2025Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation Modelscited by 7
  34. 2025Graph Foundation Models for Recommendation: A Comprehensive Surveycited by 4
  35. 2024All in One: Multi-Task Prompting for Graph Neural Networks (Extended Abstract)cited by 3

Built on by

Not cited yet.