mlsanityData to 14 Oct 2026

X-LogSMask: Expand Transformer for Graph-Structured Data

arXiv 2607.01553 ↗First posted 2 Jul 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Transformers have become general-purpose architectures, but their all-to-all self-attention is poorly matched to graph data, whose interactions are sparse, structured and multi-scale. Existing Graph Transformers address this mismatch through structural encodings, hybrid message-passing modules or learned attention constraints, often introducing additional complexity and limited interpretability. Here we introduce X-LogSMask, an explainable multi-head logarithmic structural mask that injects symmetrically normalized graph topology directly into attention logits. The logarithmic transform converts structural connectivity into a topology-aware gating signal, suppressing unsupported node interactions while preserving feature-dependent attention. By assigning different powers of the normalized adjacency matrix to different attention heads, X-LogSMask gives each head a defined structural radius and supports multi-hop information propagation within a single layer. We further show that a standard Transformer encoder can be interpreted as one-step message passing on a complete graph, motivating X-LogSMask as a topology-constrained alternative to unrestricted self-attention. Across 20 node-, edge- and graph-level benchmarks, Transformers equipped with X-LogSMask achieve state-of-the-art performance on 13 datasets and remain competitive in a lightweight one-layer configuration. These results show that simple, interpretable structural masks can make self-attention an effective graph-learning operator without changing the Transformer architecture. The code is available at https://github.com/LiLeyan-0120/X-LogSMask.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 40 references that are in the map. First posted on arXiv 2 Jul 2026.

Builds on

36 of 40 references.

References · 36

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  5. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  6. 2017Graph Attention Networkscited by 8,923
  7. 2017Inductive Representation Learning on Large Graphscited by 6,320
  8. 2018How Powerful are Graph Neural Networks?cited by 4,393
  9. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
  10. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  11. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  12. 2018Link Prediction Based on Graph Neural Networkscited by 832
24 more
  1. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
  2. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  3. 2020A Generalization of Transformer Networks to Graphscited by 661
  4. 2021AST: Audio Spectrogram Transformercited by 643
  5. 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
  6. 2017Residual Gated Graph ConvNetscited by 346
  7. 2021Do Transformers Really Perform Bad for Graph Representation?cited by 320
  8. 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 260
  9. 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
  10. 2022Structure-Aware Transformer for Graph Representation Learningcited by 194
  11. 2023Exphormer: Sparse Transformers for Graphscited by 170
  12. 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
  13. 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 133
  14. 2021Accurate Learning of Graph Representations with Graph Multiset Poolingcited by 120
  15. 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 85
  16. 2019Graph Transformer for Graph-to-Sequence Learningcited by 82
  17. 2022Graph Neural Networks for Link Prediction with Subgraph Sketchingcited by 81
  18. 2022Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Predictioncited by 78
  19. 2024Polynormer: Polynomial-Expressive Graph Transformer in Linear Timecited by 65
  20. 2023Neural Common Neighbor with Completion for Link Predictioncited by 64
  21. 2023LPFormer: An Adaptive Graph Transformer for Link Predictioncited by 17
  22. 2023TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systemscited by 11
  23. 2024Gradformer: Graph Transformer with Exponential Decaycited by 11
  24. 2024Graph Transformers without Positional Encodingscited by 2

Built on by

Not cited yet.