Sign inGet started
Paper · arXiv

Cluster Attention for Graph Machine Learning

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...

AuthorsOleg Platonov, Liudmila Prokhorenkova
Primary categorycs.LG
Published8 April 2026
Last updated at source7 August 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/78d667af-943b-4b56-a406-3184a78afc85" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.