Weisfeiler and Leman go Machine Learning: The Story so far
In recent years, algorithms and neural architectures based on the Weisfeiler--Leman algorithm, a well-known heuristic for the graph isomorphism problem, have emerged as a powerful tool for machine learning with graphs and relational data. Here, we give a comprehensive overview of the algorithm's use in a machine-learning setting, focusing on the supervised regime. We discuss the theoretical background, show how to use it for supervised graph and node representation learning, discuss recent extensions, and outline the algorithm's connection to (permutation-)equivariant neural architectures. Moreover, we give an overview of current applications and future directions to stimulate further research.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningRepresentation LearningSimilar Papers 제목 키워드 기반
Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited
Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of …
Graph LearningThe Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with gr…
BIG-bench Machine LearningNode ClassificationWalking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing
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…
Graph ClassificationGraph LearningGraph RegressionregressionWeisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
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 natu…
General ClassificationGraph ClassificationGraph LearningGraph RegressionWeisfeiler-Leman Features for Planning: A 1,000,000 Sample Size Hyperparameter Study
Weisfeiler-Leman Features (WLFs) are a recently introduced classical machine learning tool for learning to plan and search. They have been shown to be both theoretically and empirically superior to existing deep learning…