mlsanityData to 7 Oct 2026

Vertical Validation: Evaluating Implicit Generative Models for Graphs on Thin Support Regions

arXiv 2411.13358 ↗First posted 20 Nov 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

There has been a growing excitement that implicit graph generative models could be used to design or discover new molecules for medicine or material design. Because these molecules have not been discovered, they naturally lie in unexplored or scarcely supported regions of the distribution of known molecules. However, prior evaluation methods for implicit graph generative models have focused on validating statistics computed from the thick support (e.g., mean and variance of a graph property). Therefore, there is a mismatch between the goal of generating novel graphs and the evaluation methods. To address this evaluation gap, we design a novel evaluation method called Vertical Validation (VV) that systematically creates thin support regions during the train-test splitting procedure and then reweights generated samples so that they can be compared to the held-out test data. This procedure can be seen as a generalization of the standard train-test procedure except that the splits are dependent on sample features. We demonstrate that our method can be used to perform model selection if performance on thin support regions is the desired goal. As a side benefit, we also show that our approach can better detect overfitting as exemplified by memorization.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 34 references that are in the map. First posted on arXiv 20 Nov 2024.

Builds on

19 of 34 references.

References · 19

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
  3. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  4. 2022Generative Adversarial Networkscited by 5,603
  5. 2018How Powerful are Graph Neural Networks?cited by 4,355
  6. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  7. 2022Equivariant Diffusion for Molecule Generation in 3Dcited by 666
  8. 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
  9. 2020A Brief Review of Domain Adaptationcited by 287
  10. 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equationscited by 273
  11. 2020Permutation Invariant Graph Generation via Score-Based Generative Modelingcited by 263
  12. 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
7 more
  1. 2018Fr'echet ChemNet Distance: A metric for generative models for molecules in drug discoverycited by 191
  2. 2022SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generatorscited by 96
  3. 2021Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutionscited by 38
  4. 2021Order Matters: Probabilistic Modeling of Node Sequence for Graph Generationcited by 32
  5. 2023Curvature Filtrations for Graph Generative Model Evaluationcited by 18
  6. 2021ADAPT : Awesome Domain Adaptation Python Toolboxcited by 13
  7. 2023Evaluating Robustness and Uncertainty of Graph Models Under Structural Distributional Shiftscited by 7

Built on by

Not cited yet.