Momentum Contrastive Autoencoder: Using Contrastive Learning for Latent Space Distribution Matching in WAE
Not on the map. Why?
Abstract (arXiv)
Wasserstein autoencoder (WAE) shows that matching two distributions is equivalent to minimizing a simple autoencoder (AE) loss under the constraint that the latent space of this AE matches a pre-specified prior distribution. This latent space distribution matching is a core component of WAE, and a challenging task. In this paper, we propose to use the contrastive learning framework that has been shown to be effective for self-supervised representation learning, as a means to resolve this problem. We do so by exploiting the fact that contrastive learning objectives optimize the latent space distribution to be uniform over the unit hyper-sphere, which can be easily sampled from. We show that using the contrastive learning framework to optimize the WAE loss achieves faster convergence and more stable optimization compared with existing popular algorithms for WAE. This is also reflected in the FID scores on CelebA and CIFAR-10 datasets, and the realistic generated image quality on the CelebA-HQ dataset.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 19 Oct 2021.
Builds on
29 of 42 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2017Neural Discrete Representation Learningcited by 4,712
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,988
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 640
17 more
- 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 464
- 2017Wasserstein Auto-Encoderscited by 373
- 2015Adversarial Autoencoderscited by 364
- 2016Adversarial Feature Learningcited by 350
- 2017VAE with a VampPriorcited by 248
- 2016Adversarially Learned Inferencecited by 216
- 2019Diagnosing and Enhancing VAE Modelscited by 193
- 2018Hyperspherical Variational Auto-Encoderscited by 189
- 2016Variational Lossy Autoencodercited by 176
- 2019From Variational to Deterministic Autoencoderscited by 133
- 2016Mode Regularized Generative Adversarial Networkscited by 123
- 2013Generalized Denoising Auto-Encoders as Generative Modelscited by 113
- 2020Dual Contradistinctive Generative Autoencodercited by 58
- 2018Resampled Priors for Variational Autoencoderscited by 57
- 2017Towards Deeper Understanding of Variational Autoencoding Modelscited by 56
- 2017From optimal transport to generative modeling: the VEGAN cookbookcited by 41
- 2018Cramer-Wold AutoEncodercited by 10
Built on by
Citing papers per year: 2025: 1.
1 paper.