mlsanityData to 14 Oct 2026

Proper losses for discrete generative models

arXiv 2211.03761 ↗First posted 7 Nov 2022cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

We initiate the study of proper losses for evaluating generative models in the discrete setting. Unlike traditional proper losses, we treat both the generative model and the target distribution as black-boxes, only assuming ability to draw i.i.d. samples. We define a loss to be black-box proper if the generative distribution that minimizes expected loss is equal to the target distribution. Using techniques from statistical estimation theory, we give a general construction and characterization of black-box proper losses: they must take a polynomial form, and the number of draws from the model and target distribution must exceed the degree of the polynomial. The characterization rules out a loss whose expectation is the cross-entropy between the target distribution and the model. By extending the construction to arbitrary sampling schemes such as Poisson sampling, however, we show that one can construct such a loss.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 8 of its 24 references that are in the map. First posted on arXiv 7 Nov 2022.

Builds on

8 of 24 references.

References · 8

  1. 2022Generative Adversarial Networkscited by 5,627
  2. 2018Demystifying MMD GANscited by 1,293
  3. 2015A note on the evaluation of generative modelscited by 292
  4. 2015Generative Moment Matching Networkscited by 257
  5. 2018Pros and Cons of GAN Evaluation Measurescited by 224
  6. 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 151
  7. 2019Toward a Characterization of Loss Functions for Distribution Learningcited by 3
  8. 2017Multi-Observation Elicitationcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 3; 2025: 1.

4 papers.