Towards Principled Graph Transformers

Luis Müller, Christopher Morris
2/3/2026

No official code found. Best implementation: luis-mueller/towards-principled-gts (13 stars, MIT, last commit 2024-10-30).

Abstract

Graph learning architectures based on the k-dimensional Weisfeiler-Leman (k-WL) hierarchy offer a theoretically well-understood expressive power. However, such architectures often fail to deliver solid predictive performance on real-world tasks, limiting their practical impact. In contrast, global attention-based models such as graph transformers demonstrate strong performance in practice, but comparing their expressive power with the k-WL hierarchy remains challenging, particularly since these architectures rely on positional or structural encodings for their expressivity and predictive performance. To address this, we show that the recently proposed Edge Transformer, a global attention model operating on node pairs instead of nodes, has at least 3-WL expressive power. Empirically, we demonstrate that the Edge Transformer surpasses other theoretically aligned architectures regarding predictive performance while not relying on positional or structural encodings. Our code is available at https://github.com/luis-mueller/towards-principled-gts

View on arXivView PDF

Code Implementations(1)

MIT

Code for our paper "Towards Principled Graph Transformers"

130PythonFeb 6, 20241 years agoMIT

Similar Papers

Cite this paper

@article{mller2026towards,
  title  = {Towards Principled Graph Transformers},
  author = {Luis Müller and Christopher Morris},
  year   = {2026},
  eprint = {2401.10119},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2401.10119},
  url    = {https://arxiv.org/abs/2401.10119},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.10119.svg)](https://codeofpaper.com/paper/2401.10119)

Discussion