avatarEtorezone

Free AI web copilot to create summaries, insights and extended knowledge, download it at here

1154

Abstract

i>=1<i>N</i>​∥∥​<i>Xi</i>​−<i>Xi</i>​∥∥​2</p><p id="6449">AE excels at learning compact data representations, but the latent space is not regularized, meaning it lacks specific constraints on the distribution of points in space <i>Z</i>. Consequently, while proficient in compression and reconstruction, AE cannot effectively generate new data.</p><p id="0d7e">Variational AutoEncoder (VAE):</p><p id="761e">In contrast, VAE introduces regularization into the latent space. It assumes that points in the latent space <i>Z</i> should follow a standard multivariate Gaussian distribution (<i>N</i>(0,1)). VAE reformulates the optimization problem to maximize the marginal likelihood <i>P</i>(<i>X</i>) while simultaneously minimizing the Kullback-Leibler (KL) divergence between the approximate distribution <i>Q</i>(<i>Z</i><i>X</i>) and the standard distribution.</p><p id="4a5c">Cost function formula for VAE:</p><p id="55b0"><i>LVAE</i>​=−<i>EQ</i>(<i>Z</i><i>X</i>)​[<i>logP</i>(<i>X</i><i>Z</i>)]+<i>DKL</i>​(<i>Q</i>(<i>Z</i><i>X</i>)∣∣<i>P</i>(<i>Z</i>))</p><figure id="4608"><img src="https://cdn-images-1.readmedium.com/v2/resize:fit:800/1*bA

Options

ajwSCoP67HTCWpnVnOCQ.png"><figcaption>Image source towardsdatascience — Illustration of the dimensionality reduction principle with encoder and decoder.</figcaption></figure><p id="7895">The first part of the cost function aims to maximize the reconstruction probability, while the second part penalizes significant deviations from the Gaussian pattern.</p><p id="0dde">Typical Use Cases:</p><ol><li>Anomaly Detection and Fraud Analysis: Both AE and VAE can be employed for detecting anomalous patterns in complex data.</li><li>Data Generation: VAE, owing to its generative capacity, is used in tasks such as image, music, and text generation, where creating new data is essential.</li><li>Dimensionality Reduction: Both methods are valuable for reducing the dimensionality of complex data while preserving essential features.</li></ol><figure id="fa1a"><img src="https://cdn-images-1.readmedium.com/v2/resize:fit:800/1*CPOytapUye7UMwEAqWUiCw.png"><figcaption>Image Denoising using Autoencoders</figcaption></figure><p id="2fe4">I hope this provides a deeper understanding of the differences between AE and VAE and their applications!</p></article></body>

Understanding the Differences Between AutoEncoder (AE) and Variational AutoEncoder (VAE)

Are you familiar with the nuances between AutoEncoder (AE) and Variational AutoEncoder (VAE)?

Yes, they exhibit fundamental differences!

While both are neural network-based techniques used for data compression and feature extraction, they operate differently, particularly concerning the latent space, a multidimensional space where data is compressed. The main distinction between AE and VAE lies in the regularization of the latent space, which has profound implications for data generation capabilities.

AutoEncoder (AE):

AE consists of two main parts: the encoder, which maps the input X to a latent space Z, and the decoder, which maps Z back to a reconstruction X^. The typical cost function for AE is the mean of the quadratic reconstruction, also known as the Mean Squared Error (MSE), between the original input and the reconstructed output.

Error formula:

LAE​=N1​∑i=1N​∥∥​Xi​−Xi​∥∥​2

AE excels at learning compact data representations, but the latent space is not regularized, meaning it lacks specific constraints on the distribution of points in space Z. Consequently, while proficient in compression and reconstruction, AE cannot effectively generate new data.

Variational AutoEncoder (VAE):

In contrast, VAE introduces regularization into the latent space. It assumes that points in the latent space Z should follow a standard multivariate Gaussian distribution (N(0,1)). VAE reformulates the optimization problem to maximize the marginal likelihood P(X) while simultaneously minimizing the Kullback-Leibler (KL) divergence between the approximate distribution Q(ZX) and the standard distribution.

Cost function formula for VAE:

LVAE​=−EQ(ZX)​[logP(XZ)]+DKL​(Q(ZX)∣∣P(Z))

Image source towardsdatascience — Illustration of the dimensionality reduction principle with encoder and decoder.

The first part of the cost function aims to maximize the reconstruction probability, while the second part penalizes significant deviations from the Gaussian pattern.

Typical Use Cases:

  1. Anomaly Detection and Fraud Analysis: Both AE and VAE can be employed for detecting anomalous patterns in complex data.
  2. Data Generation: VAE, owing to its generative capacity, is used in tasks such as image, music, and text generation, where creating new data is essential.
  3. Dimensionality Reduction: Both methods are valuable for reducing the dimensionality of complex data while preserving essential features.
Image Denoising using Autoencoders

I hope this provides a deeper understanding of the differences between AE and VAE and their applications!

Vae
Artificial Intelligence
Deep Learning
Gpt
Recommended from ReadMedium