Pith. sign in

REVIEW 3 cited by

Learning Graph Quantized Tokenizers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.13798 v2 pith:CA7RZQ3O submitted 2024-10-17 cs.NE cs.AIcs.LG

Learning Graph Quantized Tokenizers

classification cs.NE cs.AIcs.LG
keywords graphlearningtextbftokenizersmodelstokenstrainingtransformer
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Transformers serve as the backbone architectures of Foundational Models, where domain-specific tokenizers allow them to adapt to various domains. Graph Transformers (GTs) have recently emerged as leading models in geometric deep learning, outperforming Graph Neural Networks (GNNs) in various graph learning tasks. However, the development of tokenizers for graphs has lagged behind other modalities. To address this, we introduce GQT (\textbf{G}raph \textbf{Q}uantized \textbf{T}okenizer), which decouples tokenizer training from Transformer training by leveraging multi-task graph self-supervised learning, yielding robust and generalizable graph tokens. Furthermore, the GQT utilizes Residual Vector Quantization (RVQ) to learn hierarchical discrete tokens, resulting in significantly reduced memory requirements and improved generalization capabilities. By combining the GQT with token modulation, a Transformer encoder achieves state-of-the-art performance on 20 out of 22 benchmarks, including large-scale homophilic and heterophilic datasets.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. KoRe: Compact Knowledge Representations for Large Language Models

    cs.CL 2026-05 unverdicted novelty 6.0

    KoRe encodes 1-hop knowledge graph subgraphs as compact discrete tokens for injection into LLMs, achieving competitive benchmark performance with up to 10x token reduction.

  2. KoRe: Compact Knowledge Representations for Large Language Models

    cs.CL 2026-05 conditional novelty 6.0

    KoRe compresses one-hop knowledge-graph subgraphs into 20 discrete tokens that, injected into Qwen3-8B, match or beat text-based knowledge injection on three QA benchmarks while using up to 10x fewer tokens.

  3. VesselTok: Tokenizing Vessel-like 3D Biomedical Graph Representations for Reconstruction and Generation

    cs.CV 2026-03 conditional novelty 6.0

    VesselTok learns compact continuous tokens of large tubular biomedical graphs from centerline points plus a fixed pseudo-radius, enabling reconstruction, generation, and link prediction across anatomies.