mlsanityData to 7 Oct 2026

Less is More: on the Over-Globalizing Problem in Graph Transformers

arXiv 2405.01102 ↗First posted 2 May 2024cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Graph Transformer, due to its global attention mechanism, has emerged as a new tool in dealing with graph-structured data. It is well recognized that the global attention mechanism considers a wider receptive field in a fully connected graph, leading many to believe that useful information can be extracted from all the nodes. In this paper, we challenge this belief: does the globalizing property always benefit Graph Transformers? We reveal the over-globalizing problem in Graph Transformer by presenting both empirical evidence and theoretical analysis, i.e., the current attention mechanism overly focuses on those distant nodes, while the near nodes, which actually contain most of the useful information, are relatively weakened. Then we propose a novel Bi-Level Global Graph Transformer with Collaborative Training (CoBFormer), including the inter-cluster and intra-cluster Transformers, to prevent the over-globalizing problem while keeping the ability to extract valuable information from distant nodes. Moreover, the collaborative training is proposed to improve the model's generalization ability with a theoretical guarantee. Extensive experiments on various graphs well validate the effectiveness of our proposed CoBFormer.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 2 May 2024.

Builds on

28 of 44 references.

References · 28

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  5. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  6. 2017Graph Attention Networkscited by 8,854
  7. 2017Inductive Representation Learning on Large Graphscited by 6,284
  8. 2016Layer Normalizationcited by 5,579
  9. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  10. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  11. 2020Rethinking Attention with Performerscited by 1,584
  12. 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
16 more
  1. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  2. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
  3. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
  4. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  5. 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
  6. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
  7. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
  8. 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 207
  9. 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 193
  10. 2016How to learn a graph from smooth signalscited by 146
  11. 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 131
  12. 2021New Benchmarks for Learning on Non-Homophilous Graphscited by 81
  13. 2022Expander Graph Propagationcited by 75
  14. 2022Hierarchical Graph Transformer with Adaptive Node Samplingcited by 72
  15. 2021Gophormer: Ego-Graph Transformer for Node Classificationcited by 63
  16. 2019Graph Neural Networks Exponentially Lose Expressive Power for Node Classificationcited by 16

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.