Conference item
K-Maximum inner product attention for graph transformers and the expressive power of GraphGPS
- Abstract:
- Graph transformers have shown promise in overcoming limitations of traditional graph neural networks, such as oversquashing and difficulties in modelling longrange dependencies. However, their application to large-scale graphs is hindered by the quadratic memory and computational complexity of the all-to-all attention mechanism. Although alternatives such as linearized attention and restricted attention patterns have been proposed, these often degrade performance or limit expressive power. To better balance efficiency and effectiveness, we introduce k-Maximum Inner Product (k-MIP) attention for graph transformers. k-MIP attention selects the most relevant key nodes per query via a top-k operation, yielding a sparse yet flexible attention pattern. Combined with an attention score computation based on symbolic matrices, this results in linear memory complexity and practical speedups of up to an order of magnitude compared to all-to-all attention, enabling the processing of graphs with over 500k nodes on a single A100 GPU. We provide a theoretical analysis of expressive power, showing that k-MIP attention does not compromise the expressiveness of graph transformers: specifically, we prove that k-MIP transformers can approximate any full-attention transformer to arbitrary precision. In addition, we analyze the expressive power of the GraphGPS framework, in which we integrate our attention mechanism, and establish an upper bound on its graph distinguishing capability in terms of the S-SEG-WL test. Finally, we validate our approach on the Long Range Graph Benchmark, the City-Networks benchmark, and two custom large-scale inductive point cloud datasets, consistently ranking among the top-performing scalable graph transformers.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 1.1MB, Terms of use)
-
- Publication website:
- https://iclr.cc/virtual/2026/10012813
Authors
- Host title:
- International Conference on Learning Representations 2026
- Publication date:
- 2026-04-26
- Acceptance date:
- 2026-03-02
- Event title:
- Workshop on Geometry-grounded Representation Learning and Generative Modeling (GRaM Workshop @ ICLR 2026)
- Event location:
- Rio de Janeiro, Brazil
- Event website:
- https://iclr.cc/virtual/2026/workshop/10000809
- Event start date:
- 2026-04-26
- Event end date:
- 2026-04-26
- Language:
-
English
- Pubs id:
-
2426920
- Local pid:
-
pubs:2426920
- Deposit date:
-
2026-05-30
- ARK identifier:
Terms of use
- Copyright date:
- 2026
- Notes:
- The author accepted manuscript (AAM) of this paper has been made available under the University of Oxford's Open Access Publications Policy, and a CC BY public copyright licence has been applied.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record