Skip to yearly menu bar Skip to main content


Oral Poster

Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning

Raffaele Paolino · Sohir Maskey · Pascal Welke · Gitta Kutyniok

East Exhibit Hall A-C #3009
[ ] [ Project Page ]
Fri 13 Dec 11 a.m. PST — 2 p.m. PST
 
Oral presentation: Oral Session 5A: Graph Neural Networks
Fri 13 Dec 10 a.m. PST — 11 a.m. PST

Abstract: We introduce $r$-loopy Weisfeiler-Leman ($r$-$\ell$WL), a novel hierarchy of graph isomorphism tests and a corresponding GNN framework, $r$-$\ell$MPNN, that can count cycles up to length $r{+}2$. Most notably, we show that $r$-$\ell$WL can count homomorphisms of cactus graphs. This extends 1-WL, which can only count homomorphisms of trees and, in fact, is incomparable to $k$-WL for any fixed $k$. We empirically validate the expressive and counting power of $r$-$\ell$MPNN on several synthetic datasets and demonstrate the scalability and strong performance on various real-world datasets, particularly on sparse graphs.

Live content is unavailable. Log in and register to view live content