Graph convolutions that can finally model local structure
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence
Virtual Nodes Can Help: Tackling Distribution Shifts in Federated Graph Learning
Data-Driven Self-Supervised Graph Representation Learning
Next Level Message-Passing with Hierarchical Support Graphs
Towards Neural Scaling Laws for Foundation Models on Temporal Graphs
Learning Long Range Dependencies on Graphs via Random Walks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.