PapersWithELO
← ICLR 2024 leaderboard

DOG: Discriminator-only Generation Beats GANs on Graphs

Franz Rieger, Joergen Kornfeld

generative modelsgenerative modelinggraph generation
43.50100
Fused
band ≈ ±15 pct pts (from σ = 0.29)
39.40100
Mimo
band ≈ ±20 pct pts (from σ = 0.40)
53.90100
DeepSeek
band ≈ ±21 pct pts (from σ = 0.42)

OpenReview ground truth

Rejected

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.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 36)