Riemannian Graph Tokenizer for Structural Knowledge Transfer
Qimin Zhou, Haibo Liu, Yujie Wang, Li Sun, Chuan Shi
Abstract
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 manifoldspecific 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. CCS Concepts • Computing methodologies → Knowledge representation and reasoning; • Theory of computation → Computational geometry.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1ea4cc7e-17fa-4259-b30d-3e200cacd257Builds on27
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- VisionLLM: Large Language Model is also an Open-Ended Decoder for Vision-Centric TasksWenhai Wang, Zhe Chen, Xiaokang Chen, Jiannan Wu et al.NeurIPS 2023 · 725 citations
- Understanding over-squashing and bottlenecks on graphs via curvatureJake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain, Xiaowen Dong et al.ICLR 2022 · 628 citations
- One For All: Towards Training One Graph Model For All Classification TasksHao Liu, Jiarui Feng, Lecheng Kong, Ningyue Liang et al.ICLR 2024 · 253 citations
- GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph LearnerZhenyu Hou, Yufei He, Yukuo Cen, Xiao Liu et al.WWW 2023 · 183 citations
Related papers
- RiemannGFM: Learning a Graph Foundation Model from Riemannian GeometryLi Sun, Zhenhao Huang, Suyang Zhou, Qiqi Wan et al.WWW 2025 · 31 citations
- Multi-Domain Riemannian Graph Gluing for Building Graph Foundation ModelsLi Sun, Zhenhao Huang, Silei Chen, Lanxu Yang et al.ICLR 2026 · 5 citations
- GFT: Graph Foundation Model with Transferable Tree VocabularyZehong Wang, Zheyuan Zhang, Nitesh V. Chawla, Chuxu Zhang et al.NeurIPS 2024 · 108 citations
- Learning Graph Foundation Models on Riemannian Graph-of-GraphsHaokun Liu, Zezhong Ding, Xike XieICML 2026
- Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector BundlesLi Sun, Zhenhao Huang, Yiding Wang, Qin Chen et al.ICML 2026
