Weisfeiler and Leman go Machine Learning: The Story so far

Morris, Christopher; Lipman, Yaron; Maron, Haggai; Rieck, Bastian; Kriege, Nils M.; Grohe, Martin; Fey, Matthias; Borgwardt, Karsten

doi:10.48550/arXiv.2112.09992

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Preprint

Weisfeiler and Leman go Machine Learning: The Story so far

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Morris, C., Lipman, Y., Maron, H., Rieck, B., Kriege, N. M., Grohe, M., et al. (2021). Weisfeiler and Leman go Machine Learning: The Story so far. arXiv. doi:10.48550/arXiv.2112.09992.

Cite as: https://hdl.handle.net/21.11116/0000-000C-F053-7

Abstract

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.