Pith. sign in

REVIEW 1 cited by

Understanding the (un)interpretability of natural image distributions using generative models

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 1901.01499 v2 pith:RWM5M25Y submitted 2019-01-06 cs.LG cs.CVstat.ML

Understanding the (un)interpretability of natural image distributions using generative models

classification cs.LG cs.CVstat.ML
keywords densityestimationimageimagesinterpretabilitymodelsprobabilitycomplex
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Probability density estimation is a classical and well studied problem, but standard density estimation methods have historically lacked the power to model complex and high-dimensional image distributions. More recent generative models leverage the power of neural networks to implicitly learn and represent probability models over complex images. We describe methods to extract explicit probability density estimates from GANs, and explore the properties of these image density functions. We perform sanity check experiments to provide evidence that these probabilities are reasonable. However, we also show that density functions of natural images are difficult to interpret and thus limited in use. We study reasons for this lack of interpretability, and show that we can get interpretability back by doing density estimation on latent representations of images.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Pre-Deployment Complexity Estimation for Federated Perception Systems

    cs.LG 2026-03 conditional novelty 4.0

    A pre-deployment complexity score for federated learning, built from entropy, sparsity, and intrinsic dimensionality plus client frequencies, predicts accuracy and communication rounds on three MNIST variants.