Pith. sign in

REVIEW 1 cited by

Your GAN is Secretly an Energy-based Model and You Should use Discriminator Driven Latent Sampling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.06060 v3 pith:S42TU3VN submitted 2020-03-12 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords discriminatorlatentddlsgeneratorsamplingdensitymodelscore
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We show that the sum of the implicit generator log-density $\log p_g$ of a GAN with the logit score of the discriminator defines an energy function which yields the true data density when the generator is imperfect but the discriminator is optimal, thus making it possible to improve on the typical generator (with implicit density $p_g$). To make that practical, we show that sampling from this modified density can be achieved by sampling in latent space according to an energy-based model induced by the sum of the latent prior log-density and the discriminator output score. This can be achieved by running a Langevin MCMC in latent space and then applying the generator function, which we call Discriminator Driven Latent Sampling~(DDLS). We show that DDLS is highly efficient compared to previous methods which work in the high-dimensional pixel space and can be applied to improve on previously trained GANs of many types. We evaluate DDLS on both synthetic and real-world datasets qualitatively and quantitatively. On CIFAR-10, DDLS substantially improves the Inception Score of an off-the-shelf pre-trained SN-GAN~\citep{sngan} from $8.22$ to $9.09$ which is even comparable to the class-conditional BigGAN~\citep{biggan} model. This achieves a new state-of-the-art in unconditional image synthesis setting without introducing extra parameters or additional training.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Discrete Markov Bridge

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Discrete Markov Bridge learns the forward rate matrix and the reverse score in a continuous-time Markov chain, achieving BPC 1.38 on Text8 and FID 11.63 on CIFAR-10.

Pith tools