Papers › Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing
Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing
Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
We propose CRaWl, a novel neural network architecture for graph learning. Like graph neural networks, CRaWl layers update node features on a graph and thus can freely be combined or interleaved with GNN layers. Yet CRaWl operates fundamentally different from message passing graph neural networks. CRaWl layers extract and aggregate information on subgraphs appearing along random walks through a graph using 1D Convolutions. Thereby it detects long range interactions and computes non-local features. As the theoretical basis for our approach, we prove a theorem stating that the expressiveness of CRaWl is incomparable with that of the Weisfeiler Leman algorithm and hence with graph neural networks. That is, there are functions expressible by CRaWl, but not by GNNs and vice versa. This result extends to higher levels of the Weisfeiler Leman hierarchy and thus to higher-order GNNs. Empirically, we show that CRaWl matches state-of-the-art GNN architectures across a multitude of benchmark datasets for classification and regression on graphs.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Graph Classification | REDDIT-B | CRaWl | Accuracy | 93.15 | #1 of 12 | Archive leaderboard | report |
| Graph Property Prediction | ogbg-molpcba | CRaWl | Ext. data | No | #13 of 36 | Archive leaderboard | report |
| Graph Property Prediction | ogbg-molpcba | CRaWl | Number of params | 6115728 | #13 of 36 | Archive leaderboard | report |
| Graph Property Prediction | ogbg-molpcba | CRaWl | Test AP | 0.2986 ± 0.0025 | #13 of 36 | Archive leaderboard | report |
| Graph Property Prediction | ogbg-molpcba | CRaWl | Validation AP | 0.3075 ± 0.0020 | #13 of 36 | Archive leaderboard | report |
| Graph Regression | ZINC | CRaWl+VN | MAE | 0.088 | #17 of 27 | Archive leaderboard | report |
| Graph Regression | ZINC | CRaWl | MAE | 0.101 | #21 of 27 | Archive leaderboard | report |
| Graph Regression | ZINC-500k | CRaWl+VN | MAE | 0.088 | #17 of 36 | Archive leaderboard | report |
| Graph Regression | ZINC-500k | CRaWl | MAE | 0.101 | #21 of 36 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections