SOTAVerified

Graph convolutions that can finally model local structure

2020-11-30Code Available0· sign in to hype

Rémy Brossard, Oriel Frigo, David Dehaene

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Despite quick progress in the last few years, recent studies have shown that modern graph neural networks can still fail at very simple tasks, like detecting small cycles. This hints at the fact that current networks fail to catch information about the local structure, which is problematic if the downstream task heavily relies on graph substructure analysis, as in the context of chemistry. We propose a very simple correction to the now standard GIN convolution that enables the network to detect small cycles with nearly no cost in terms of computation time and number of parameters. Tested on real life molecule property datasets, our model consistently improves performance on large multi-tasked datasets over all baselines, both globally and on a per-task setting.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ogbg-molpcbaGINE+ w/ APPNPNumber of params6,147,029Unverified
ogbg-molpcbaGINE+ w/ virtual nodesNumber of params6,147,029Unverified

Reproductions