Cluster Attention for Graph Machine Learning
Not on the map. Why?
Abstract (arXiv)
Message Passing Neural Networks have recently become the most popular approach to graph machine learning tasks; however, their receptive field is limited by the number of message passing layers. To increase the receptive field, Graph Transformers with global attention have been proposed; however, global attention does not take into account the graph topology and thus lacks graph-structure-based inductive biases, which are typically very important for graph machine learning tasks. In this work, we propose an alternative approach: cluster attention (CLATT). We divide graph nodes into clusters with off-the-shelf graph community detection algorithms and let each node attend to all other nodes in each cluster. CLATT provides large receptive fields while still having strong graph-structure-based inductive biases. We show that augmenting Message Passing Neural Networks or Graph Transformers with CLATT significantly improves their performance on a wide range of graph datasets including datasets from the recently introduced GraphLand benchmark representing real-world applications of graph machine learning.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 43 of its 84 references that are in the map. First posted on arXiv 8 Apr 2026.
Builds on
43 of 84 references.
References · 43
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Layer Normalizationcited by 5,579
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
31 more
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020Benchmarking Graph Neural Networkscited by 672
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 326
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 207
- 2020Graph Clustering with Graph Neural Networkscited by 163
- 2020Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Modelscited by 116
- 2016Community detection in networks: A user guidecited by 105
- 2023Where Did the Gap Go? Reassessing the Long-Range Graph Benchmarkcited by 83
- 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 83
- 2018GEMSEC: Graph Embedding with Self Clusteringcited by 61
- 2022Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyondcited by 60
- 2025Position: Graph Learning Will Lose Relevance Due To Poor Benchmarkscited by 52
- 2014The structure and dynamics of multilayer networkscited by 51
- 2013Hierarchical Block Structures and High-resolution Model Selection in Large Networkscited by 37
- 2013Efficient Monte Carlo and greedy heuristic for the inference of stochastic block modelscited by 29
- 2025Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellencecited by 24
- 2024GraphLand: Evaluating Graph Machine Learning Models on Diverse Industrial Datacited by 20
- 2014Identification of core-periphery structure in networkscited by 11
- 2020Statistical inference of assortative community structurescited by 7
- 2025Improving the Effective Receptive Field of Message-Passing Neural Networkscited by 6
- 2018Community Detection through Likelihood Optimization: In Search of a Sound Modelcited by 4
- 2024Revisiting Graph Homophily Measurescited by 4
- 2026Bridging Academia and Industry: A Comprehensive Benchmark for Attributed Graph Clusteringcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.