A Statistical Analysis of Wasserstein Autoencoders for Intrinsically Low-dimensional Data
Not on the map. Why?
Abstract (arXiv)
Variational Autoencoders (VAEs) have gained significant popularity among researchers as a powerful tool for understanding unknown distributions based on limited samples. This popularity stems partly from their impressive performance and partly from their ability to provide meaningful feature representations in the latent space. Wasserstein Autoencoders (WAEs), a variant of VAEs, aim to not only improve model efficiency but also interpretability. However, there has been limited focus on analyzing their statistical guarantees. The matter is further complicated by the fact that the data distributions to which WAEs are applied - such as natural images - are often presumed to possess an underlying low-dimensional structure within a high-dimensional feature space, which current theory does not adequately account for, rendering known bounds inefficient. To bridge the gap between the theory and practice of WAEs, in this paper, we show that WAEs can learn the data distributions when the network architectures are properly chosen. We show that the convergence rates of the expected excess risk in the number of samples for WAEs are independent of the high feature dimension, instead relying only on the intrinsic dimension of the data distribution.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 24 Feb 2024.
Builds on
28 of 49 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Neural Discrete Representation Learningcited by 4,650
- 2021Zero-Shot Text-to-Image Generationcited by 4,276
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 762
- 2016Error bounds for approximations with deep ReLU networkscited by 567
- 2017Wasserstein Auto-Encoderscited by 371
- 2015Adversarial Autoencoderscited by 359
- 2016Adversarial Feature Learningcited by 350
- 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 307
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 304
16 more
- 2015DRAW: A Recurrent Neural Network For Image Generationcited by 190
- 2017InfoVAE: Information Maximizing Variational Autoencoderscited by 124
- 2017Adversarial Variational Bayes: Unifying Variational Autoencoders and Generative Adversarial Networkscited by 107
- 2018Variational Autoencoders Pursue PCA Directions (by Accident)cited by 84
- 2017Improved Variational Autoencoders for Text Modeling using Dilated Convolutionscited by 81
- 2018How Well Generative Adversarial Networks Learn Distributionscited by 78
- 2017Efficiently Trainable Text-to-Speech System Based on Deep Convolutional Networks with Guided Attentioncited by 57
- 2021An error analysis of generative adversarial networks for learning distributionscited by 35
- 2020Statistical guarantees for generative models without dominationcited by 27
- 2020Distribution Approximation and Statistical Estimation Guarantees of Generative Adversarial Networkscited by 23
- 2023On Deep Generative Models for Approximation and Estimation of Distributions on Manifoldscited by 12
- 2021Variational autoencoders in the presence of low-dimensional data: landscape and implicit biascited by 11
- 2023Deep Nonparametric Estimation of Intrinsic Data Structures by Chart Autoencoders: Generalization Error and Robustnesscited by 10
- 2024On the Statistical Properties of Generative Adversarial Models for Low Intrinsic Data Dimensioncited by 10
- 2021Statistical Regeneration Guarantees of the Wasserstein Autoencoder with Latent Space Consistencycited by 3
- 2021Non-Asymptotic Error Bounds for Bidirectional GANscited by 3
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.