Showing 2024Show all
2 papers · 1 filter
cs.LG2024
Covered Forest: Fine-grained generalization analysis of graph neural networks
Antonis Vasileiou, Ben Finkelshtein, Floris Geerts +2
The expressive power of message-passing graph neural networks (MPNNs) is reasonably well understood, primarily through combinatorial techniques from graph isomorphism testing. Howe…
cs.LG2024
Weisfeiler-Leman at the margin: When more expressivity matters
Billy J. Franks, Christopher Morris, Ameya Velingker +1
The Weisfeiler-Leman algorithm (-WL) is a well-studied heuristic for the graph isomorphism problem. Recently, the algorithm has played a prominent role in understanding the expr…