mlsanityData to 14 Oct 2026

Tokenphormer: Structure-aware Multi-token Graph Transformer for Node Classification

arXiv 2412.15302 ↗First posted 19 Dec 2024cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) are widely used in graph data mining tasks. Traditional GNNs follow a message passing scheme that can effectively utilize local and structural information. However, the phenomena of over-smoothing and over-squashing limit the receptive field in message passing processes. Graph Transformers were introduced to address these issues, achieving a global receptive field but suffering from the noise of irrelevant nodes and loss of structural information. Therefore, drawing inspiration from fine-grained token-based representation learning in Natural Language Processing (NLP), we propose the Structure-aware Multi-token Graph Transformer (Tokenphormer), which generates multiple tokens to effectively capture local and structural information and explore global information at different levels of granularity. Specifically, we first introduce the walk-token generated by mixed walks consisting of four walk types to explore the graph and capture structure and contextual information flexibly. To ensure local and global information coverage, we also introduce the SGPM-token (obtained through the Self-supervised Graph Pre-train Model, SGPM) and the hop-token, extending the length and density limit of the walk-token, respectively. Finally, these expressive tokens are fed into the Transformer model to learn node representations collaboratively. Experimental results demonstrate that the capability of the proposed Tokenphormer can achieve state-of-the-art performance on node classification tasks.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 43 references that are in the map. First posted on arXiv 19 Dec 2024.

Builds on

26 of 43 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2017Inductive Representation Learning on Large Graphscited by 6,320
  5. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  6. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  7. 2015Multi-Scale Context Aggregation by Dilated Convolutionscited by 1,133
  8. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  9. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
  10. 2021How Attentive are Graph Attention Networks?cited by 835
  11. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  12. 2020A Generalization of Transformer Networks to Graphscited by 661
14 more
  1. 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
  2. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  3. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  4. 2019Graph Transformer Networkscited by 523
  5. 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
  6. 2021Graph Neural Network-Based Anomaly Detection in Multivariate Time Seriescited by 301
  7. 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 195
  8. 2020Graph-Bert: Only Attention is Needed for Learning Graph Representationscited by 177
  9. 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
  10. 2021Position Information in Transformers: An Overviewcited by 103
  11. 2022Hierarchical Graph Transformer with Adaptive Node Samplingcited by 72
  12. 2020Tackling Over-Smoothing for General Graph Convolutional Networkscited by 66
  13. 2021Gophormer: Ego-Graph Transformer for Node Classificationcited by 63
  14. 2022GRAND+: Scalable Graph Random Neural Networkscited by 25

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.