REVIEW 6 cited by
Benchmarking Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs. This emerging field has witnessed an extensive growth of promising techniques that have been applied with success to computer science, mathematics, biology, physics and chemistry. But for any successful field to become mainstream and reliable, benchmarks must be developed to quantify progress. This led us in March 2020 to release a benchmark framework that i) comprises of a diverse collection of mathematical and real-world graphs, ii) enables fair model comparison with the same parameter budget to identify key architectures, iii) has an open-source, easy-to-use and reproducible code infrastructure, and iv) is flexible for researchers to experiment with new theoretical ideas. As of December 2022, the GitHub repository has reached 2,000 stars and 380 forks, which demonstrates the utility of the proposed open-source framework through the wide usage by the GNN community. In this paper, we present an updated version of our benchmark with a concise presentation of the aforementioned framework characteristics, an additional medium-sized molecular dataset AQSOL, similar to the popular ZINC, but with a real-world measured chemical target, and discuss how this framework can be leveraged to explore new GNN designs and insights. As a proof of value of our benchmark, we study the case of graph positional encoding (PE) in GNNs, which was introduced with this benchmark and has since spurred interest of exploring more powerful PE for Transformers and GNNs in a robust experimental setting.
Forward citations
Cited by 6 Pith papers
-
Primal-Dual Neural Algorithmic Reasoning
A GNN framework that simulates primal-dual approximation algorithms for NP-hard problems and, with small-instance optimal labels, can beat the algorithm it learns.
-
Multi-Granularity Position Embedding of Graphs via Granular-Ball for Link Prediction
MGLP uses granular-ball graph refinement to construct hierarchical landmarks and a depth-weighted distance measure, improving link prediction over single-granularity position embeddings.
-
Computationally-efficient Graph Modeling with Refined Graph Random Features
Stitching several short random walks into a product of unbiased feature matrices approximates graph node kernels with less variance and better long-range coverage than single long walks.
-
Few-shot Learning on AMS Circuits and Its Application to Parasitic Capacitance Prediction
A few-shot graph-pretraining pipeline, built from subgraph sampling and a hybrid graph transformer, predicts parasitic coupling capacitance on unseen AMS circuits with substantially lower error than prior graph baselines.
-
sHGCN: Simplified hyperbolic graph convolutional neural networks
A simplified hyperbolic GCN that avoids redundant log/exp computations is competitive or faster than prior HGCN variants on four benchmark graphs.
-
Learning Causality for Modern Machine Learning
A thesis compiling six papers that use causal invariance to improve graph neural networks' out-of-distribution generalization, interpretability, and robustness.
Discussion (0). Sign in to comment.