Skip to yearly menu bar Skip to main content

Workshop: Geometrical and Topological Representation Learning

SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks

Christopher Morris · Gaurav Rattan · Sandra Kiefer · Siamak Ravanbakhsh

Keywords: [ GNNs ] [ sparsity ]


While graph neural networks have clear limitations in approximating permutation-equivariant functions over graphs, more expressive, higher-order graph neural networks do not scale to large graphs. By introducing new heuristics for the graph isomorphism problem, we devise a class of universal, permutation-equivariant graph networks, which offers a fine-grained control between expressivity and scalability and adapt to the sparsity of the graph. These architectures lead to vastly reduced computation times compared to standard higher-order graph networks while significantly improving over standard graph neural network and graph kernel architectures in terms of predictive performance.

Chat is not available.