pith. sign in

arxiv: 1805.09804 · v2 · pith:Z3AXHJESnew · submitted 2018-05-24 · 💻 cs.LG · stat.ML

Implicit Autoencoders

classification 💻 cs.LG stat.ML
keywords implicitautoencoderdistributionslearningconditionalexpressivegenerativeinformation
0
0 comments X
read the original abstract

In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoencoder, and derive the learning rules based on maximum-likelihood learning. Using implicit distributions allows us to learn more expressive posterior and conditional likelihood distributions for the autoencoder. Learning an expressive conditional likelihood distribution enables the latent code to only capture the abstract and high-level information of the data, while the remaining low-level information is captured by the implicit conditional likelihood distribution. We show the applications of implicit autoencoders in disentangling content and style information, clustering, semi-supervised classification, learning expressive variational distributions, and multimodal image-to-image translation from unpaired data.

This paper has not been read by Pith yet.

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. Node Attribute Generation on Graphs

    stat.ML 2019-07 unverdicted novelty 4.0

    NANG uses adversarial learning to generate unobserved node attributes from graph structure via a shared latent space.