2020
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
NeurIPS 2020poster
Graph kernels based on the $1$-dimensional Weisfeiler-Leman algorithm and corresponding neural architectures recently emerged as powerful tools for (supervised) learning with graphs. However, due to the purely local nature of the algorithms, they might miss essential patterns in the given data and c…