Symmetric Wasserstein Autoencoders
Not on the map. Why?
Abstract (arXiv)
Leveraging the framework of Optimal Transport, we introduce a new family of generative autoencoders with a learnable prior, called Symmetric Wasserstein Autoencoders (SWAEs). We propose to symmetrically match the joint distributions of the observed data and the latent representation induced by the encoder and the decoder. The resulting algorithm jointly optimizes the modelling losses in both the data and the latent spaces with the loss in the data space leading to the denoising effect. With the symmetric treatment of the data and the latent representation, the algorithm implicitly preserves the local structure of the data in the latent space. To further improve the quality of the latent representation, we incorporate a reconstruction loss into the objective, which significantly benefits both the generation and reconstruction. We empirically show the superior performance of SWAEs over the state-of-the-art generative autoencoders in terms of classification, reconstruction, and generation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 43 references that are in the map. First posted on arXiv 24 Jun 2021.
Builds on
27 of 43 references.
References · 27
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2016Density estimation using Real NVPcited by 2,042
- 2019Generating Diverse High-Fidelity Images with VQ-VAE-2cited by 1,387
- 2014NICE: Non-linear Independent Components Estimationcited by 1,058
- 2016Pixel Recurrent Neural Networkscited by 816
- 2018Computational Optimal Transportcited by 780
- 2020NVAE: A Deep Hierarchical Variational Autoencodercited by 637
- 2017Wasserstein Auto-Encoderscited by 373
- 2016Adversarial Feature Learningcited by 350
- 2017Toward Controlled Generation of Textcited by 272
15 more
- 2017VAE with a VampPriorcited by 248
- 2016Adversarially Learned Inferencecited by 216
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
- 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
- 2013RNADE: The real-valued neural autoregressive density-estimatorcited by 66
- 2018Structured Disentangled Representationscited by 62
- 2019Learning Hierarchical Priors in VAEscited by 53
- 2018On the Convergence and Robustness of Training GANs with Regularized Optimal Transportcited by 51
- 2017ALICE: Towards Understanding Adversarial Learning for Joint Distribution Matchingcited by 32
- 2017Symmetric Variational Autoencoder and Connections to Adversarial Learningcited by 14
- 2017Adversarial Symmetric Variational Autoencodercited by 11
- 2018The Deep Weight Priorcited by 11
- 2017On the Limitations of First-Order Approximation in GAN Dynamicscited by 4
- 2018Entropic GANs meet VAEs: A Statistical Approach to Compute Sample Likelihoods in GANscited by 4
- 2019MIM: Mutual Information Machinecited by 4
Built on by
Not cited yet.