Pith. sign in

REVIEW 2 cited by

Variational Inference using Implicit Distributions

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 1702.08235 v1 pith:YZ4LQYLW submitted 2017-02-27 stat.ML cs.LG

classification stat.MLcs.LG
keywords inferencealgorithmsvariationalgenerativeimplicitconnectionsdistributionsmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Generative adversarial networks (GANs) have given us a great tool to fit implicit generative models to data. Implicit distributions are ones we can sample from easily, and take derivatives of samples with respect to model parameters. These models are highly expressive and we argue they can prove just as useful for variational inference (VI) as they are for generative modelling. Several papers have proposed GAN-like algorithms for inference, however, connections to the theory of VI are not always well understood. This paper provides a unifying review of existing algorithms establishing connections between variational autoencoders, adversarially learned inference, operator VI, GAN-based image reconstruction, and more. Secondly, the paper provides a framework for building new algorithms: depending on the way the variational bound is expressed we introduce prior-contrastive and joint-contrastive methods, and show practical inference algorithms based on either density ratio estimation or denoising.

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. Large-scale empirical tuning and comparison of default optimizers for variational inference

    stat.CO 2026-06 unverdicted novelty 5.0 of 10

    Large empirical study of 56 optimizers on 1092 BBVI tasks finds no single winner but a selection of five suffices for near-best performance.

  2. A Cubing Strategy for Identifying Stable Hyperparameter Regions for Uncertainty Quantification in Spatial Deep Learning

    stat.CO 2026-05 unverdicted novelty 5.0 of 10

    A recursive cubing framework identifies stable hyperparameter regions for MC dropout uncertainty quantification in spatial deep learning and produces competitive or superior predictive intervals versus a statistical b...

Pith tools