Discriminability of Single-Layer Graph Neural Networks

by   Samuel Pfrommer, et al.

Network data can be conveniently modeled as a graph signal, where data values are assigned to the nodes of a graph describing the underlying network topology. Successful learning from network data requires methods that effectively exploit this graph structure. Graph neural networks (GNNs) provide one such method and have exhibited promising performance on a wide range of problems. Understanding why GNNs work is of paramount importance, particularly in applications involving physical networks. We focus on the property of discriminability and establish conditions under which the inclusion of pointwise nonlinearities to a stable graph filter bank leads to an increased discriminative capacity for high-eigenvalue content. We define a notion of discriminability tied to the stability of the architecture, show that GNNs are at least as discriminative as linear graph filter banks, and characterize the signals that cannot be discriminated by either.


Graphs, Convolutions, and Neural Networks

Network data can be conveniently modeled as a graph signal, where data v...

Stability of Graph Neural Networks to Relative Perturbations

Graph neural networks (GNNs), consisting of a cascade of layers applying...

Topological Graph Neural Networks

Graph neural networks (GNNs) are a powerful architecture for tackling gr...

Web Image Context Extraction with Graph Neural Networks and Sentence Embeddings on the DOM tree

Web Image Context Extraction (WICE) consists in obtaining the textual in...

Stability Properties of Graph Neural Networks

Data stemming from networks exhibit an irregular support, whereby each d...

Node-Variant Graph Filters in Graph Neural Networks

Graph neural networks (GNNs) have been successfully employed in a myriad...

A Note on Over-Smoothing for Graph Neural Networks

Graph Neural Networks (GNNs) have achieved a lot of success on graph-str...