HyperAIHyperAI

Command Palette

Search for a command to run...

5 months ago

Graph convolutions that can finally model local structure

Rémy Brossard; Oriel Frigo; David Dehaene

Graph convolutions that can finally model local structure

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.

Code Repositories

RBrossard/GINEPLUS
Official
pytorch
Mentioned in GitHub

Benchmarks

BenchmarkMethodologyMetrics
graph-property-prediction-on-ogbg-molpcbaGINE+ w/ APPNP
Ext. data: No
Number of params: 6147029
Test AP: 0.2979 ± 0.0030
Validation AP: 0.3126 ± 0.0023
graph-property-prediction-on-ogbg-molpcbaGINE+ w/ virtual nodes
Ext. data: No
Number of params: 6147029
Test AP: 0.2917 ± 0.0015
Validation AP: 0.3065 ± 0.0030

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Graph convolutions that can finally model local structure | Papers | HyperAI