Skip to yearly menu bar Skip to main content


Poster

Understanding the Representation Power of Graph Neural Networks in Learning Graph Topology

Nima Dehmamy · Albert-Laszlo Barabasi · Rose Yu

East Exhibition Hall B + C #37

Keywords: [ Network Analysis; Deep Learning - ] [ Algorithms -> Classification; Algorithms -> Similarity and Distance Learning; Applications ] [ Interaction-Based Deep Networks ] [ Deep Learning ]


Abstract:

To deepen our understanding of graph neural networks, we investigate the representation power of Graph Convolutional Networks (GCN) through the looking glass of graph moments, a key property of graph topology encoding path of various lengths. We find that GCNs are rather restrictive in learning graph moments. Without careful design, GCNs can fail miserably even with multiple layers and nonlinear activation functions. We analyze theoretically the expressiveness of GCNs, arriving at a modular GCN design, using different propagation rules. Our modular design is capable of distinguishing graphs from different graph generation models for surprisingly small graphs, a notoriously difficult problem in network science. Our investigation suggests that, depth is much more influential than width and deeper GCNs are more capable of learning higher order graph moments. Additionally, combining GCN modules with different propagation rules is critical to the representation power of GCNs.

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