University of Michigan - Ann Arbor

1. Relational Pooling.
2. Invariant and equivariant k-order GNNs
3. The k-WL test and k-GNNs

Three Major Directions of Modifying WL Algorithm

We simply add a unique, one-hot indicator feature for each node. The ID will make graphs distinguishable. Relational Pooling involves marginalizing over all possible node permutations.

Relational Pooling

The key idea behind the k-WL algorithms is that we label subgraphs of size k rather than individual nodes.

Learn Before

Related