Statistical Regeneration Guarantees of the Wasserstein Autoencoder with Latent Space Consistency
Anish Chakrabarty, Swagatam Das

TL;DR
This paper provides statistical guarantees for Wasserstein Autoencoders (WAE), demonstrating their ability to regenerate input distributions in the latent space using VC theory and optimal transport, thus advancing understanding of their theoretical properties.
Contribution
It introduces the first statistical analysis of WAE, establishing guarantees for distribution regeneration in the latent space based on VC theory and optimal transport principles.
Findings
WAE achieves target distribution in latent space with statistical guarantees.
Theoretical bounds are established for distribution regeneration.
Insights into the class of distributions WAE can reconstruct after compression.
Abstract
The introduction of Variational Autoencoders (VAE) has been marked as a breakthrough in the history of representation learning models. Besides having several accolades of its own, VAE has successfully flagged off a series of inventions in the form of its immediate successors. Wasserstein Autoencoder (WAE), being an heir to that realm carries with it all of the goodness and heightened generative promises, matching even the generative adversarial networks (GANs). Needless to say, recent years have witnessed a remarkable resurgence in statistical analyses of the GANs. Similar examinations for Autoencoders, however, despite their diverse applicability and notable empirical performance, remain largely absent. To close this gap, in this paper, we investigate the statistical properties of WAE. Firstly, we provide statistical guarantees that WAE achieves the target distribution in the latent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Domain Adaptation and Few-Shot Learning · Adversarial Robustness in Machine Learning
