English

Stacked Wasserstein Autoencoder

Computer Vision and Pattern Recognition 2019-10-08 v1 Machine Learning

Abstract

Approximating distributions over complicated manifolds, such as natural images, are conceptually attractive. The deep latent variable model, trained using variational autoencoders and generative adversarial networks, is now a key technique for representation learning. However, it is difficult to unify these two models for exact latent-variable inference and parallelize both reconstruction and sampling, partly due to the regularization under the latent variables, to match a simple explicit prior distribution. These approaches are prone to be oversimplified, and can only characterize a few modes of the true distribution. Based on the recently proposed Wasserstein autoencoder (WAE) with a new regularization as an optimal transport. The paper proposes a stacked Wasserstein autoencoder (SWAE) to learn a deep latent variable model. SWAE is a hierarchical model, which relaxes the optimal transport constraints at two stages. At the first stage, the SWAE flexibly learns a representation distribution, i.e., the encoded prior; and at the second stage, the encoded representation distribution is approximated with a latent variable model under the regularization encouraging the latent distribution to match the explicit prior. This model allows us to generate natural textual outputs as well as perform manipulations in the latent space to induce changes in the output space. Both quantitative and qualitative results demonstrate the superior performance of SWAE compared with the state-of-the-art approaches in terms of faithful reconstruction and generation quality.

Keywords

Cite

@article{arxiv.1910.02560,
  title  = {Stacked Wasserstein Autoencoder},
  author = {Wenju Xu and Shawn Keshmiri and Guanghui Wang},
  journal= {arXiv preprint arXiv:1910.02560},
  year   = {2019}
}

Comments

arXiv admin note: text overlap with arXiv:1902.05581

R2 v1 2026-06-23T11:35:51.644Z