Identifiability of deep generative models without auxiliary informationDownload PDF

Published: 31 Oct 2022, 18:00, Last Modified: 14 Jan 2023, 02:49NeurIPS 2022 AcceptReaders: Everyone
Keywords: deep generative models, variational autoencoders, identifiability, nonparametric statistics, latent variable models, representation learning
TL;DR: We prove identifiability of deep generative models that are universal approximators and are the decoders of VAEs used in practice.
Abstract: We prove identifiability of a broad class of deep latent variable models that (a) have universal approximation capabilities and (b) are the decoders of variational autoencoders that are commonly used in practice. Unlike existing work, our analysis does not require weak supervision, auxiliary information, or conditioning in the latent space. Specifically, we show that for a broad class of generative (i.e. unsupervised) models with universal approximation capabilities, the side information $u$ is not necessary: We prove identifiability of the entire generative model where we do not observe $u$ and only observe the data $x$. The models we consider match autoencoder architectures used in practice that leverage mixture priors in the latent space and ReLU/leaky-ReLU activations in the encoder, such as VaDE and MFC-VAE. Our main result is an identifiability hierarchy that significantly generalizes previous work and exposes how different assumptions lead to different ``strengths'' of identifiability, and includes certain ``vanilla'' VAEs with isotropic Gaussian priors as a special case. For example, our weakest result establishes (unsupervised) identifiability up to an affine transformation, and thus partially resolves an open problem regarding model identifiability raised in prior work. These theoretical results are augmented with experiments on both simulated and real data.
Supplementary Material: zip
10 Replies