Towards Principled Graph Transformers
Luis Müller, Daniel Kusuma, Blai Bonet, Christopher Morris
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
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d1b87ec1-a21b-4d3c-9ce0-bbf1251a8cbcCited by top-tier papers7
- Probabilistic Graph Rewiring via Virtual NodesChendi Qian, Andrei Manolache, Christopher Morris, Mathias NiepertNeurIPS 2024 · 24 citations
- From Sequence to Structure: Uncovering Substructure Reasoning in TransformersXinnan Dai, Kai Yang, Jay Revolinsky, Kai Guo et al.NeurIPS 2025 · 3 citations
- Generalizable Insights for Graph Transformers in Theory and PracticeTimo Stoll, Luis Müller, Christopher MorrisNeurIPS 2025 · 2 citations
- On the Expressive Power of GNNs to Solve Linear SDPsChendi Qian, Christopher MorrisICML 2026 · 1 citation
- Random Search Neural Networks for Efficient and Expressive Graph LearningMichael Ito, Danai Koutra, Jenna WiensNeurIPS 2025 · 1 citation
Builds on23
- FlashAttention: Fast and Memory-Efficient Exact Attention with IO-AwarenessTri Dao, Daniel Y. Fu, Stefano Ermon, Atri Rudra et al.NeurIPS 2022 · 5,493 citations
- Do Transformers Really Perform Badly for Graph Representation?Chengxuan Ying, Tianle Cai, Shengjie Luo, Shuxin Zheng et al.NeurIPS 2021 · 1,632 citations
- Recipe for a General, Powerful, Scalable Graph TransformerLadislav Rampásek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu et al.NeurIPS 2022 · 1,216 citations
- Faith and Fate: Limits of Transformers on CompositionalityNouha Dziri, Ximing Lu, Melanie Sclar, Xiang Lorraine Li et al.NeurIPS 2023 · 728 citations
- Graph Neural Networks with Learnable Structural and Positional RepresentationsVijay Prakash Dwivedi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio et al.ICLR 2022 · 464 citations
Related papers
- Aligning Transformers with Weisfeiler-LemanLuis Müller, Christopher MorrisICML 2024 · 7 citations
- On Structural Expressive Power of Graph TransformersWenhao Zhu, Tianyu Wen, Guojie Song, Liang Wang et al.KDD 2023 · 9 citations
- 𝒩-WL: A New Hierarchy of Expressivity for Graph Neural NetworksQing Wang, Dillon Ze Chen, Asiri Wijesinghe, Shouheng Li et al.ICLR 2023
- Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-Based SimilarityVan Thuy Hoang, O-Joun LeeAAAI 2024 · 7 citations
- Improving the Expressiveness of K-hop Message-Passing GNNs by Injecting Contextualized Substructure InformationTianjun Yao, Yingxu Wang, Kun Zhang, Shangsong LiangKDD 2023 · 8 citations
