GABO: Graph Augmentations with Bi-level Optimization
Not on the map. Why?
Abstract (arXiv)
Data augmentation refers to a wide range of techniques for improving model generalization by augmenting training examples. Oftentimes such methods require domain knowledge about the dataset at hand, spawning a plethora of recent literature surrounding automated techniques for data augmentation. In this work we apply one such method, bilevel optimization, to tackle the problem of graph classification on the ogbg-molhiv dataset. Our best performing augmentation achieved a test ROCAUC score of 77.77 % with a GIN+virtual classifier, which makes it the most effective augmenter for this classifier on the leaderboard. This framework combines a GIN layer augmentation generator with a bias transformation and outperforms the same classifier augmented using the state-of-the-art FLAG augmentation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 13 references that are in the map. First posted on arXiv 1 Apr 2021.
Builds on
10 of 13 references.
References · 10
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2019Adversarial Training for Free!cited by 638
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
- 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
- 2017Learning Graph-Level Representation for Drug Discoverycited by 43
- 2020Learning Data Augmentation with Online Bilevel Optimization for Image Classificationcited by 20
Built on by
Not cited yet.