Pith. sign in

REVIEW 2 cited by

Prescribed Generative Adversarial Networks

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 1910.04302 v1 pith:UWO6SBRT submitted 2019-10-09 stat.ML cs.LGstat.ME

classification stat.MLcs.LGstat.ME
keywords presganstheyadversarialganslog-likelihoodpredictivedensityentropy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Generative adversarial networks (GANs) are a powerful approach to unsupervised learning. They have achieved state-of-the-art performance in the image domain. However, GANs are limited in two ways. They often learn distributions with low support---a phenomenon known as mode collapse---and they do not guarantee the existence of a probability density, which makes evaluating generalization using predictive log-likelihood impossible. In this paper, we develop the prescribed GAN (PresGAN) to address these shortcomings. PresGANs add noise to the output of a density network and optimize an entropy-regularized adversarial loss. The added noise renders tractable approximations of the predictive log-likelihood and stabilizes the training procedure. The entropy regularizer encourages PresGANs to capture all the modes of the data distribution. Fitting PresGANs involves computing the intractable gradients of the entropy regularization term; PresGANs sidestep this intractability using unbiased stochastic estimates. We evaluate PresGANs on several datasets and found they mitigate mode collapse and generate samples with high perceptual quality. We further found that PresGANs reduce the gap in performance in terms of predictive log-likelihood between traditional GANs and variational autoencoders (VAEs).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Measuring Diversity in Synthetic Datasets

    cs.CL 2025-02 conditional novelty 6.0 of 10

    DCScore measures dataset diversity as the sum of self-classification probabilities under a softmax similarity matrix, and the paper shows it tracks generation temperature, human judgment, and LLM rankings.

  2. Exploring bidirectional bounds for minimax-training of Energy-based models

    cs.LG 2025-06 conditional novelty 4.0 of 10

    Maximizing a lower bound and minimizing an upper bound of the EBM negative log-likelihood stabilizes training and improves density estimation and sample quality.

Pith tools