DOCSLIB.ORG

Joint Training of Variational Auto-Encoder and Latent Energy-Based Model

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Joint Training of Variational Auto-Encoder and Latent Energy-Based Model Joint Training of Variational Auto-Encoder and Latent Energy-Based Model Tian Han1, Erik Nijkamp2, Linqi Zhou2, Bo Pang2, Song-Chun Zhu2, Ying Nian Wu2 1Department of Computer Science, Stevens Institute of Technology 2Department of Statistics, University of California, Los Angeles [email protected], {enijkamp,bopang}@ucla.edu, [email protected] {sczhu,ywu}@stat.ucla.edu Abstract learning and adversarial learning. Specifically, instead of employing a discriminator as in GANs, we recruit a latent This paper proposes a joint training method to learn both energy-based model (EBM) to mesh with VAE seamlessly the variational auto-encoder (VAE) and the latent energy- in a joint training scheme. based model (EBM). The joint training of VAE and latent The generator model in VAE is a directed model, with a EBM are based on an objective function that consists of known prior distribution on the latent vector, such as Gaus- three Kullback-Leibler divergences between three joint dis- sian white noise distribution, and a conditional distribution tributions on the latent vector and the image, and the objec- of the image given the latent vector. The advantage of such tive function is of an elegant symmetric and anti-symmetric a model is that it can generate synthesized examples by di- form of divergence triangle that seamlessly integrates vari- rect ancestral sampling. The generator model defines a joint ational and adversarial learning. In this joint training probability density of the latent vector and the image in a scheme, the latent EBM serves as a critic of the generator top-down scheme. We may call this joint density the gener- model, while the generator model and the inference model ator density. in VAE serve as the approximate synthesis sampler and in- VAE also has an inference model, which defines the con- ference sampler of the latent EBM. Our experiments show ditional distribution of the latent vector given the image. To- that the joint training greatly improves the synthesis qual- gether with the data distribution that generates the observed ity of the VAE. It also enables learning of an energy func- images, they define a joint probability density of the latent tion that is capable of detecting out of sample examples for vector and the image in a bottom-up scheme. We may call anomaly detection. this joint density the joint data density, where the latent vec- tor may be considered as the missing data in the language of the EM algorithm [6]. 1. Introduction As we shall explain later, the VAE amounts to joint mini- The variational auto-encoder (VAE) [23, 35] is a power- mization of the Kullback-Leibler divergence from data den- ful method for generative modeling and unsupervised learn- sity to the generator density, where the joint minimization ing. It consists of a generator model that transforms a noise is over the parameters of both the generator model and the vector to a signal such as image via a top-down convolu- inference model. In this minimization, the generator den- tional network (also called deconvolutional network due to sity seeks to cover the modes of the data density, and as a its top-down nature). It also consists of an inference model result, the generator density can be overly dispersed. This that infers the latent vector from the image via a bottom- may partially explain VAE’s lack of synthesis quality. up network. The VAE has seen many applications in im- Unlike the generator network, the latent EBM is an undi- age and video synthesis [12, 3] and unsupervised and semi- rected model. It defines an unnormalized joint density on supervised learning [37, 22]. the latent vector and the image via a joint energy func- Despite its success, the VAE suffers from relatively weak tion. Such undirected form enables the latent EBM to better synthesis quality compared to methods such as generative approximate the data density than the generator network. adversarial net (GANs) [11, 34] that are based on adversar- However, the maximum likelihood learning of latent EBM ial learning. While combing VAE objective function with requires (1) inference sampling: sampling from the condi- the GAN objective function can improve the synthesis qual- tional density of the latent vector given the observed ex- ity, such a combination is rather ad hoc. In this paper, we ample and (2) synthesis sampling: sampling from the joint shall pursue a more systematic integration of variational density of the latent vector and the image. Both inference 17978 sampling and synthesis sampling require time-consuming VAE and GAN took over, Boltzmann machine [1, 17, 36] Markov chain Monte Carlo (MCMC). and Helmholtz machine [16] are two classes of models for In this paper, we propose to jointly train the VAE and the generative modeling and unsupervised learning. Boltzmann latent EBM so that these two models can borrow strength machine is the most prominent example of latent EBM. The from each other. The objective function of the joint train- learning consists of two phases. The positive phase sam- ing method consists of the Kullback-Leibler divergences ples from the conditional distribution of the latent variables between three joint densities of the latent vector and the given the observed example. The negative phase samples image, namely the data density, the generator density, and from the joint distribution of the latent variables and the the latent EBM density. The three Kullback-Leilber diver- image. The parameters are updated based on the differ- gences form an elegant symmetric and anti-symmetric form ences between statistical properties of positive and negative of divergence triangle that integrates the variational learning phases. Helmholtz machine can be considered a precursor and the adversarial learning seamlessly. of VAE. It consists of a top-down generation model and the The joint training is beneficial to both the VAE and the bottom-up recognition model. The learning also consists latent EBM. The latent EBM has a more flexible form and of two phases. The wake phase infers the latent variables can approximate the data density better than the generator based on the recognition model and updates the parameters model. It serves as a critic of the generator model by judg- of the generation model. The sleep phase generates syn- ing it against the data density. To the generator model, the thesized data from the generation model and updates the latent EBM serves as a surrogate of the data density and a parameters of the recognition model. Our work seeks to target density for the generator model to approximate. The integrate the two classes of models. generator model and the associated inference model, in re- (3) Divergence triangle for joint training of genera- turn, serve as approximate synthesis sampler and inference tor network and energy-based model. The generator and sampler of the latent EBM, thus relieving the latent EBM of energy-based model can be trained separately using maxi- the burden of MCMC sampling. mum likelihood criteria as in [13, 33], and they can also be Our experiments show that the joint training method can trained jointly as recently explored by [20, 38, 14, 24]. In learn the generator model with strong synthesis ability. It particular, [14] proposes a divergence triangle criterion for can also learn an energy function that is capable of anomaly joint training. Our training criterion is also in the form of detection. divergence triangle. However, the EBM in these papers is only defined on the image and there is no latent vector in the 2. Contributions and related work EBM. In our work, we employ latent EBM which defines a joint density on the latent vector and the image, thus this The following are contributions of our work. (1) We pro- undirected joint density is more natural match to the gen- pose a joint training method to learn both VAE and latent erator density and the data density, both are directed joint EBM. The objective function is of a symmetric and anti- densities of the latent vector and the image. symmetric form of divergence triangle. (2) The proposed method integrates variational and adversarial learning. (3) The proposed method integrates the research themes initi- 3. Models and learning ated by the Boltzmann machine and Helmholtz machine. 3.1. Generator network The following are the themes that are related to our work. (1) Variational and adversarial learning. Over the past Let z be the d-dimensional latent vector. Let x be the few years, there has been an explosion in research on D-dimensional signal, such as an image. VAE consists of a variational learning and adversarial learning, inspired by generator model, which defines a joint probability density VAE [23, 35, 37, 12] and GAN [11, 34, 2, 41] respectively. One aim of our work is to find a natural integration of vari- pθ(x,z)= p(z)pθ(x|z), (1) ational and adversarial learning. We also compare with some prominent methods along this theme in our experi- in a top-down direction, where p(z) is the known prior dis- ments. Notably, adversarially learned inference (ALI) [9, 7] tribution of the latent vector z, such as uniform distribu- combines the learning of the generator model and inference tion or Gaussian white noise, i.e., z ∼ N(0,Id), where Id model in an adversarial framework. It can be improved by is the d-dimensional identity matrix. pθ(x|z) is the condi- adding conditional entropy regularization as in more recent tional distribution of x given z. A typical form of pθ(x|z) methods ALICE [26] and SVAE [4]. Though these meth- is such that x = gθ(z)+ ǫ, where gθ(z) is parametrized by ods are trained using joint discriminator on image and latent a top-down convolutional network (also called the deconvo- vector, such a discriminator is not a probability density, thus lutional network due to the top-down direction), with θ col- it is not a latent EBM.
Load more

Recommended publications
  • Training Energy-Based Models for Time-Series Imputation
    JournalofMachineLearningResearch14(2013)2771-2797 Submitted 1/13; Revised 5/13; Published 9/13 Training Energy-Based Models for Time-Series Imputation Philemon´ Brakel [email protected] Dirk Stroobandt [email protected] Benjamin Schrauwen [email protected] Department of Electronics and Information Systems University of Ghent Sint-Pietersnieuwstraat 41 9000 Gent, Belgium Editor: Yoshua Bengio Abstract Imputing missing values in high dimensional time-series is a difficult problem. This paper presents a strategy for training energy-based graphical models for imputation directly, bypassing difficul- ties probabilistic approaches would face. The training strategy is inspired by recent work on optimization-based learning (Domke, 2012) and allows complex neural models with convolutional and recurrent structures to be trained for imputation tasks. In this work, we use this training strat- egy to derive learning rules for three substantially different neural architectures. Inference in these models is done by either truncated gradient descent or variational mean-field iterations. In our experiments, we found that the training methods outperform the Contrastive Divergence learning algorithm. Moreover, the training methods can easily handle missing values in the training data it- self during learning. We demonstrate the performance of this learning scheme and the three models we introduce on one artificial and two real-world data sets. Keywords: neural networks, energy-based models, time-series, missing values, optimization 1. Introduction Many interesting data sets in fields like meteorology, finance, and physics, are high dimensional time-series. High dimensional time-series are also used in applications like speech recognition, motion capture and handwriting recognition. To make optimal use of such data, it is often necessary to impute missing values.
    [Show full text]
  • Boltzmann Machines and Energy-Based Models
    Boltzmann machines and energy-based models Takayuki Osogami IBM Research - Tokyo [email protected] Abstract We review Boltzmann machines and energy-based models. A Boltzmann machine defines a probability distribution over binary-valued patterns. One can learn parameters of a Boltzmann machine via gradient based approaches in a way that log likelihood of data is increased. The gradi- ent and Hessian of a Boltzmann machine admit beautiful mathematical representations, although computing them is in general intractable. This intractability motivates approximate methods, in- cluding Gibbs sampler and contrastive divergence, and tractable alternatives, namely energy-based models. 1 Introduction The Boltzmann machine has received considerable attention particularly after the publication of the seminal paper by Hinton and Salakhutdinov on autoencoder with stacked restricted Boltzmann ma- chines [21], which leads to today's success of and expectation to deep learning [54, 13] as well as a wide range of applications of Boltzmann machines such as collaborative filtering [1], classification of images and documents [33], and human choice [45, 47]. The Boltzmann machine is a stochastic (generative) model that can represent a probability distribution over binary patterns and others (see Section 2). The stochastic or generative capability of the Boltzmann machine has not been fully exploited in to- day's deep learning. For further advancement of the field, it is important to understand basics of the Boltzmann machine particularly from probabilistic perspectives. In this paper, we review fundamental properties of the Boltzmann machines with particular emphasis on probabilistic representations that allow intuitive interpretations in terms of probabilities. A core of this paper is in the learning rules based on gradients or stochastic gradients for Boltzmann machines (Section 3-Section 4).
    [Show full text]
  • Online Optimization with Energy Based Models
    Online Optimization with Energy Based Models by Yilun Du B.S., Massachusetts Institute of Technology (2019) Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Computer Science and Engineering at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2020 ○c Massachusetts Institute of Technology 2020. All rights reserved. Author................................................................ Department of Electrical Engineering and Computer Science May 15, 2020 Certified by. Leslie P. Kaelbling Professor Department of Electrical Engineering and Computer Science Thesis Supervisor Certified by. Tomas Lozano-Perez Professor Department of Electrical Engineering and Computer Science Thesis Supervisor Certified by. Joshua B. Tenenbaum Professor Department of Brain and Cognitive Science Thesis Supervisor Accepted by . Leslie A. Kolodziejski Professor of Electrical Engineering and Computer Science Chair, Department Committee on Graduate Students 2 Online Optimization with Energy Based Models by Yilun Du Submitted to the Department of Electrical Engineering and Computer Science on May 15, 2020, in partial fulfillment of the requirements for the degree of Master of Science in Computer Science and Engineering Abstract This thesis examines the power of applying optimization on learned neural networks, referred to as Energy Based Models (EBMs). We first present methods that enable scalable training of EBMs, allowing an optimization procedure to generate high resolu- tion images. We simultaneously show that resultant models are robust, compositional, and are further easy to learn online. Next we showcase how this optimization pro- cedure can also be used to formulate plans in interactive environments. We further showcase how a similar procedure can be used to learn neural energy functions for proteins, enabling structural recovery through optimization.
    [Show full text]
  • On Autoencoders and Score Matching for Energy Based Models
    On Autoencoders and Score Matching for Energy Based Models Kevin Swersky* [email protected] Marc'Aurelio Ranzatoy [email protected] David Buchman* [email protected] Benjamin M. Marlin* [email protected] Nando de Freitas* [email protected] *Department of Computer Science, University of British Columbia, Vancouver, BC V6T 1Z4, Canada yDepartment of Computer Science, University of Toronto, Toronto, ON M5S 2G4, Canada Abstract a long history in particular application areas including modeling natural images. We consider estimation methods for the class of continuous-data energy based mod- Recently, more sophisticated latent variable EBMs for els (EBMs). Our main result shows that es- continuous data including the PoT (Welling et al., timating the parameters of an EBM using 2003), mPoT (Ranzato et al., 2010b), mcRBM (Ran- score matching when the conditional distri- zato & Hinton, 2010), FoE (Schmidt et al., 2010) and bution over the visible units is Gaussian cor- others have become popular models for learning rep- responds to training a particular form of reg- resentations of natural images as well as other sources ularized autoencoder. We show how different of real-valued data. Such models, also called gated Gaussian EBMs lead to different autoencoder MRFs, leverage latent variables to represent higher architectures, providing deep links between order interactions between the input variables. In these two families of models. We compare the very active research area of deep learning (Hinton the score matching estimator for the mPoT et al., 2006), these models been employed as elemen- model, a particular Gaussian EBM, to several tary building blocks to construct hierarchical models other training methods on a variety of tasks that achieve very promising performance on several including image denoising and unsupervised perceptual tasks (Ranzato & Hinton, 2010; Bengio, feature extraction.
    [Show full text]
  • Learning Latent Space Energy-Based Prior Model
    Learning Latent Space Energy-Based Prior Model Bo Pang∗1 Tian Han∗2 Erik Nijkamp∗1 Song-Chun Zhu1 Ying Nian Wu1 1University of California, Los Angeles 2Stevens Institute of Technology {bopang, enijkamp}@ucla.edu [email protected] {sczhu, ywu}@stat.ucla.edu Abstract We propose to learn energy-based model (EBM) in the latent space of a generator model, so that the EBM serves as a prior model that stands on the top-down network of the generator model. Both the latent space EBM and the top-down network can be learned jointly by maximum likelihood, which involves short-run MCMC sampling from both the prior and posterior distributions of the latent vector. Due to the low dimensionality of the latent space and the expressiveness of the top-down network, a simple EBM in latent space can capture regularities in the data effectively, and MCMC sampling in latent space is efficient and mixes well. We show that the learned model exhibits strong performances in terms of image and text generation and anomaly detection. The one-page code can be found in supplementary materials. 1 Introduction In recent years, deep generative models have achieved impressive successes in image and text generation. A particularly simple and powerful model is the generator model [35, 21], which assumes that the observed example is generated by a low-dimensional latent vector via a top-down network, and the latent vector follows a non-informative prior distribution, such as uniform or isotropic Gaussian distribution. While we can learn an expressive top-down network to map the prior distribution to the data distribution, we can also learn an informative prior model in the latent space to further improve the expressive power of the whole model.
    [Show full text]