A Fair Comparison of Graph Neural Networks for Graph Classification

Federico Errica, Marco Podda, Davide Bacciu, Alessio Micheli
12/20/2019
cs.LGstat.ML

Official code: diningphil/gnn-comparison (401 stars, GPL-3.0, last commit 2024-06-17).

Abstract

Experimental reproducibility and replicability are critical topics in machine learning. Authors have often raised concerns about their lack in scientific publications to improve the quality of the field. Recently, the graph representation learning field has attracted the attention of a wide research community, which resulted in a large stream of works. As such, several Graph Neural Network models have been developed to effectively tackle graph classification. However, experimental procedures often lack rigorousness and are hardly reproducible. Motivated by this, we provide an overview of common practices that should be avoided to fairly compare with the state of the art. To counter this troubling trend, we ran more than 47000 experiments in a controlled and uniform framework to re-evaluate five popular models across nine common benchmarks. Moreover, by comparing GNNs with structure-agnostic baselines we provide convincing evidence that, on some datasets, structural information has not been exploited yet. We believe that this work can contribute to the development of the graph learning field, by providing a much needed grounding for rigorous evaluations of graph classification models.

View on arXivView PDF

Code Implementations(1)

GPL-3.0

Official Repository of "A Fair Comparison of Graph Neural Networks for Graph Classification", ICLR 2020

40158Shell, PythonDec 20, 20192 years agoGPL-3.0

Cite this paper

@article{errica2019fair,
  title  = {A Fair Comparison of Graph Neural Networks for Graph Classification},
  author = {Federico Errica and Marco Podda and Davide Bacciu and Alessio Micheli},
  year   = {2019},
  eprint = {1912.09893},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1912.09893}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1912.09893.svg)](https://codeofpaper.com/paper/1912.09893)

Discussion