Pith. sign in

REVIEW 1 cited by

Adversarial Variational Bayes: Unifying Variational Autoencoders and 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 1701.04722 v4 pith:S7PUDP64 submitted 2017-01-17 cs.LG

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

Variational Autoencoders (VAEs) are expressive latent variable models that can be used to learn complex probability distributions from training data. However, the quality of the resulting model crucially relies on the expressiveness of the inference model. We introduce Adversarial Variational Bayes (AVB), a technique for training Variational Autoencoders with arbitrarily expressive inference models. We achieve this by introducing an auxiliary discriminative network that allows to rephrase the maximum-likelihood-problem as a two-player game, hence establishing a principled connection between VAEs and Generative Adversarial Networks (GANs). We show that in the nonparametric limit our method yields an exact maximum-likelihood assignment for the parameters of the generative model, as well as the exact posterior distribution over the latent variables given an observation. Contrary to competing approaches which combine VAEs with GANs, our approach has a clear theoretical justification, retains most advantages of standard Variational Autoencoders and is easy to implement.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Joint-stochastic-approximation Autoencoders with Application to Semi-supervised Learning

    cs.LG 2025-05 conditional novelty 4.0 of 10

    A stochastic-approximation autoencoder that maximizes the true log-likelihood and uses MCMC-corrected posterior sampling is applied to semi-supervised learning with discrete latent codes, reporting useful but not stat...

Pith tools