January 18, 2023

A Generalization Of ViT/MLP-Mixer to Graphs

Xiaoxin He1 Bryan Hooi1 Thomas Laurent2 Adam Perold3 Yann LeCun4.5 Xavier Bresson1
{xiaoxin, bhooi, xaviercs}@comp.nus.edu.sg, tlauren@lmu.edu, ap@discoverelement.com, yann@cs.nyu.edu
1National University of Singapore 2Loyola Marymount University 3Element, Inc. 4New York University 5Meta AI

Abstract: Graph Neural Networks (GNNs) have shown great potential in the field of graph representation learning. Standard GNNs define a local message-passing mechanism which propagates information over the whole graph domain by stacking multiple layers. This paradigm suffers from two major limitations, over-squashing and poor long-range dependencies, that can be solved using global attention but significantly increases the computational cost to quadratic complexity.

In this work, we propose an alternative approach to overcome these structural limitations by leveraging the ViT/MLP-Mixer architectures introduced in computer vision. We introduce a new class of GNNs, called Graph MLP-Mixer, that holds three key properties. First, they capture long-range dependency and mitigate the issue of over-squashing as demonstrated on the Long Range Graph Benchmark (LRGB) and the TreeNeighbourMatch datasets. Second, they offer better speed and memory efficiency with a complexity linear to the number of nodes and edges, surpassing the related Graph Transformer and expressive GNN models. Third, they show high expressivity in terms of graph isomorphism as they can distinguish at least 3-WL non-isomorphic graphs. We test our architecture on 4 simulated datasets and 7 real-world benchmarks, and show highly competitive results on all of them.

A Generalization Of ViT/MLP-Mixer to Graphs

Access the full paper at https://arxiv.org/abs/2212.13350