On the quantitative analysis of decoder-based generative models

OpenAI Blog Papers

Summary

This paper proposes using Annealed Importance Sampling to evaluate log-likelihoods for decoder-based generative models (VAEs, GANs, etc.), addressing the challenge of intractable likelihood estimation. The authors validate their method and provide evaluation code to analyze model performance, overfitting, and mode coverage.

No content available
Original Article
View Cached Full Text

Cached at: 04/20/26, 02:45 PM

# On the quantitative analysis of decoder-based generative models Source: [https://openai.com/index/on-the-quantitative-analysis-of-decoder-based-generative-models/](https://openai.com/index/on-the-quantitative-analysis-of-decoder-based-generative-models/) ## Abstract The past several years have seen remarkable progress in generative models which produce convincing samples of images and other modalities\. A shared component of many powerful generative models is a decoder network, a parametric deep neural net that defines a generative distribution\. Examples include variational autoencoders, generative adversarial networks, and generative moment matching networks\. Unfortunately, it can be difficult to quantify the performance of these models because of the intractability of log\-likelihood estimation, and inspecting samples can be misleading\. We propose to use Annealed Importance Sampling for evaluating log\-likelihoods for decoder\-based models and validate its accuracy using bidirectional Monte Carlo\. The evaluation code is provided at[this https URL⁠\(opens in a new window\)](https://github.com/tonywu95/eval_gen)\. Using this technique, we analyze the performance of decoder\-based models, the effectiveness of existing log\-likelihood estimators, the degree of overfitting, and the degree to which these models miss important modes of the data distribution\.

Similar Articles

Active Learning for Conditional Generative Compressed Sensing

arXiv cs.LG

This paper proposes a framework for conditional generative compressed sensing, proving stable recovery bounds for prompt-conditioned models and demonstrating how prompt matching influences sampling distributions in experiments with Stable Diffusion.