Deep Graphs

We propose an algorithm for deep learning on networks and graphs. It relies on the notion that many graph algorithms, such as PageRank, Weisfeiler-Lehman, or Message Passing can be expressed as iterative vertex updates. Unlike previous methods which rely on the ingenuity of the designer, Deep Graphs are adaptive to the estimation problem. Training and deployment are both efficient, since the cost is O(|E| + |V|), where E and V are the sets of edges and vertices respectively. In short, we learn the recurrent update functions rather than positing their specific functional form. This yields an algorithm that achieves excellent accuracy on both graph labeling and regression tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2021

Aligning random graphs with a sub-tree similarity message-passing algorithm

The problem of aligning Erdös-Rényi random graphs is a noisy, average-ca...
research
08/07/2018

Message Passing Graph Kernels

Graph kernels have recently emerged as a promising approach for tackling...
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
12/31/2020

Graph Networks with Spectral Message Passing

Graph Neural Networks (GNNs) are the subject of intense focus by the mac...
research
05/14/2023

Addressing Heterophily in Node Classification with Graph Echo State Networks

Node classification tasks on graphs are addressed via fully-trained deep...
research
01/21/2018

Recovering a Hidden Community in a Preferential Attachment Graph

A message passing algorithm (MP) is derived for recovering a dense subgr...

Please sign up or login with your details

Forgot password? Click here to reset