Evaluating Graph Generative Models with Contrastively Learned Features
Not on the map. Why?
Abstract (arXiv)
A wide range of models have been proposed for Graph Generative Models, necessitating effective methods to evaluate their quality. So far, most techniques use either traditional metrics based on subgraph counting, or the representations of randomly initialized Graph Neural Networks (GNNs). We propose using representations from contrastively trained GNNs, rather than random GNNs, and show this gives more reliable evaluation metrics. Neither traditional approaches nor GNN-based approaches dominate the other, however: we give examples of graphs that each approach is unable to distinguish. We demonstrate that Graph Substructure Networks (GSNs), which in a way combine both approaches, are better at distinguishing the distances between graph datasets.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 46 of its 58 references that are in the map. First posted on arXiv 13 Jun 2022.
Builds on
46 of 58 references.
References · 46
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2016Improved Techniques for Training GANscited by 2,970
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2018Demystifying MMD GANscited by 1,293
34 more
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2018Which Training Methods for GANs do actually Converge?cited by 679
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
- 2017Wasserstein GANcited by 639
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 464
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
- 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
- 2020Reliable Fidelity and Diversity Metrics for Generative Modelscited by 434
- 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 413
- 2018Assessing Generative Models via Precision and Recallcited by 406
- 2018MolGAN: An implicit generative model for small molecular graphscited by 393
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 313
- 2015A note on the evaluation of generative modelscited by 292
- 2021Graph Contrastive Learning Automatedcited by 287
- 2020Can Graph Neural Networks Count Substructures?cited by 236
- 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 234
- 2018Learning Deep Generative Models of Graphscited by 229
- 2018Pros and Cons of GAN Evaluation Measurescited by 224
- 2020Learning Deep Kernels for Non-Parametric Two-Sample Testscited by 130
- 2017Stabilizing Training of Generative Adversarial Networks through Regularizationcited by 118
- 2019GraphNVP: An Invertible Flow Model for Generating Molecular Graphscited by 116
- 2022Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlapcited by 105
- 2020A Systematic Survey on Deep Generative Models for Graph Generationcited by 94
- 2020Scalable Deep Generative Modeling for Sparse Graphscited by 65
- 2022On Evaluation Metrics for Graph Generative Modelscited by 46
- 2021Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutionscited by 39
- 2018On gradient regularizers for MMD GANscited by 28
- 2022Cross-Domain Few-Shot Graph Classificationcited by 19
- 2020Graph Deconvolutional Generationcited by 16
- 2022Learning Graph Augmentations to Learn Graph Representationscited by 14
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 2; 2026: 1.
5 papers.
- 2022A Framework for Large Scale Synthetic Graph Dataset Generationcited by 6
- 2025PolyGraph Discrepancy: a classifier-based metric for graph generationcited by 3
- 2023Topology Only Pre-Training: Towards Generalised Multi-Domain Graph Modelscited by 1
- 2025Graph Generative Models Evaluation with Masked Autoencodercited by 0
- 2026Diversity Curves for Graph Representation Learningcited by 0
- 2026Diversity Curves for Graph Representation Learning7 May 2026
- 2025PolyGraph Discrepancy: a classifier-based metric for graph generation7 Oct 2025
- 2025Graph Generative Models Evaluation with Masked Autoencoder17 Mar 2025
- 2023Topology Only Pre-Training: Towards Generalised Multi-Domain Graph Models7 Nov 2023
- 2022A Framework for Large Scale Synthetic Graph Dataset Generation4 Oct 2022