mlsanityData to 14 Oct 2026

Task-Agnostic Graph Neural Network Evaluation via Adversarial Collaboration

arXiv 2301.11517 ↗First posted 27 Jan 2023cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

It has been increasingly demanding to develop reliable methods to evaluate the progress of Graph Neural Network (GNN) research for molecular representation learning. Existing GNN benchmarking methods for molecular representation learning focus on comparing the GNNs' performances on some node/graph classification/regression tasks on certain datasets. However, there lacks a principled, task-agnostic method to directly compare two GNNs. Additionally, most of the existing self-supervised learning works incorporate handcrafted augmentations to the data, which has several severe difficulties to be applied on graphs due to their unique characteristics. To address the aforementioned issues, we propose GraphAC (Graph Adversarial Collaboration) -- a conceptually novel, principled, task-agnostic, and stable framework for evaluating GNNs through contrastive self-supervision. We introduce a novel objective function: the Competitive Barlow Twins, that allow two GNNs to jointly update themselves from direct competitions against each other. GraphAC succeeds in distinguishing GNNs of different expressiveness across various aspects, and has demonstrated to be a principled and reliable GNN evaluation method, without necessitating any augmentations.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 38 references that are in the map. First posted on arXiv 27 Jan 2023.

Builds on

28 of 38 references.

References · 28

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  5. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  6. 2018How Powerful are Graph Neural Networks?cited by 4,393
  7. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  8. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  9. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,838
  10. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  11. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
  12. 2020Graph Contrastive Learning with Augmentationscited by 1,208
16 more
  1. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
  2. 2018Deep Graph Infomaxcited by 1,106
  3. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,057
  4. 2020Benchmarking Graph Neural Networkscited by 680
  5. 2020Principal Neighbourhood Aggregation for Graph Netscited by 478
  6. 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
  7. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  8. 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 333
  9. 2021Graph Contrastive Learning Automatedcited by 287
  10. 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
  11. 20213D Infomax improves GNNs for Molecular Property Predictioncited by 146
  12. 2021Self-supervised Graph-level Representation Learning with Local and Global Structurecited by 125
  13. 2019Fake News Detection on Social Media using Geometric Deep Learningcited by 118
  14. 2021NRGNN: Learning a Label Noise-Resistant Graph Neural Network on Sparsely and Noisily Labeled Graphscited by 73
  15. 2019Learning Graph Neural Networks with Noisy Labelscited by 30
  16. 2014On distinguishability criteria for estimating generative modelscited by 21

Built on by

Not cited yet.