InfoVAEGAN : learning joint interpretable representations by information maximization and maximum likelihood
Not on the map. Why?
Abstract (arXiv)
Learning disentangled and interpretable representations is an important step towards accomplishing comprehensive data representations on the manifold. In this paper, we propose a novel representation learning algorithm which combines the inference abilities of Variational Autoencoders (VAE) with the generalization capability of Generative Adversarial Networks (GAN). The proposed model, called InfoVAEGAN, consists of three networks~: Encoder, Generator and Discriminator. InfoVAEGAN aims to jointly learn discrete and continuous interpretable representations in an unsupervised manner by using two different data-free log-likelihood functions onto the variables sampled from the generator's distribution. We propose a two-stage algorithm for optimizing the inference network separately from the generator training. Moreover, we enforce the learning of interpretable representations through the maximization of the mutual information between the existing latent variables and those created through generative and inference processes.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 9 Jul 2021.
Builds on
15 of 26 references.
References · 15
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2016Deep Variational Information Bottleneckcited by 915
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2018Disentangling by Factorisingcited by 614
- 2015Adversarial Autoencoderscited by 359
- 2016Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoderscited by 219
- 2016Adversarially Learned Inferencecited by 216
- 2015Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networkscited by 94
- 2018Learning Disentangled Joint Continuous and Discrete Representationscited by 83
- 2020Learning latent representations across multiple data domains using Lifelong VAEGANcited by 35
3 more
- 2018Information Constraints on Auto-Encoding Variational Bayescited by 33
- 2018Auto-Encoding Total Correlation Explanationcited by 17
- 2017PixelGAN Autoencoderscited by 14
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 2.
7 papers.
- 2022Task-Free Continual Learning via Online Discrepancy Distance Learningcited by 22
- 2022Continual Variational Autoencoder Learning via Online Cooperative Memorizationcited by 12
- 2021Lifelong Generative Modelling Using Dynamic Expansion Graph Modelcited by 4
- 2022Learning an evolved mixture model for task-free continual learningcited by 3
- 2023VOLTA: Improving Generative Diversity by Variational Mutual Information Maximizing Autoencodercited by 2
- 2022Causality Learning With Wasserstein Generative Adversarial Networkscited by 0
- 2023A Systematic Evaluation and Benchmark for Embedding-Aware Generative Models: Features, Models, and Any-shot Scenarioscited by 0
- 2023VOLTA: Improving Generative Diversity by Variational Mutual Information Maximizing Autoencoder3 Jul 2023
- 2023A Systematic Evaluation and Benchmark for Embedding-Aware Generative Models: Features, Models, and Any-shot Scenarios8 Feb 2023
- 2022Task-Free Continual Learning via Online Discrepancy Distance Learning12 Oct 2022
- 2022Continual Variational Autoencoder Learning via Online Cooperative Memorization20 Jul 2022
- 2022Learning an evolved mixture model for task-free continual learning11 Jul 2022
- 2022Causality Learning With Wasserstein Generative Adversarial Networks3 Jun 2022
- 2021Lifelong Generative Modelling Using Dynamic Expansion Graph Model15 Dec 2021