7 citations · 12 across the 14 of their papers we have counts for
9 papers · 1 filter
The Boolean Power of ReLU
Pablo Barceló, Floris Geerts, Matthias Lanzinger +2
We prove that, on finite simple undirected graphs equipped with a single Boolean node feature, the Boolean queries expressible in -MPLang, for any collection of eventually c…
AutoGrable: What Is a Good Graph for a Table?
Tamara Cucumides, Floris Geerts
Graph learning presupposes a graph, and tables and relational databases do not come with one. Applying a GNN to them requires deciding which entities become nodes, which of them to…
Which Algorithms Can Graph Neural Networks Learn?
Solveig Wittig, Antonis Vasileiou, Robert R. Nerem +4
In recent years, there has been growing interest in understanding neural architectures' ability to learn to execute discrete algorithms, a line of work often referred to as neural…
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…
Towards Bridging Generalization and Expressivity of Graph Neural Networks
Shouheng Li, Floris Geerts, Dongwoo Kim +1
Expressivity and generalization are two critical aspects of graph neural networks (GNNs). While significant progress has been made in studying the expressivity of GNNs, much less i…
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…
A Neuro-Symbolic Framework for Answering Graph Pattern Queries in Knowledge Graphs
Tamara Cucumides, Daniel Daza, Pablo Barceló +4
The challenge of answering graph queries over incomplete knowledge graphs is gaining significant attention in the machine learning community. Neuro-symbolic models have emerged as…
Expressiveness and Approximation Properties of Graph Neural Networks
Floris Geerts, Juan L. Reutter
Characterizing the separation power of graph neural networks (GNNs) provides an understanding of their limitations for graph learning tasks. Results regarding separation power are,…
The expressive power of kth-order invariant graph networks
Floris Geerts
The expressive power of graph neural network formalisms is commonly measured by their ability to distinguish graphs. For many formalisms, the k-dimensional Weisfeiler-Leman (k-WL)…