mlsanityData to 7 Oct 2026

Topology-Informed Graph Transformer

arXiv 2402.02005 ↗First posted 3 Feb 2024cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Transformers have revolutionized performance in Natural Language Processing and Vision, paving the way for their integration with Graph Neural Networks (GNNs). One key challenge in enhancing graph transformers is strengthening the discriminative power of distinguishing isomorphisms of graphs, which plays a crucial role in boosting their predictive performances. To address this challenge, we introduce 'Topology-Informed Graph Transformer (TIGT)', a novel transformer enhancing both discriminative power in detecting graph isomorphisms and the overall performance of Graph Transformers. TIGT consists of four components: A topological positional embedding layer using non-isomorphic universal covers based on cyclic subgraphs of graphs to ensure unique graph representation: A dual-path message-passing layer to explicitly encode topological characteristics throughout the encoder layers: A global attention mechanism: And a graph information layer to recalibrate channel-wise graph features for better feature representation. TIGT outperforms previous Graph Transformers in classifying synthetic dataset aimed at distinguishing isomorphism classes of graphs. Additionally, mathematical analysis and empirical evaluations highlight our model's competitive edge over state-of-the-art Graph Transformers across various benchmark datasets.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 29 of its 44 references that are in the map. First posted on arXiv 3 Feb 2024.

Builds on

29 of 44 references.

References · 29

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  5. 2017Squeeze-and-Excitation Networkscited by 4,763
  6. 2018How Powerful are Graph Neural Networks?cited by 4,355
  7. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  8. 2019Strategies for Pre-training Graph Neural Networkscited by 964
  9. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
  10. 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
  11. 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
  12. 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
17 more
  1. 2017Residual Gated Graph ConvNetscited by 341
  2. 2021Do Transformers Really Perform Bad for Graph Representation?cited by 318
  3. 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
  4. 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 286
  5. 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
  6. 2021ViTAE: Vision Transformer Advanced by Exploring Intrinsic Inductive Biascited by 216
  7. 2022Structure-Aware Transformer for Graph Representation Learningcited by 191
  8. 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
  9. 2019Relational Pooling for Graph Representationscited by 150
  10. 2021GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graphcited by 143
  11. 2019PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signaturescited by 125
  12. 2023Rethinking the Expressive Power of GNNs via Graph Biconnectivitycited by 119
  13. 2021Global Self-Attention as a Replacement for Graph Convolutioncited by 113
  14. 2022Hierarchical Graph Transformer with Adaptive Node Samplingcited by 72
  15. 2021Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passingcited by 46
  16. 2023Graph Transformer for Recommendationcited by 28
  17. 2022The PWLR Graph Representation: A Persistent Weisfeiler-Lehman scheme with Random Walks for Graph Classificationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 7; 2026: 4.

13 papers.

Sort:

By area: