DOG: Discriminator-only Generation Beats GANs on Graphs
Franz Rieger, Joergen Kornfeld
OpenReview ground truth
TL;DR — We investigate discriminator-only generation (DOG) using gradient descent on the input of a discriminator to generate samples and beat GANs on graphs.
Abstract
We propose discriminator-only generation (DOG) as a generative modeling approach that bridges the gap between energy-based models (EBMs) and generative adversarial networks (GANs). DOG generates samples through iterative gradient descent on a discriminator's input, eliminating the need for a separate generator model. This simplification obviates the extensive tuning of generator architectures required by GANs. In the graph domain, where GANs have lagged behind diffusion approaches in generation quality, DOG demonstrates significant improvements over GANs using the same discriminator architectures. Surprisingly, despite its computationally intensive iterative generation, DOG produces higher-quality samples than GANs on the QM9 molecule dataset in less training time.
Author context
Most prolific author: 1 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 36 comparisons
Ranked above opponent in 51% of matchups.
- ▲ beat Video Generation Beyond a Single Clip ×6
- ▼ lost to GAIA: Zero-shot Talking Avatar Generation ×6
- ▲ beat Enhancing Sample Efficiency in Black-box C… ×6
- ▲ beat Soft Contrastive Learning for Time Series ×6
- ▼ lost to Random Walk Diffusion For Graph Generation ×6
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 36)