V ARIATIONAL A UTOENCODER WITH A RBITRARY C ONDITIONING
A BSTRACT
We propose a single neural probabilistic model based on variational autoencoder that can be conditioned on an arbitrary subset of observed features and then sample the remaining features in “one shot”.
The features may be both real-valued and categorical.
Training of the model is performed by stochastic variational Bayes.
The experimental evaluation on synthetic data, as well as feature imputation and image inpainting problems, shows the effectiveness of the proposed approach and diversity of the generated samples
I NTRODUCTION
In past years, a number of generative probabilistic models based on neural networks have been proposed.
The most popular approaches include variational autoencoder (Kingma & Welling, 2013) (VAE) and generative adversarial net (Goodfellow et al., 2014) (GANs).
They learn a distribution over objects p ( x ) and allow sampling from this distribution.
In many cases, we are interested in learning a conditional distribution p ( x | y ) .
For instance, if x is an image of a face, y could be the characteristics describing the face (are glasses present or not; length of hair, etc.)
Conditional variational autoencoder (Sohn et al., 2015) and conditional generative adversarial nets (Mirza & Osindero, 2014) are popular methods for this problem.
In this paper, we consider the problem of learning all conditional distributions of the form p ( x I | x
U \ I ) , where U is the set of all features and I is its arbitrary subset.
This problem generalizes both learning the joint distribution p ( x ) and learning the conditional distribution p ( x | y ) .
To tackle this problem, we propose a
Variational Autoencoder with Arbitrary Conditioning (VAEAC) model.
It is a latent variable model similar to VAE, but allows conditioning on an arbitrary subset of the features.
The conditioning features affect the prior on the latent Gaussian variables which are used to generate unobserved features.
The model is trained using stochastic gradient variational Bayes (Kingma & Welling, 2013).
We consider two most natural applications of the proposed model.
The ﬁrst one is feature imputation where the goal is to restore the missing features given the observed ones.
The imputed values may be valuable by themselves or may improve the performance of other machine learning algorithms which process the dataset.
Another application is image inpainting in which the goal is to ﬁll in an unobserved part of an image with an artiﬁcial content in a realistic way.
This can be used for removing unnecessary objects from the images or, vice versa, for complementing the partially closed or corrupted object.
The experimental evaluation shows that the proposed model successfully samples from the conditional distributions.
The distribution over samples is close to the true conditional distribution.
This property is very important when the true distribution has several modes.
The model is shown to be effective in feature imputation problem which helps to increase the quality of subsequent discriminative models on different problems from UCI datasets collection (Lichman, 2013).
We demonstrate that model can generate diverse and realistic image inpaintings on MNIST (LeCun et al., 1998), Omniglot (Lake et al., 2015) and CelebA (Liu et al., 2015) datasets, and works even better than the current state of the art inpainting techniques in terms of peak signal to noise ratio (PSNR).
The paper is organized as follows.
In section 2 we review the related works.
In section 3 we brieﬂy describe variational autoencoders and conditional variational autoencoders.
In section 4 we deﬁne the problem, describe the VAEAC model and its training procedure.
In section 5 we evaluate VAEAC.
Section 6 concludes the paper.
Appendix contains additional explanations, theoretical analysis, and experiments for VAEAC.
R ELATED W ORK
Universal Marginalizer (Douglas et al., 2017) is a model based on a feed-forward neural network which approximates marginals of unobserved features conditioned on observable values.
A related idea of an autoregressive model of joint probability was previously proposed in Germain et al.
and Uria et al. The description of the model and comparison with VAEAC are available in section 5.3.
Yoon et al.
(2018) propose a GANs-based model called GAIN which solves the same problem as VAEAC.
In contrast to VAEAC, GAIN does not use unobserved data during training, which makes it easier to apply to the missing features imputation problem.
Nevertheless, it turns into a disadvantage when the fully-observed training data is available but the missingness rate at the testing stage is high.
For example, in inpainting setting GAIN cannot learn the conditional distribution over MNIST digits given one horizontal line of the image while VAEAC can (see appendix D.4).
The comparison of VAEAC and GAIN on the missing feature imputation problem is given in section 5.1 and appendix D.2.
Rezende et al.
[Appendix F], Sohl-Dickstein et al.
(2015), Goyal et al.
(2017), and Bordes et al.
(2017) propose to ﬁll missing data with noise and run Markov chain with a learned transition operator.
The stationary distribution of such chains approximates the true conditional distribution of the unobserved features.
Bachman & Precup (2015) consider missing feature imputation in terms of Markov decision process and propose LSTM-based sequential decision making model to solve it.
Nevertheless, these methods are computationally expensive at the test time and require fully-observed training data.
Image inpainting is a classic computer vision problem.
Most of the earlier methods rely on local and texture information or hand-crafted problem-speciﬁc features (Bertalmio et al., 2000).
In past years multiple neural network based approaches have been proposed.
Pathak et al.
Yeh et al.
(2016) and Yang et al.
(2017) use different kinds and combinations of adversarial, reconstruction, texture and other losses.
Li et al.
(2017) focuses on face inpainting and uses two adversarial losses and one semantic parsing loss to train the generative model.
In Yeh et al.
GANs are ﬁrst trained on the whole training dataset.
The inpainting is an optimization procedure that ﬁnds the latent variables that explain the observed features best.
Then, the obtained latents are passed through the generative model to restore the unobserved portion of the image.
We can say that VAEAC is a similar model which uses prior network to ﬁnd a proper latents instead of solving the optimization problem.
All described methods aim to produce a single realistic inpainting, while VAEAC is capable of sampling diverse inpaintings.
Additionally, Yeh et al.
(2016), Yang et al.
(2017) and Yeh et al.
(2017) have high testtime computational complexity of inpainting, because they require an optimization problem to be solved.
On the other hand, VAEAC is a “single-shot” method with a low computational cost.
B ACKGROUND 3. V ARIATIONAL A UTOENCODER
Variational autoencoder (Kingma & Welling, 2013) (VAE) is a directed generative model with latent variables.
The generative process in variational autoencoder is as follows:
ﬁrst, a latent variable z is generated from the prior distribution p ( z ) , and then the data x is generated from the generative distribution p θ ( x | z ) , where θ are the generative model’s parameters.
This process induces the distribution p θ ( x ) =
E p ( z ) p θ ( x | z ) .
The distribution p θ ( x | z ) is modeled by a neural network with parameters θ .
p ( z ) is a standard Gaussian distribution.
The parameters θ are tuned by maximizing the likelihood of the training data points { x i } Ni =1 from the true data distribution p d ( x ) .
In general, this optimization problem is challenging due to intractable posterior inference.
However, a variational lower bound can be optimized efﬁciently using backpropagation and stochastic gradient descent:
[Equation]
Here q φ ( z | x ) is a proposal distribution parameterized by neural network with parameters φ that approximates the posterior p ( z | x, θ ) .
Usually this distribution is Gaussian with a diagonal covariance matrix.
The closer q φ ( z | x ) to p ( z | x, θ ) , the tighter variational lower bound L V AE ( θ, φ ) .
To compute the gradient of the variational lower bound with respect to φ , reparameterization trick is used: z = µ φ ( x ) + εσ φ ( x ) where ε ∼ N (0 , I ) and µ φ and σ φ are deterministic functions parameterized by neural networks.
So the gradient can be estimated using Monte-Carlo method for the ﬁrst term and computing the second term analytically:
[Equation]
So L V AE ( θ, φ ) can be optimized using stochastic gradient ascent with respect to φ and θ .
3. C ONDITIONAL V ARIATIONAL A UTOENCODER
Conditional variational autoencoder (Sohn et al., 2015) (CVAE) approximates the conditional distribution
p d ( x | y ) .
It outperforms deterministic models when the distribution p d ( x | y ) is multi-modal (diverse x s are probable for the given y ).
For example, assume that x is a real-valued image.
Then, a deterministic regression model with mean squared error loss would predict the average blurry value for x .
On the other hand, CVAE learns the distribution of x , from which one can sample diverse and realistic objects.
Variational lower bound for CVAE can be derived similarly to VAE by conditioning all considered distributions on y :
[Equation]
Similarly to VAE, this objective is optimized using the reparameterization trick.
Note that the prior distribution p ψ ( z | y ) is conditioned on y and is modeled by a neural network with parameters ψ .
Thus, CVAE uses three trainable neural networks, while VAE only uses two.
Also authors propose such modiﬁcations of CVAE as Gaussian stochastic neural network and hybrid model.
These modiﬁcations can be applied to our model as well.
Nevertheless, we don’t use them, because of their disadvantage which is described in appendix C.
V ARIATIONAL A UTOENCODER WITH A RBITRARY C ONDITIONING 4. P ROBLEM S TATEMENT
Consider a distribution p d ( x ) over a D -dimensional vector x with real or categorical components.
The components of the vector are called features .
Let binary vector b ∈ { 0 , 1 } D be the binary mask of unobserved features of the object.
Then we describe the vector of unobserved features as x b = { x i : b i =1 } .
For example, x (0 , 1 , 1 , 0 , 1) =
( x 2 , x 3 , x 5 ) .
Using this notation we denote x 1 − b as a vector of observed features .
Our goal is to build a model of the conditional distribution p ψ,θ ( x b | x 1 − b , b )
≈ p d ( x b | x 1 − b , b ) for an arbitrary b , where ψ and θ are parameters that are used in our model at the testing stage.
However, the true distribution p d ( x b | x 1 − b , b ) is intractable without strong assumptions about p d ( x ) .
Therefore, our model p ψ,θ ( x b | x 1 − b , b ) has to be more precise for some b and less precise for others.
To formalize our requirements about the accuracy of our model we introduce the distribution p ( b ) over different unobserved feature masks.
The distribution p ( b ) is arbitrary and may be deﬁned by the user depending on the problem.
Generally it should have full support over { 0 , 1 } D so that p ψ,θ ( x b | x 1 − b , b ) can evaluate arbitrary conditioning.
Nevertheless, it is not necessary if the model is used for speciﬁc kinds of conditioning (as we do in section 5.2).
Using p ( b ) we can introduce the following log-likelihood objective function for the model:
[Equation]
The special cases of the objective (4) are variational autoencoder ( b i = 1 ∀ i ∈ { 1 , . . .
, D } ) and conditional variational autoencoder ( b is constant).
4. M ODEL D ESCRIPTION
The generative process of our model is similar to the generative process of CVAE: for each object ﬁrstly we generate z ∼ p ψ ( z | x 1 − b , b ) using prior network, and then sample unobserved features x b ∼ p θ ( x b | z, x 1 − b , b ) using generative network.
This process induces the following model distribution over unobserved features:
[Equation]
We use z ∈ R d , and Gaussian distribution p ψ over z , with parameters from a neural network with weights ψ : p ψ ( z | x 1 − b , b, ψ ) =
N ( z | µ ψ ( x 1 − b , b ) , σ 2 ψ ( x 1 − b , b ) I ) .
The real-valued components of distribution p θ ( x b | z, x 1 − b , b ) are deﬁned likewise.
Each categorical component i of distribution p θ ( x i | z, x 1 − b , b ) is parameterized by a function w i,θ ( z, x 1 − b , b ) , whose outputs are logits of probabilities for each category: x i ∼ Cat[Softmax( w i,θ ( z, x 1 − b , b ))] .
Therefore the components of the latent vector z are conditionally independent given x 1 − b and b , and the components of x b are conditionally independent given z , x 1 − b and b .
The variables x b and x 1 − b have variable length that depends on b .
So in order to use architectures such as multi-layer perceptron and convolutional neural network we consider x 1 − b = x ◦ (1 − b ) where ◦ is an element-wise product.
So in implementation x 1 − b has ﬁxed length.
The output of the generative network also has a ﬁxed length, but we use only unobserved components to compute likelihood.
The theoretical analysis of the model is available in appendix B.1.
4. L EARNING V ARIATIONAL A UTOENCODER WITH A RBITRARY C ONDITIONING 4.3. V ARIATIONAL L OWER B OUND
We can derive a lower bound for log p ψ,θ ( x b | x 1 − b , b ) as for variational autoencoder:
[Equation]
Therefore we have the following variational lower bound optimization problem:
[Equation]
We use fully-factorized Gaussian proposal distribution q φ which allows us to perform reparameterization trick and compute KL divergence analytically in order to optimize (7)
[Equation]
4.3. P RIOR I N L ATENT S PACE
During the optimization of objective (7) the parameters µ ψ and σ ψ of the prior distribution of z may tend to inﬁnity, since there is no penalty for large values of those parameters.
We usually observe the growth of (cid:107) z (cid:107) 2 during training, though it is slow enough.
To prevent potential numerical instabilities, we put a
Normal-Gamma prior on the parameters of the prior distribution to prevent the divergence.
Formally, we redeﬁne p ψ ( z | x 1 − b , b ) as follows:
[Equation]
As a result, the regularizers − µ 2 ψ 2 σ 2 µ and σ σ (log( σ ψ ) − σ ψ ) are added to the model log-likelihood.
Hyperparameter σ µ is chosen to be large ( 10 4 ) and σ σ is taken to be a small positive number ( 10 − 4 ).
This distribution is close to uniform near zero, so it doesn’t affect the learning process signiﬁcantly.
4.3. M ISSING F EATURES
The optimization objective (7) requires all features of each object at the training stage: some of the features will be observed variables at the input of the model and other will be unobserved features used to evaluate the model.
Nevertheless, in some problem settings the training data contains missing features too.
We propose the following slight modiﬁcation of the problem (7) in order to cover such problems as well.
The missing values cannot be observed so x i =
ω ⇒ b i = 1 , where ω describes the missing value in the data.
In order to meet this requirement, we redeﬁne mask distribution as conditioned on x : p ( b ) turns into p ( b | x ) in (4) and (7).
In the reconstruction loss (5) we simply omit the missing features, i. e. marginalize them out:
[Equation]
The proposal network must be able to determine which features came from real object and which are just missing.
So we use additional missing features mask which is fed to proposal network together with unobserved features mask b and object x .
The proposed modiﬁcations are evaluated in section 5.1.
[Table]
E XPERIMENTS
In this section we validate the performance of VAEAC using several real-world datasets.
In the ﬁrst set of experiments we evaluate VAEAC missing features imputation performance using various UCI datasets (Lichman, 2013).
We compare imputations from our model with imputations from such classical methods as
MICE (Buuren & Groothuis-Oudshoorn, 2010) and MissForest (Stekhoven & B¨uhlmann, 2011) and recently proposed GANs-based method GAIN (Yoon et al., 2018).
In the second set of experiments we use VAEAC to solve image inpainting problem.
We show inpainitngs generated by VAEAC and compare our model with models from papers Pathak et al.
Yeh et al.
(2017) and Li et al.
(2017) in terms of peak signal-to-noise ratio (PSNR) of obtained inpaintings on CelebA dataset (Liu et al., 2015) .
And ﬁnally, we evaluate VAEAC against the competing method called Universal Marginalizer (Douglas et al., 2017).
Additional experiments can be found in appendices C and D.
The code is available at https://github.com/tigvarts/ vaeac .
5. M ISSING F EATURES I MPUTATION
The datasets with missing features are widespread.
Consider a dataset with D -dimensional objects x where each feature may be missing (which we denote by x i = ω ) and their target values y .
The majority of discriminative methods do not support missing values in the objects.
The procedure of ﬁlling in the missing features values is called missing features imputation.
In this section we evaluate the quality of imputations produced by VAEAC.
For evaluation we use datasets from UCI repository (Lichman, 2013).
Before training we drop randomly 50% of values both in train and test set.
After that we impute missing features using MICE (Buuren & Groothuis-Oudshoorn, 2010), MissForest (Stekhoven & B¨uhlmann, 2011), GAIN (Yoon et al., 2018) and VAEAC trained on the observed data.
The details of GAIN implementation are described in appendix A.4.
Our model learns the distribution of the imputations, so it is able to sample from this distribution.
We replace each object with missing features by n = 10 objects with sampled imputations, so the size of the dataset increases by n times.
This procedure is called missing features multiple imputation .
MICE and GAIN are also capable of multiple imputation (we use n = 10 for them in experiments as well), but MissForest is not.
For more details about the experimental setup see appendices A.1, A.2, and A.4.
In table 1 we report NRMSE (i.e. RMSE normalized by the standard deviation of each feature and then averaged over all features) of imputations for continuous datasets and proportion of falsely classiﬁed (PFC) for categorical ones.
For multiple imputation methods we average imputations of continuous variables and take most frequent imputation for categorical ones for each object.
We also learn linear or logistic regression and report the regression or classiﬁcation performance after applying imputations of different methods in table 2.
For multiple imputation methods we average predictions for continuous targets and take most frequent prediction for categorical ones for each object in test set.
[Table]
As can be seen from the tables 1 and 2, VAEAC can learn joint data distribution and use it for missing feature imputation.
The imputations are competitive with current state of the art imputation methods in terms of RMSE, PFC, post-imputation regression R2-score and classiﬁcation accuracy.
Nevertheless, we don’t claim that our method is state of the art in missing features imputation; for some datasets MICE or
MissForest outperform it.
The additional experiments can be found in appendix D.2.
5. I MAGE I NPAINTING
The image inpainting problem has a number of different formulations.
The formulation of our interest is as follows: some of the pixels of an image are unobserved and we want to restore them in a natural way.
Unlike the majority of papers, we want to restore not just one most probable inpainting, but the distribution over all possible inpaintings from which we can sample.
This distribution is extremely multi-modal because often there is a lot of different possible ways to inpaint the image.
Unlike the previous subsection, here we have uncorrupted images without missing features in the training set, so p ( b | x ) = p ( b ) .
As we show in section 2, state of the art results use different adversarial losses to achieve more sharp and realistic samples.
VAEAC can be adapted to the image inpainting problem by using a combination of those adversarial losses as a part of reconstruction loss p θ ( x b | z, x 1 − b , b ) .
Nevertheless, such construction is out of scope for this research, so we leave it for the future work.
In the current work we show that the model can generate both diverse and realistic inpaintings.
In ﬁgures 1, 2, 3 and 4 we visualize image inpaintings produced by VAEAC on binarized MNIST (LeCun et al., 1998), Omniglot (Lake et al., 2015) and CelebA (Liu et al., 2015).
The details of learning procedure and description of datasets are available in appendixes A.1 and A.3.
To the best of our knowledge, the most modern inpainting papers don’t consider the diverse inpainting problem, where the goal is to build diverse image inpaintings, so there is no straightforward way to compare with these models.
Nevertheless, we compute peak signal-to-noise ratio (PSNR) for one random inpainting from VAEAC and the best PSNR among 10 random inpaintings from VAEAC.
One inpainting might not be similar to the original image, so we also measure how good the inpainting which is most similar to the original image reconstructs it.
We compare these two metrics computed for certain masks with the PSNRs for the same masks on CelebA from papers Yeh et al.
(2017) and Li et al.
The results are available in tables 3 and 4.
We observe that for the majority of proposed masks our model outperforms the competing methods in terms of PSNR even with one sample, and for the rest (where the inpaintings are signiﬁcantly diverse) the best
PSNR over 10 inpaintings is larger than the same PSNR of the competing models.
Even if PSNR does not reﬂect completely the visual quality of images and tends to encourage blurry VAE samples instead of realistic GANs samples, the results show that VAEAC is able to solve inpainting problem comparably to the state of the art methods.
The disadvantage of VAEAC compared to Yeh et al.
(2017) and Li et al.
(but
[Table]
[Table]
[Table] not Pathak et al.
(2016)) is that it needs the distribution over masks at the training stage to be similar to the distribution over them at the test stage.
However, it is not a very strict limitation for the practical usage.
5. U NIVERSAL M ARGINALIZER
Universal Marginalizer (Douglas et al., 2017) (UM) is a model which uses a single neural network to estimate the marginal distributions over the unobserved features.
So it optimizes the following objective:
[Equation]
For given mask b we ﬁx a permutation of its unobserved components: ( i 1 , i 2 , . . .
, i | b | ) , where | b | is a number of unobserved components.
Using the learned model and the permutation we can generate objects from joint distribution and estimate their probability using chain rule.
[Equation]
For example, p θ ( x 1 , x 4 , x 5 | x 2 , x 3 ) =
p θ ( x 4 | x 2 , x 3 ) p θ ( x 1 | x 2 , x 3 , x 4 ) p θ ( x 5 | x 1 , x 2 , x 3 , x 4 ) .
Conditional sampling or conditional likelihood estimation for one object requires | b | requests to UM to compute p θ ( x i | x 1 − b , b ) .
Each request is a forward pass through the neural network.
In the case of conditional sampling those requests even cannot be paralleled because the input of the next request contains the output of the previous one.
We propose a slight modiﬁcation of the original UM training procedure which allows learning UM efﬁciently for any kind of masks including those considered in this paper.
The details of the modiﬁcation are described in appendix B.3.
[Table]
The results of using this modiﬁcation of UM are provided in table 5.
We can say that the relation between
VAEAC and UM is similar to the relation between VAE and PixelCNN.
The second one is much slower at the testing stage, but it easily takes into account local dependencies in data while the ﬁrst one is faster but assumes conditional independence of the outputs.
Nevertheless, there are a number of cases where
UM cannot learn the distribution well while VAEAC can.
For example, when the data is real-valued and marginal distributions have many local optima, there is no straightforward parametrization which allows UM to approximate them, and, therefore also the conditioned joint distribution.
An example of such distribution and more illustrations for comparison of VAEAC and UM are available in appendix D.5.
C ONCLUSION
In this paper we consider the problem of simultaneous learning of all conditional distributions for a vector.
This problem has a number of different special cases with practical applications.
We propose neural network based probabilistic model for distribution conditioning learning with Gaussian latent variables.
This model is scalable and efﬁcient in inference and learning.
We propose several tricks to improve optimization and give recommendations about hyperparameters choice.
The model is successfully applied to feature imputation and inpainting tasks.
The experimental results show that the model is competitive with state of the art methods for both missing features imputation and image inpainting problems.
A PPENDIX A E XPERIMENTAL D ETAILS A. N EURAL N ETWORK A RCHITECTURES
In all experiments we use optimization method Adam (Kingma & Ba, 2014), skip-connections between prior network and generative network inspired by (Mao et al., 2016), (Sønderby et al., 2016) and (Ronneberger et al., 2015) and convolutional neural networks based on ResNet blocks (He et al., 2016).
Without skip-connections all information for decoder goes through the latent variables.
In image inpainting we found skip-connections very useful in both terms of log-likelihood improvement and the image realism, because latent variables are responsible for the global information only while the local information passes through skip-connections.
Therefore the border between image and inpainting becomes less conspicuous.
The main idea of neural networks architecture is reﬂected in ﬁgure [Figure]
The number of hidden layers, their widths and structure may be different.
The neural networks we used for image inpainting have He-Uniform initialization of convolutional ResNet blocks, and the skip-connections are implemented using concatenation, not addition.
The proposal network structure is exactly the same as the prior network except skip-connections.
Also one could use much simpler fully-connected networks with one hidden layer as a proposal, prior and generative networks in VAEAC and still obtain nice inpaintings on MNIST.
A. M ISSING F EATURES I MPUTATION
We split the dataset into train and test set with size ratio 3:1.
Before training we drop randomly 50% of values both in train and test set.
We repeat each experiment 5 times with different train-test splits and dropped features and then average results and compute their standard deviation.
As we show in appendix B.2, the better results can be achieved when the model learns the concatenation of objects features x and targets y .
So we treat y as an additional feature that is always unobserved during the testing time.
To train our model we use distribution p ( b i | x ) in which p ( b i | x i = ω ) = 1 and p ( b i | x ) = 0 .
2 otherwise.
Also for VAEAC trainig we normalize real-valued features, ﬁx σ θ = 1 in the generative model of VAEAC in order to optimize RMSE, and use 25% of training data as validation set to select the best model among all epochs of training.
For the test set, the classiﬁer or regressor is applied to each of the n imputed objects and the predictions are combined.
For regression problems we report R2-score of combined predictions, so we use averaging as a combination method.
For classiﬁcation problem we report accuracy, and therefore choose the mode.
We consider the workﬂow where the imputed values of y are not fed to the classiﬁer or regressor to make a fair comparison of feature imputation quality. [Table]
NRMSE or PFC for dataset is computed as an average of NRMSE or PFC of all features of this dataset.
NRMSE of a feature is just RMSE of imputations divided by the standard deviation of this feature.
PFC of a feature is a proportion of imputations which are incorrect.
A. I MAGE I NPAINTING D ATASETS AND M ASKS
MNIST is a dataset of 60000 train and 10000 test grayscale images of digits from 0 to 9 of size 28x28.
We binarize all images in the dataset.
For MNIST we consider Bernoulli log-likelihood as the reconstruction loss: log p θ ( x b | z, x 1 − b , b ) =
(cid:80) i :
b i =1 log Bernoulli( x i | p θ,i ( z, x 1 − b , b )) where p θ,i ( z, x 1 − b , b ) is an output of the generative neural network.
We use 16 latent variables.
In the mask for this dataset the observed pixels form a three pixels wide horizontal line which position is distributed uniformly.
Omniglot is a dataset of 19280 train and 13180 test black-and-white images of different alphabets symbols of size 105x105.
As in previous section, the brightness of each pixel is treated as a Bernoulli probability of it to be 1.
The mask we use is a random rectangular which is described below.
We use 64 latent variables.
We train model for 50 epochs and choose best model according to IWAE log-likelihood estimation on the validation set after each epoch.
CelebA is a dataset of 162770 train, 19867 validation and 19962 test color images of faces of celebrities of size 178x218.
Before learning we normalize the channels in dataset.
We use logarithm of fully-factorized
Gaussian distribution as reconstruction loss.
The mask we use is a random rectangular which is describe below.
We use 32 latent variables.
Rectangular mask is the common shape of unobserved region in image inpainting.
We use such mask for
Omniglot and Celeba.
We sample the corner points of rectangles uniprobably on the image, but reject those rectangles which area is less than a quarter of the image area.
In Li et al.
(2017) six different masks O1–O6 are used on the testing stage.
We reconstruct the positions of masks from the illustrations in the paper and give their coordinates in table 6.
The visualizations of the masks are available in ﬁgure 10.
At the training stage we used a rectangle mask with uniprobable random corners.
We reject masks with width or height less than 16pt.
We use 64 latent variables and take the best model over 50 epochs based on the validation IWAE log-likelihood estimation.
We can obtain slightly higher PSNR values than reported in table 4 if use only masks O1–O6 at the training stage.
In Yeh et al.
(2017) four types of masks are used.
Center mask is just an unobserved 32x32 square in the center of 64x64 image.
Half mask mean that one of upper, lower, left or right half of the image is unobserved.
All these types of a half are equiprobable.
Random mask means that we use pixelwise-independent Bernoulli distribution with probability 0.8 to form a mask of unobserved pixels.
Pattern mask is proposed in Pathak et al.
As we deduced from the code 3 , the generation process is follows: ﬁrstly we generate 600x one-channel image with uniform distribution over pixels, then bicubically interpolate it to image of size 10000x10000, and then apply Heaviside step function H ( x − 0 . 25) (i. e. all points with value less than 0.
are considered as unobserved).
To sample a mask we sample a random position in this 10000x10000 binary image and crop 64x64 mask.
If less than 20% or more than 30% of pixel are unobserved, than the mask is rejected and the position is sampled again.
In comparison with this paper in section 5.2 we use the same distribution over masks at training and testing stages.
We use VAEAC with 64 latent variables and take the best model over 50 epochs based on the validation IWAE log-likelihood estimation.
A. GAIN I MPLEMENTATION D ETAILS
For missing feature imputation we reimplemented GAIN in PyTorch based on the paper (Yoon et al., 2018) and the available TensorFlow source code for image inpainting 4 .
For categorical features we use one-hot encoding.
We observe in experiments that it works better in terms of
NRMSE and PFC than processing categorical features in GAIN as continuous ones and then rounding them to the nearest category.
For categorical features we also use reconstruction loss L M ( x i , x (cid:48) i )
= − 1 |
X i | (cid:80) | X i | j
=1 x i,j log( x (cid:48) i,j ) .
| X i | is the number of categories of the i -th feature, and x i,j is the j -th component of one-hot encoding of the feature x i .
Such L M enforces equal contribution of each categorical feature into the whole reconstruction loss.
We use one more modiﬁcation of L M ( x, x (cid:48) ) for binary and categorical features.
Cross-entropy loss in L M penalizes incorrect reconstructions of categorical and binary features much more than incorrect reconstructions for continuous ones.
To avoid such imbalance we mixed L2 and cross-entropy reconstruction losses for binary and categorical features with weights 0.8 and 0.2 respectively:
[Equation]
We observe in experiments that this modiﬁcation also works better in terms of NRMSE and PFC than the original model.
We use validation set which contains 5% of the observed features for the best model selection (hyperparameter is the number of iterations).
In the original GAIN paper authors propose to use cross-validation for hyper-parameter α ∈ { 0 . 1 , 0 . 5 , 1 , 2 , 10 } .
We observe that using α = 10 and a hint h
= b ◦ m + 0 .
5(1 − b ) where vector b is sampled from Bernoulli distribution with p = 0 .
01 provides better results in terms of
NRMSE and PFC than the original model with every α ∈ { 0 . 1 , 0 . 5 , 1 , 2 , 10 } .
Such hint distribution makes model theoretically inconsistent but works well in practice (see table 7).
Table 7 shows that our modiﬁcations provide consistently not worse or even better imputations than the original GAIN (in terms of NRMSE and PFC, on the considered datasets).
So in this paper for the missing feature imputation problem we report the results of our modiﬁcation of GAIN. [Table]
B T HEORY B. VAEAC U NIVERSALITY
The theoretical guarantees that VAEAC can model arbitrary distribution are based on the same guarantees for Condtitional Variational Autoencoder (CVAE).
We prove below that if CVAE can model each of the conditional distributions p ( x b | x 1 − b ) , then VAEAC can model all of them.
We can imagine 2 D CVAEs learned each for the certain mask.
Because neural networks are universal approximators, VAEAC networks could model the union of CVAE networks, so that VAEAC network performs transformation deﬁned by the same network of the corresponding to the given mask CVAE.
[Equation]
So if CVAE models any distribution p ( x | y ) , VAEAC also do.
The guarantees for CVAE in the case of continuous variables are based on the point that every smooth distribution can be approximated with a large enough mixture of Gaussians, which is a special case of CVAE’s generative model.
These guarantees can be extended on the case of categorical-continuous variables also.
Actually, there are distributions over categorical variables which CVAE with Gaussian prior and proposal distributions cannot learn.
Nevertheless, this kind of limitation is not fundamental and is caused by poor proposal distribution family.
B. W HY VAEAC N EEDS T ARGET V ALUES FOR M ISSING F EATURES I MPUTATION ?
Consider a dataset with D -dimensional objects x where each feature may be missing (which we denote by x i = ω ) and their target values y .
In this section we show that the better results are achieved when our model learns the concatenation of objects features x and targets y .
The example that shows the necessity of it is following.
Consider a dataset where x 1 = 1 , x 2 ∼ N ( x 2 | y, 1) , p d ( y = 0)
=
p ( y = 5) = 0 .
In this case p d ( x 2 | x 1 = 1) = 0 .
5 N ( x 2 | 0 , 1) + 0 .
5 N ( x 2 | 5 , 1) .
We can see that generating data from p d ( x 2 | x 1 ) may only confuse the classiﬁer, because with probability 0 .
5 it generates x 2 ∼ N (0 , 1) for y = 5 and x 2 ∼ N (5 , 1) for y = 0 .
On the other hand, p d ( x 2 | x 1 , y ) =
N ( x 2 | y, 1) .
Filling gaps using p d ( x 2 | x 1 , y ) may only improve classiﬁer or regressor by giving it some information from the joint distribution p d ( x, y ) and thus simplifying the dependence to be learned at the training time.
So we treat y as an additional feature that is always unobserved during the testing time.
B. U NIVERSAL M ARGINALIZER : T RAINING P ROCEDURE M ODIFICATION
The problem authors did not address in the original paper is the relation between the distribution of unobserved components p ( b ) at the testing stage and the distribution of masks in the requests to UM ˆ p ( b ) .
The distribution over masks p ( b ) induces the distribution ˆ p ( b ) , and in the most cases p ( b ) (cid:54) =
ˆ p ( b ) .
The distribution ˆ p ( b ) also depends on the permutations ( i 1 , i 2 , . .
, i | b | ) that we use to generate objects.
We observed in experiments, that UM must be trained using unobserved mask distribution ˆ p ( b ) .
For example, if all masks from p ( b ) have a ﬁxed number of unobserved components (e. g., D 2 ), then UM will never see an example of mask with 1 , 2 , . . .
, D 2 − 1 unobserved components, which is necessary to generate a sample conditioned on D 2 components.
That leads to drastically low likelihood estimate for the test set and unrealistic samples.
We developed an easy generative process for ˆ p ( b ) for arbitrary p ( b ) if the permutation of unobserved components ( i 1 , i 2 , . .
, i | b | ) is chosen randomly and equiprobably: ﬁrstly we generate b 0 ∼ p ( b ) , u ∼ U [0 , 1] , then b 1 ∼ (Bernoulli( u )) D and b = b 0 ◦ b 1 .
More complicated generative process exists for a sorted permutation where i j − 1 < i j ∀ j : 2 ≤ j ≤ | b | .
In experiments we use uniform distribution over the permutations.
C G AUSSIAN S TOCHASTIC N EURAL N ETWORK
Gaussian stochastic neural network (13) and hybrid model (14) are originally proposed in the paper on
Conditional VAE (Sohn et al., 2015).
The motivation authors mention in the paper is as follows.
During training the proposal distribution q φ ( z | x, y ) is used to generate the latent variables z , while during the testing stage the prior p ψ ( z | y ) is used.
KL divergence tries to close the gap between two distributions but, according to authors, it is not enough.
To overcome the issue authors propose to use a hybrid model (14), a weighted mixture of variational lower bound (3) and a single-sample Monte-Carlo estimation of log-likelihood (13).
The model corresponding to the second term is called Gaussian Stochastic Neural Network (13), because it is a feed-forward neural network with a single Gaussian stochastic layer in the middle.
Also GSNN is a special case of CVAE where q φ ( z | x, y ) =
p ψ ( z | y ) .
[Equation]
[Equation]
Authors report that hybrid model and GSNN outperform CVAE in terms of segmentation accuracy on the majority of datasets.
We can also add that this technique seems to soften the “holes problem” (Makhzani et al., 2016).
In
Makhzani et al.
(2016) authors observe that vectors z from prior distribution may be different enough from all vectors z from the proposal distribution at the training stage, so the generator network may be confused at the testing stage.
Due to this problem CVAE can have good reconstructions of y given z ∼ q φ ( z | x, y ) , while samples of y given z ∼ p ψ ( z | x ) are not realistic.
The same trick is applicable to our model as well:
[Equation]
In order to reﬂect the difference between sampling z from prior and proposal distributions, authors of CVAE use two methods of log-likelihood estimation:
[Equation]
The ﬁrst estimator is called Monte-Carlo estimator and the second one is called Importance Sampling estimator (also known as IWAE).
They are asymptotically equivalent, but in practice the Monte-Carlo estimator requires much more samples to obtain the same accuracy of estimation.
Small S leads to underestimation of the log-likelihood for both Monte-Carlo and Importance Sampling (Burda et al., 2015), but for Monte-Carlo the underestimation is expressed much stronger.
We perform an additional study of GSNN and hybrid model and show that they have drawbacks when the target distribution p ( x | y ) is has multiple different local maximums.
C. T HEORETICAL S TUDY
In this section we show why GSNN cannot learn distributions with several different modes and leads to a blurry image samples.
For the simplicity of the notation we consider hybrid model for a standard VAE:
[Equation]
The hybrid model (16) for VAEAC can be obtained from (19) by replacing x with x b and conditioning all distributions on x 1 − b and b .
The validity of the further equations and conclusions remains for VAEAC after this replacement.
Consider now a categorical latent variable z which can take one of K values.
Let x be a random variable with true distribution p d ( x ) to be modeled.
Consider the following true data distribution: p d ( x = x i )
= 1 K for i ∈ { 1 , 2 , . . .
, K } and some values x 1 , x 2 , . . .
, x K .
So the true distribution has K different equiprobable modes.
Suppose the generator network NN θ which models mapping from z to some vector of parameters v z =
NN θ ( z ) .
Thus, we deﬁne generative distribution as some function of these parameters: p θ ( x | z )
=
f
( x, v z ) .
Therefore, the parameters θ are just the set of v 1 , v 2 , . .
. , v K .
For the simplicity of the model we assume p ψ ( z ) = 1 K .
Taking into account p ψ ( z )
= 1 K , we obtain optimal q ( z = i | x ) =
f ( x,v i ) (cid:80) Kj =
1 f ( x,v j ) .
Using (19) and the above formulas for q φ , p ψ and p θ
we obtain the following optimization problem:
[Equation]
[Table]
It is easy to show that (20) is equivalent to the following optimization problem:
[Equation]
[Table] [Equation] It is clear from (21) that when α = 1 the log-likelihood of the initial model is optimized.
On the other hand, when α =
the optimal point is v 1 = v 2 = · · · = v K = argmax v (cid:80) K i =1 log f ( x i , v ) , i. e. z doesn’t inﬂuence the generative process, and for each z generator produces the same v which maximizes likelihood estimation of the generative model f ( x, v ) for the given dataset of x ’s. For Bernoulli and Gaussian generative distributions f such v is just average of all modes x 1 , x 2 , . . .
, x K .
That explains why further we observe blurry images when using GSNN model.
The same conclusion holds for for continuous latent variables instead of categorical.
Given K different modes in true data distribution, VAE uses proposal network to separate prior distribution into K components (i. e. regions in the latent space), so that each region corresponds to one mode.
On the other hand, in GSNN z is sampled independently on the mode which is to be reconstructed from it, so for each z the generator have to produce parameters suitable for all modes.
From this point of view, there is no difference between VAE and VAEAC.
If the true conditional distribution has several different modes, then VAEAC can ﬁt them all, while GSNN learns their average.
If true conditional distribution has one mode, GSNN and VAEAC are equal, and GSNN may even learn faster because it has less parameters.
Hybrid model is a trade-off between VAEAC and GSNN: the closer α to zero, the more blurry and closer to the average is the distribution of the model.
The exact dependence of the model distribution on α can be derived analytically for the simple data distributions or evaluated experimentally.
We perform such experimental evaluation in the next sections.
C. S YNTHETIC D ATA
In this section we show that VAEAC is capable of learning a complex multimodal distribution of synthetic data while GSNN and hybrid model are not.
Let x ∈ R 2 and p ( b 1 = 1) =
p ( b 2 = 1) = 0 .
p d ( x ) = 18 (cid:80) 8 i =1 N ( x | µ i , 110 I ) where µ i ∼ N ( µ i | 0 , I ) .
The distribution p ( x ) is plotted in ﬁgure 6.
The dataset contains 100000 points sampled from p d ( x ) .
We use multi-layer perceptron with four ReLU layers of size 400-200-100-50, 25-dimensional Gaussian latent variables.
For different mixture coefﬁcients α we visualize samples from the learned distributions p ψ,θ ( x 1 , x 2 ) , p ψ,θ ( x 1 | x 2 ) , and p ψ,θ ( x 2 | x 1 ) .
The observed features for the conditional distributions are generated from the marginal distributions p ( x 2 ) and p ( x 1 ) respectively.
We see in table 8 and in ﬁgure 7, that even with very small weight GSNN prevents model from learning distributions with several local optimas.
GSNN also increases Monte-Carlo log-likelihood estimation with
[Figure] [Figure] [Figure] p (
[Figure]
p
[Figure]
[Figure]
| x
[Figure]
[Figure]
[Figure]
a few samples and decreases much more precise Importance Sampling log-likelihood estimation.
When α = 0 .
9 the whole distribution structure is lost.
We see that using α (cid:54) = 1 ruins multimodality of the restored distribution, so we highly recommend to use α = 1 or at least α ≈ 1 . [Table]
C. C OMPARISON ON THE I MAGE I NPAINTING P ROBLEM
In ﬁgure 8 we can see that the inpaintings produced by GSNN are smooth, blurry and not diverse compared with VAEAC.
Table 9 shows that VAEAC learns distribution over inpaintings better than GSNN in terms of test loglikelihood.
Nevertheless, Monte-Carlo estimations with a small number of samples sometimes are better for
GSNN, which means less local modes in the learned distribution and more blurriness in the samples.
D A DDITIONAL E XPERIMENTS D. C ONVERGENCE S PEED
In ﬁgure 9 one can see that VAEAC has similar convergence speed to VAE in terms of iterations on MNIST dataset.
In our experiments we observed the same behaviour for other datasets.
Each iteration of VAEAC is about 1.5 times slower than VAE due to usage of three networks instead of two. [Table] [Table]
D. M ISSING F EATURES I MPUTATION
We evaluate the quality of imputations on different datasets (mostly from UCI (Lichman, 2013)).
The evaluation is performed for VAEAC, GSNN (15) and NN (neural network; can be considered as a special case of GSNN where p θ ( z | x 1 − b , b ) is delta-function; produces single imputation).
We compare these methods with MICE (Buuren & Groothuis-Oudshoorn, 2010), MissForest (Stekhoven & B¨uhlmann, 2011), and GAIN (Yoon et al., 2018).
We see that for some datasets MICE and MissForest outperform VAEAC, GSNN and NN.
The reason is that for some datasets random forest is more natural structure than neural network.
The results also show that VAEAC, GSNN and NN show similar imputation performance in terms of
NRMSE, PFC, post-imputation R2-score and accuracy.
Given the result from appendix C we can take this as a weak evidence that the distribution of imputations has only one local maximum for datasets from (Lichman, 2013).
D. F ACE I NPAINTINGS
In ﬁgure 10 we provide samples of VAEAC on the CelebA dataset for the masks from (Li et al., 2017).
D. GAIN FOR I MAGE I NPAINTING
GAIN (Yoon et al., 2018) doesnt use unobserved data during training, which makes it easier to apply to the missing features imputation problem.
Nevertheless, it turns into a disadvantage when the fully-observed training data is available but the missingness rate at the testing stage is high.
We consider the horizontal line mask for MNIST which is described in appendix A.3.
We use the released
GAIN code 5 with a different mask generator.
The inpaintings from VAEAC which uses the unobserved pixels during training are available in ﬁgure 1.
The inpaintings from GAIN which ignores unobserved pixels are provided in ﬁgure 11.
As can be seen in ﬁgure 11, GAIN fails to learn conditional distribution for given mask distribution p ( b ) .
Nevertheless, we don’t claim that GAIN is not suitable for image inpainting.
As it was shown in the supplementary of (Yoon et al., 2018) and in the corresponding code, GAIN is able to learn conditional distributions when p ( b ) is pixel-wise independent Bernoulli distribution with probability 0 . [Figure] [Figure]
U NIVERSAL M ARGINALIZER : I LLUSTRATIONS
In ﬁgure 12 we provide samples of Universal Marginalizer (UM) and VAEAC for the same inputs.
Consider the case when UM marginal distributions are parametrized with Gaussians.
The most simple example of a distribution, which UM cannot learn but VAEAC can, is given in ﬁgure 13.
[Figure] [Figure]