On the expressive power of message-passing neural networks as global feature map transformers

03/17/2022
by   Floris Geerts, et al.
0

We investigate the power of message-passing neural networks (MPNNs) in their capacity to transform the numerical features stored in the nodes of their input graphs. Our focus is on global expressive power, uniformly over all input graphs, or over graphs of bounded degree with features from a bounded domain. Accordingly, we introduce the notion of a global feature map transformer (GFMT). As a yardstick for expressiveness, we use a basic language for GFMTs, which we call MPLang. Every MPNN can be expressed in MPLang, and our results clarify to which extent the converse inclusion holds. We consider exact versus approximate expressiveness; the use of arbitrary activation functions; and the case where only the ReLU activation function is allowed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2020

Activation function dependence of the storage capacity of treelike neural networks

The expressive power of artificial neural networks crucially depends on ...
research
04/06/2020

Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework

In this paper we cast neural networks defined on graphs as message-passi...
research
01/07/2018

Covariant Compositional Networks For Learning Graphs

Most existing neural networks for learning graphs address permutation in...
research
06/16/2020

Walk Message Passing Neural Networks and Second-Order Graph Neural Networks

The expressive power of message passing neural networks (MPNNs) is known...
research
06/10/2021

GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddings

We present GNNAutoScale (GAS), a framework for scaling arbitrary message...
research
09/29/2022

Provably expressive temporal graph networks

Temporal graph networks (TGNs) have gained prominence as models for embe...
research
04/29/2018

Learning Data Dependency with Communication Cost

In this paper, we consider the problem of recovering a graph that repres...

Please sign up or login with your details

Forgot password? Click here to reset