LGJan 27, 2023

On the Connection Between MPNN and Graph Transformer

arXiv:2301.11956v486 citationsh-index: 45
Originality Incremental advance
AI Analysis

This work provides theoretical insights into the equivalence between MPNN and GT, which is significant for researchers in graph learning, though it is incremental as it builds on prior connections.

The paper tackles the theoretical connection between Message Passing Neural Networks (MPNN) with virtual nodes and Graph Transformers (GT), showing that MPNN with virtual nodes can arbitrarily approximate GT self-attention layers under certain conditions. Empirically, it demonstrates that MPNN with virtual nodes outperforms GT on the Long Range Graph Benchmark dataset, improves over early implementations on OGB datasets, and beats Linear Transformer and MPNN on a climate modeling task.

Graph Transformer (GT) recently has emerged as a new paradigm of graph learning algorithms, outperforming the previously popular Message Passing Neural Network (MPNN) on multiple benchmarks. Previous work (Kim et al., 2022) shows that with proper position embedding, GT can approximate MPNN arbitrarily well, implying that GT is at least as powerful as MPNN. In this paper, we study the inverse connection and show that MPNN with virtual node (VN), a commonly used heuristic with little theoretical understanding, is powerful enough to arbitrarily approximate the self-attention layer of GT. In particular, we first show that if we consider one type of linear transformer, the so-called Performer/Linear Transformer (Choromanski et al., 2020; Katharopoulos et al., 2020), then MPNN + VN with only O(1) depth and O(1) width can approximate a self-attention layer in Performer/Linear Transformer. Next, via a connection between MPNN + VN and DeepSets, we prove the MPNN + VN with O(n^d) width and O(1) depth can approximate the self-attention layer arbitrarily well, where d is the input feature dimension. Lastly, under some assumptions, we provide an explicit construction of MPNN + VN with O(1) width and O(n) depth approximating the self-attention layer in GT arbitrarily well. On the empirical side, we demonstrate that 1) MPNN + VN is a surprisingly strong baseline, outperforming GT on the recently proposed Long Range Graph Benchmark (LRGB) dataset, 2) our MPNN + VN improves over early implementation on a wide range of OGB datasets and 3) MPNN + VN outperforms Linear Transformer and MPNN on the climate modeling task.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes