Variational autoencoder

Part of a series on
Machine learning and data mining
Paradigms Supervised learning Unsupervised learning Online learning Batch learning Meta-learning Semi-supervised learning Self-supervised learning Reinforcement learning Curriculum learning Rule-based learning Quantum machine learning
Problems Classification Generative modeling Regression Clustering Dimensionality reduction Density estimation Anomaly detection Data cleaning AutoML Association rules Semantic analysis Structured prediction Feature engineering Feature learning Learning to rank Grammar induction Ontology learning Multimodal learning
Supervised learning (classification • regression) Apprenticeship learning Decision trees Ensembles Bagging Boosting Random forest k-NN Linear regression Naive Bayes Artificial neural networks Logistic regression Perceptron Relevance vector machine (RVM) Support vector machine (SVM)
Clustering BIRCH CURE Hierarchical k-means Fuzzy Expectation–maximization (EM) DBSCAN OPTICS Mean shift
Dimensionality reduction Factor analysis CCA ICA LDA NMF PCA PGD t-SNE SDL
Structured prediction Graphical models Bayes net Conditional random field Hidden Markov
Anomaly detection RANSAC k-NN Local outlier factor Isolation forest
Artificial neural network Autoencoder Cognitive computing Deep learning DeepDream Feedforward neural network Kolmogorov–Arnold Network Recurrent neural network LSTM GRU ESN reservoir computing Restricted Boltzmann machine GAN Diffusion model SOM Convolutional neural network U-Net Transformer Vision Mamba Spiking neural network Memtransistor Electrochemical RAM (ECRAM)
Reinforcement learning Q-learning SARSA Temporal difference (TD) Multi-agent Self-play
Learning with humans Active learning Crowdsourcing Human-in-the-loop RLHF
Model diagnostics Coefficient of determination Confusion matrix Learning curve ROC curve
Mathematical foundations Kernel machines Bias–variance tradeoff Computational learning theory Empirical risk minimization Occam learning PAC learning Statistical learning VC theory
Machine-learning venues ECML PKDD NeurIPS ICML ICLR IJCAI ML JMLR
Related articles Glossary of artificial intelligence List of datasets for machine-learning research List of datasets in computer vision and image processing Outline of machine learning
v t e

In machine learning, a variational autoencoder (VAE) is an artificial neural network architecture introduced by Diederik P. Kingma and Max Welling. It is part of the families of probabilistic graphical models and variational Bayesian methods.^[1]

In addition to being seen as an autoencoder neural network architecture, variational autoencoders can also be studied within the mathematical formulation of variational Bayesian methods, connecting a neural encoder network to its decoder through a probabilistic latent space (for example, as a multivariate Gaussian distribution) that corresponds to the parameters of a variational distribution.

Thus, the encoder maps each point (such as an image) from a large complex dataset into a distribution within the latent space, rather than to a single point in that space. The decoder has the opposite function, which is to map from the latent space to the input space, again according to a distribution. By mapping a point to a distribution instead of a single point, the network can avoid overfitting the training data.^[2] Both networks are typically trained together with the usage of the reparameterization trick, although the variance of the noise model can be learned separately.

Although this type of model was initially designed for unsupervised learning,^[3][4] its effectiveness has been proven for semi-supervised learning^[5][6] and supervised learning.^[7]

Overview of architecture and operation

A variational autoencoder is a generative model with a prior and noise distribution respectively. Usually such models are trained using the expectation-maximization meta-algorithm (e.g. probabilistic PCA, (spike & slab) sparse coding). Such a scheme optimizes a lower bound of the data likelihood, which is usually intractable, and in doing so requires the discovery of q-distributions, or variational posteriors. These q-distributions are normally parameterized for each individual data point in a separate optimization process. However, variational autoencoders use a neural network as an amortized approach to jointly optimize across data points. This neural network takes as input the data points themselves, and outputs parameters for the variational distribution. As it maps from a known input space to the low-dimensional latent space, it is called the encoder.

The decoder is the second neural network of this model. It is a function that maps from the latent space to the input space, e.g. as the means of the noise distribution. It is possible to use another neural network that maps to the variance, however this can be omitted for simplicity. In such a case, the variance can be optimized with gradient descent.

To optimize this model, one needs to know two terms: the "reconstruction error", and the Kullback–Leibler divergence(KL-D). Both terms are derived from the free energy expression of the probabilistic model, and therefore differ depending on the noise distribution and the assumed prior of the data. For example, a standard VAE task such as IMAGENET is typically assumed to have a gaussianly distributed noise; however, tasks such as binarized MNIST require a Bernoulli noise. The KL-D from the free energy expression maximizes the probability mass of the q-distribution that overlaps with the p-distribution, which unfortunately can result in mode-seeking behaviour. The "reconstruction" term is the remainder of the free energy expression, and requires a sampling approximation to compute its expectation value.^[8]

Formulation

From the point of view of probabilistic modeling, one wants to maximize the likelihood of the data ${\displaystyle x}$ by their chosen parameterized probability distribution ${\displaystyle p_{\theta }(x)=p(x|\theta )}$. This distribution is usually chosen to be a Gaussian ${\displaystyle N(x|\mu ,\sigma )}$ which is parameterized by ${\displaystyle \mu }$ and ${\displaystyle \sigma }$ respectively, and as a member of the exponential family it is easy to work with as a noise distribution. Simple distributions are easy enough to maximize, however distributions where a prior is assumed over the latents ${\displaystyle z}$ results in intractable integrals. Let us find ${\displaystyle p_{\theta }(x)}$ via marginalizing over ${\displaystyle z}$.

${\displaystyle p_{\theta }(x)=\int _{z}p_{\theta }({x,z})\,dz,}$

where ${\displaystyle p_{\theta }({x,z})}$ represents the joint distribution under ${\displaystyle p_{\theta }}$ of the observable data ${\displaystyle x}$ and its latent representation or encoding ${\displaystyle z}$. According to the chain rule, the equation can be rewritten as

${\displaystyle p_{\theta }(x)=\int _{z}p_{\theta }({x|z})p_{\theta }(z)\,dz}$

In the vanilla variational autoencoder, ${\displaystyle z}$ is usually taken to be a finite-dimensional vector of real numbers, and ${\displaystyle p_{\theta }({x|z})}$ to be a Gaussian distribution. Then ${\displaystyle p_{\theta }(x)}$ is a mixture of Gaussian distributions.

It is now possible to define the set of the relationships between the input data and its latent representation as

• Prior ${\displaystyle p_{\theta }(z)}$
• Likelihood ${\displaystyle p_{\theta }(x|z)}$
• Posterior ${\displaystyle p_{\theta }(z|x)}$

Unfortunately, the computation of ${\displaystyle p_{\theta }(z|x)}$ is expensive and in most cases intractable. To speed up the calculus to make it feasible, it is necessary to introduce a further function to approximate the posterior distribution as

${\displaystyle q_{\phi }({z|x})\approx p_{\theta }({z|x})}$

with ${\displaystyle \phi }$ defined as the set of real values that parametrize ${\displaystyle q}$. This is sometimes called amortized inference, since by "investing" in finding a good ${\displaystyle q_{\phi }}$, one can later infer ${\displaystyle z}$ from ${\displaystyle x}$ quickly without doing any integrals.

In this way, the problem is to find a good probabilistic autoencoder, in which the conditional likelihood distribution ${\displaystyle p_{\theta }(x|z)}$ is computed by the probabilistic decoder, and the approximated posterior distribution ${\displaystyle q_{\phi }(z|x)}$ is computed by the probabilistic encoder.

Parametrize the encoder as ${\displaystyle E_{\phi }}$, and the decoder as ${\displaystyle D_{\theta }}$.

Evidence lower bound (ELBO)

As in every deep learning problem, it is necessary to define a differentiable loss function in order to update the network weights through backpropagation.

For variational autoencoders, the idea is to jointly optimize the generative model parameters ${\displaystyle \theta }$ to reduce the reconstruction error between the input and the output, and ${\displaystyle \phi }$ to make ${\displaystyle q_{\phi }({z|x})}$ as close as possible to ${\displaystyle p_{\theta }(z|x)}$. As reconstruction loss, mean squared error and cross entropy are often used.

As distance loss between the two distributions the Kullback–Leibler divergence ${\displaystyle D_{KL}(q_{\phi }({z|x})\parallel p_{\theta }({z|x}))}$ is a good choice to squeeze ${\displaystyle q_{\phi }({z|x})}$ under ${\displaystyle p_{\theta }(z|x)}$.^[8][9]

The distance loss just defined is expanded as

${\displaystyle {\begin{aligned}D_{KL}(q_{\phi }({z|x})\parallel p_{\theta }({z|x}))&=\mathbb {E} _{z\sim q_{\phi }(\cdot |x)}\left[\ln {\frac {q_{\phi }(z|x)}{p_{\theta }(z|x)}}\right]\\&=\mathbb {E} _{z\sim q_{\phi }(\cdot |x)}\left[\ln {\frac {q_{\phi }({z|x})p_{\theta }(x)}{p_{\theta }(x,z)}}\right]\\&=\ln p_{\theta }(x)+\mathbb {E} _{z\sim q_{\phi }(\cdot |x)}\left[\ln {\frac {q_{\phi }({z|x})}{p_{\theta }(x,z)}}\right]\end{aligned}}}$

Now define the evidence lower bound (ELBO):

Maximizing the ELBOis equivalent to simultaneously maximizing ${\displaystyle \ln p_{\theta }(x)}$ and minimizing ${\displaystyle D_{KL}(q_{\phi }({z|x})\parallel p_{\theta }({z|x}))}$. That is, maximizing the log-likelihood of the observed data, and minimizing the divergence of the approximate posterior ${\displaystyle q_{\phi }(\cdot |x)}$ from the exact posterior ${\displaystyle p_{\theta }(\cdot |x)}$.

The form given is not very convenient for maximization, but the following, equivalent form, is:

where ${\displaystyle \ln p_{\theta }(x|z)}$ is implemented as ${\displaystyle -{\frac {1}{2}}\|x-D_{\theta }(z)\|_{2}^{2}}$, since that is, up to an additive constant, what ${\displaystyle x\sim {\mathcal {N}}(D_{\theta }(z),I)}$ yields. That is, we model the distribution of ${\displaystyle x}$ conditional on ${\displaystyle z}$ to be a Gaussian distribution centered on ${\displaystyle D_{\theta }(z)}$. The distribution of ${\displaystyle q_{\phi }(z|x)}$ and ${\displaystyle p_{\theta }(z)}$ are often also chosen to be Gaussians as ${\displaystyle z|x\sim {\mathcal {N}}(E_{\phi }(x),\sigma _{\phi }(x)^{2}I)}$ and ${\displaystyle z\sim {\mathcal {N}}(0,I)}$, with which we obtain by the formula for KL divergence of Gaussians:Here ${\displaystyle N}$ is the dimension of ${\displaystyle z}$. For a more detailed derivation and more interpretations of ELBO and its maximization, see its main page.

Reparameterization

To efficiently search for

the typical method is gradient descent.

It is straightforward to find

However, does not allow one to put the ${\displaystyle \nabla _{\phi }}$ inside the expectation, since ${\displaystyle \phi }$ appears in the probability distribution itself. The reparameterization trick (also known as stochastic backpropagation^[10]) bypasses this difficulty.^[8][11][12]

The most important example is when ${\displaystyle z\sim q_{\phi }(\cdot |x)}$ is normally distributed, as ${\displaystyle {\mathcal {N}}(\mu _{\phi }(x),\Sigma _{\phi }(x))}$.

This can be reparametrized by letting ${\displaystyle {\boldsymbol {\varepsilon }}\sim {\mathcal {N}}(0,{\boldsymbol {I}})}$ be a "standard random number generator", and construct ${\displaystyle z}$ as ${\displaystyle z=\mu _{\phi }(x)+L_{\phi }(x)\epsilon }$. Here, ${\displaystyle L_{\phi }(x)}$ is obtained by the Cholesky decomposition:

Then we haveand so we obtained an unbiased estimator of the gradient, allowing stochastic gradient descent.

Since we reparametrized ${\displaystyle z}$, we need to find ${\displaystyle q_{\phi }(z|x)}$. Let ${\displaystyle q_{0}}$ be the probability density function for ${\displaystyle \epsilon }$, then ^{[clarification needed]}

where ${\displaystyle \partial _{\epsilon }z}$ is the Jacobian matrix of ${\displaystyle \epsilon }$ with respect to ${\displaystyle z}$. Since ${\displaystyle z=\mu _{\phi }(x)+L_{\phi }(x)\epsilon }$, this is

Variations

Many variational autoencoders applications and extensions have been used to adapt the architecture to other domains and improve its performance.

${\displaystyle \beta }$-VAE is an implementation with a weighted Kullback–Leibler divergence term to automatically discover and interpret factorised latent representations. With this implementation, it is possible to force manifold disentanglement for ${\displaystyle \beta }$ values greater than one. This architecture can discover disentangled latent factors without supervision.^[13][14]

The conditional VAE (CVAE), inserts label information in the latent space to force a deterministic constrained representation of the learned data.^[15]

Some structures directly deal with the quality of the generated samples^[16][17] or implement more than one latent space to further improve the representation learning.

Some architectures mix VAE and generative adversarial networks to obtain hybrid models.^[18][19][20]

See also

References