A lower bound for the ELBO of the Bernoulli Variational Autoencoder

03/26/2020
by   Robert Sicks, et al.
0

We consider a variational autoencoder (VAE) for binary data. Our main innovations are an interpretable lower bound for its training objective, a modified initialization and architecture of such a VAE that leads to faster training, and a decision support for finding the appropriate dimension of the latent space via using a PCA. Numerical examples illustrate our theoretical result and the performance of the new architecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2019

Tutorial: Deriving the Standard Variational Autoencoder (VAE) Loss Function

In Bayesian machine learning, the posterior distribution is typically co...
research
03/25/2021

Variational Autoencoder-Based Vehicle Trajectory Prediction with an Interpretable Latent Space

This paper introduces the Descriptive Variational Autoencoder (DVAE), an...
research
02/13/2018

TVAE: Triplet-Based Variational Autoencoder using Metric Learning

Deep metric learning has been demonstrated to be highly effective in lea...
research
09/25/2020

Hierarchical Sparse Variational Autoencoder for Text Encoding

In this paper we focus on unsupervised representation learning and propo...
research
05/25/2021

Self-Organized Variational Autoencoders (Self-VAE) for Learned Image Compression

In end-to-end optimized learned image compression, it is standard practi...
research
10/24/2022

On the failure of variational score matching for VAE models

Score matching (SM) is a convenient method for training flexible probabi...
research
09/30/2017

Variational Grid Setting Network

We propose a new neural network architecture for automatic generation of...

Please sign up or login with your details

Forgot password? Click here to reset