H IERARCHICAL A DVERSARIALLY L EARNED I NFERENCE
Anonymous authors
Paper under double-blind review
A BSTRACT
We propose a novel hierarchical generative model with a simple Markovian structure and a corresponding inference model.
Both the generative and inference model are trained using the adversarial learning paradigm.
We demonstrate that the hierarchical structure supports the learning of progressively more abstract representations as well as providing semantically meaningful reconstructions with different levels of ﬁdelity.
Furthermore, we show that minimizing the Jensen-Shanon divergence between the generative and inference network is enough to minimize the reconstruction error.
The resulting semantically meaningful hierarchical latent structure discovery is exempliﬁed on the CelebA dataset.
There, we show that the features learned by our model in an unsupervised way outperform the best handcrafted features.
Furthermore, the extracted features remain competitive when compared to several recent deep supervised approaches on an attribute prediction task on
CelebA. Finally, we leverage the model’s inference network to achieve state-ofthe-art performance on a semi-supervised variant of the MNIST digit classiﬁcation task.
I NTRODUCTION
Deep generative models represent powerful approaches to modeling highly complex high-dimensional data.
There has been a lot of recent research geared towards the advancement of deep generative modeling strategies, including Variational Autoencoders (VAE) (Kingma & Welling, 2013), autoregressive models (Oord et al., 2016a;b) and hybrid models (Gulrajani et al., 2016; Nguyen et al., 2016).
However, Generative Adversarial Networks (GANs) (Goodfellow et al., 2014) have emerged as the learning paradigm of choice across a varied range of tasks, especially in computer visionZhu et al.
(2017), simulation and robotics Finn et al.
Shrivastava et al.
GANs cast the learning of a generative network in the form of a game between the generative and discriminator networks.
While the discriminator is trained to distinguish between the true and generated examples, the generative model is trained to fool the discriminator.
Using a discriminator network in GANs avoids the need for an explicit reconstruction-based loss function.
This allows this model class to generate visually sharper images than VAEs while simultaneously enjoying faster sampling than autoregressive models.
Recent work, known as either ALI (Dumoulin et al., 2016) or BiGAN (Donahue et al., 2016), has shown that the adversarial learning paradigm can be extended to incorporate the learning of an inference network.
While the inference network, or encoder, maps training examples x to a latent space variable z , the decoder plays the role of the standard GAN generator mapping from space of the latent variables (that is typically sampled from some factorial distribution) into the data space.
In ALI, the discriminator is trained to distinguish between the encoder and the decoder, while the encoder and decoder are trained to conspire together to fool the discriminator.
Unlike some approaches that hybridize VAE-style inference with GAN-style generative learning (e.g. Larsen et al.
(2015), Chen et al.
(2016)), the encoder and decoder in ALI use a purely adversarial approach.
One big advantage of adopting an adversarial-only formalism is demonstrated by the high-quality of the generated samples.
Additionally, we are given a mechanism to infer the latent code associated with a true data example.
One interesting feature highlighted in the original ALI work (Dumoulin et al., 2016) is that even though the encoder and decoder models are never explicitly trained to perform reconstruction, this can nevertheless be easily done by projecting data samples via the encoder into the latent space, copying these values across to the latent variable layer of the decoder and projecting them back to the data space.
Doing this yields reconstructions that often preserve some semantic features of the original input data, but are perceptually relatively different from the original samples.
These observations naturally lead to the question of the source of the discrepancy between the data samples and their
ALI reconstructions.
Is the discrepancy due to a failure of the adversarial training paradigm, or is it due to the more standard challenge of compressing the information from the data into a rather restrictive latent feature vector?
Ulyanov et al.
(2017) show that an improvement in reconstructions is achievable when additional terms which explicitly minimize reconstruction error in the data space are added to the training objective.
Chunyuan Li & Carin. (2017) palliates to the non-identiﬁability issues pertaining to bidirectional adversarial training by augmenting the generator’s loss with an adversarial cycle consistency loss.
In this paper we explore issues surrounding the representation of complex, richly-structured data, such as natural images, in the context of a novel, hierarchical generative model, Hierarchical Adversarially
Learned Inference (HALI), which represents a hierarchical extension of ALI.
We show that within a purely adversarial training paradigm, and by exploiting the model’s hierarchical structure, we can modulate the perceptual ﬁdelity of the reconstructions.
We provide theoretical arguments for why HALI’s adversarial game should be sufﬁcient to minimize the reconstruction cost and show empirical evidence supporting this perspective.
Finally, we evaluate the usefulness of the learned representations on a semi-supervised task on MNIST and an attribution prediction task on the CelebA dataset.
R ELATED WORK
Our work ﬁts into the general trend of hybrid approaches to generative modeling that combine aspects of VAEs and GANs.
For example, Adversarial Autoencoders (Makhzani et al., 2015) replace the
Kullback-Leibler divergence that appears in the training objective for VAEs with an adversarial discriminator that learns to distinguish between samples from the approximate posterior and the prior.
A second line of research has been directed towards replacing the reconstruction penalty from the VAE objective with GANs or other kinds of auxiliary losses.
Examples of this include Larsen et al.
(2015) that combines the GAN generator and the VAE decoder into one network and Lamb et al.
(2016) that uses the loss of a pre-trained classiﬁer as an additional reconstruction loss in the
VAE objective.
Another research direction has been focused on augmenting GANs with inference machinery.
One particular approach is given by Dumoulin et al.
; Donahue et al.
(2016), where, like in our approach, there is a separate inference network that is jointly trained with the usual GAN discriminator and generator.
Karaletsos (2016) presents a theoretical framework to jointly train inference networks and generators deﬁned on directed acyclic graphs by leverage multiple discriminators deﬁned nodes and their parents.
Another related work is that of Huang et al.
(2016b) which takes advantage of the representational information coming from a pre-trained discriminator.
Their model decomposes the data generating task into multiple subtasks, where each level outputs an intermediate representation conditioned on the representations from higher level.
A stack of discriminators is employed to provide signals for these intermediate representations.
The idea of stacking discriminator can be traced back to Denton et al.
(2015) which used used a succession of convolutional networks within a Laplacian pyramid framework to progressively increase the resolution of the generated images.
H IERACHICAL A DVERSARIALLY L EARNED I NFERENCE
The goal of generative modeling is to capture the data-generating process with a probabilistic model.
Most real-world data is highly complex and thus, the exact modeling of the underlying probability density function is usually computationally intractable.
Motivated by this fact, GANs (Goodfellow et al., 2014) model the data-generating distribution as a transformation of some ﬁxed distribution over latent variables.
In particular, the adversarial loss, through a discriminator network, forces the generator network to produce samples that are close to those of the data-generating distribution.
While GANs are ﬂexible and provide good approximations to the true data-generating mechanism, their original formulation does not permit inference on the latent variables.
In order to mitigate this, Adversarially Learned Inference (ALI) (Dumoulin et al., 2016) extends the GAN framework to include an inference network that encodes the data into the latent space.
The discriminator is then trained to discriminate between the joint distribution of the data and latent causes coming from the generator and inference network.
Thus, the ALI objective encourages a matching of the two joint distributions, which also results in all the marginals and conditional distributions being matched.
This enables inference on the latent variables.
We endeavor to improve on ALI in two aspects.
First, as reconstructions from ALI only loosely match the input on a perceptual level, we want to achieve better perceptual matching in the reconstructions.
Second, we wish to be able to compress the observables, x , using a sequence of composed features maps, leading to a distilled hierarchy of stochastic latent representations, denoted by z 1 to z L .
Note that, as a consequence of the data processing inequality(Cover & Thomas, 2012), latent representations higher up in the hierarchy cannot contain more information than those situated lower in the hierarchy.
In information-theoretic terms, the conditional entropy of the observables given a latent variable is non-increasing as we ascend the hierarchy.
This loss of information can be seen as responsible for the perceptual discrepancy observed in ALI’s reconstructions.
Thus, the question we seek to answer becomes: How can we achieve high perceptual ﬁdelity of the data reconstructions while also having a compressed latent space that is strongly coupled with the observables?
In this paper, we propose to answer this using a novel model, Hierarchical Adversarially Learned Inference (HALI), that uses a simple hierarchical Markovian inference network that is matched through adversarial training to a similarly constructed generator network.
Furthermore, we discuss the hierarchy of reconstructions induced by the HALI’s hierarchical inference network and show that the resulting reconstruction errors are implicitly minimized during adversarial training.
Also, we leverage HALI’s hierarchial inference network to offer a novel approach to semi-supervised learning in generative adversarial models.
3. A M ODEL FOR H IERARCHICAL F EATURES
Denote by P ( S ) the set of all probability measures on some set S .
Let T Z | X be a Markov kernel associating to each element x 2 X a probability measure P Z | X = x 2 P
( Z ) .
Given two Markov kernels T
W | V and T V | U , a further Markov kernel can be deﬁned by composing these two and then marginalizing over V , i.e. T W | V  T V | U : U !
P ( W ) .
Consider a set of random variables x , z 1 , . .
z L .
Using the composition operation, we can construct a hierarchy of Markov kernels or feature transitions as
[Equation]
A desirable property for these feature transitions is to have some form of inverses.
Motivated by this, we deﬁne the adjoint feature transition as T † z l | z l  1 =
T z
l  1 | z l .
From this, we see that
[Equation]
This can be interpreted as the generative mechanism of the latent variables given the data being the "inverse" of the data-generating mechanism given the latent variables.
Let q ( x ) denote the distribution of the data and p ( z L ) be the prior on the latent variables.
Typically the prior will be a simple distribution, e.g. a standard Gaussian p ( z L ) =
N ( 0 | I ) .
The composition of Markov kernels in Eq. 1, mapping data samples x to samples of the latent variables z L using z 1 , . .
z L  1 constitutes the encoder.
Similarly, the composition of kernels in
Eq.
2 mapping prior samples of z L to data samples x through z L  1 , . .
, z 1 constitutes the decoder.
Thus, the joint distribution of the encoder can be written as
[Equation]
while the joint distribution of the decoder is given by
[Equation]
✓ g , ✓ d initialize network parameters repeatfor m 2 { 1 , . .
, M } do ˆ z ( m
[Equation]
⇠ q ( x ) z ( m )
L ⇠ p ( z )
L } do ˆ z ml ⇠ q ( z l | ˆ z l  1 ) end
{ L
1 } do z
) l  1 ⇠ p ( z l  1 | z l )
⇢ ( m ) q
D ( ˆ z ( m ),
. , ˆ z ( m ) l )
⇢ ( m ) p
D ( z ( m ),
, z ( m ) l ) end
L d
[Equation] [Equation]
=
[Equation]
log
[Equation] [Equation]
Gradient update on discriminator network
[Equation]
. Gradient update on generator networks until convergence
The encoder and decoder distributions can be visualized graphically as x
[Equation]
+
[Equation]
j j
[Equation]
| z+ + z
[Equation]
z
[Equation]
| zk k
T z 3 | z+ + . . .
T z 2 | zk k
T z L | z L + + z L
T z L  1 | z
L k k
Having constructed the joint distributions of the encoder and decoder, we can now match these distributions through adversarial training.
It can be shown that, under an ideal (non-parametric) discriminator, this is equivalent to minimizing the Jensen-Shanon divergence between the joint Eq.and Eq. 4, see (Dumoulin et al., 2016).
Algorithm 1 details the training procedure.
3. A HIERARCHY OF RECONSTRUCTIONS
The Markovian character of both the encoder and decoder implies a hierarchy of reconstructions in the decoder.
In particular, for a given observation x ⇠ p ( x ) , the model yields L different reconstructions ˆ x l ⇠ T x | z l  T
z l | x for l 2 { 1 , . . .
, L } with ˆ x l the reconstruction of the x at the l -th level of the hierarchy.
Here, we can think of T z l | x as projecting x to the l -th intermediate representation and T x | z l as projecting it back to the input space.
Then, the reconstruction error for a given input x at the l -th hierarchichal level is given by
[Equation]
Contrary to models that try to merge autoencoders and adversarial models, e.g. Rosca et al.
Larsen et al.
, HALI does not require any additional terms in its loss function in order to minimize the above reconstruction error.
Indeed, the reconstruction errors at the different levels of
HALI are minimized down to the amount of information about x that a given level of the hierarchy is able to encode as training proceeds.
Furthermore, under an optimal discriminator, training in
HALI minimizes the Jensen-Shanon divergence between q ( x , z 1 , . . .
, z L ) and p ( x , z 1 , . . .
, z L ) as formalized in Proposition 1 below.
Furthermore, the interaction between the reconstruction error and training dynamics is captured in Proposition 1.
Proposition 1.
Assuming q ( x , z l ) is bounded away for zero for all l 2 { 1 , . . .
, L } , we have that
[Equation]
where H ( x | z l ) is computed under the encoder’s distribution and K is as deﬁned in Lemma 2 in the appendix.
On the other hand, proposition 2 below relates the intermediate representations in the hierarchy to the corresponding induced reconstruction error.
Proposition 2.
For any given latent variable z l ,
[Equation]
i.e. the reconstruction error is an upper bound on H ( x | z l ) .
In summary, Propositions 1 and 2 establish the dynamics between the hierarchical representation learned by the inference network, the reconstruction errors and the adversarial matching of the joint distributions Eq.
3 and Eq. 4.
The proofs on the two propositions above are deferred to the appendix.
Having theoretically established the interplay between layer-wise reconstructions and the training mechanics, we now move to the empirical evaluation of HALI.
E MPIRICAL A NALYSIS : S ETUP
We designed our experiments with the objective of addressing the following questions: Is HALI successful in improving the ﬁdelity perceptual reconstructions?
Does HALI induces a semantically meaningful representation of the observed data?
Are the learned representations useful for downstream classiﬁcation tasks?
All of these questions are considered in turn in the following sections.
We evaluated HALI on four datasets, CIFAR10 (Krizhevsky & Hinton, 2009), SVHN (Netzer et al., 2011), ImageNet 128x128 (Russakovsky et al., 2015) and CelebA (Liu et al., 2015).
We used two conditional hierarchies in all experiments with the Markov kernels parametrized by conditional isotropic Gaussians.
For SVHN, CIFAR10 and CelebA the resolutions of two level latent variables are z 1 2 R 64 ⇥ 16 ⇥ 16 and z 2 2 R 256 .
For ImageNet, the resolutions is z 1 2 R 64 ⇥ 32 ⇥ 32 and z 2 2 R 256 .
For both the encoder and decoder, we use residual blocks(He et al., 2015) with skip connections between the blocks in conjunction with batch normalization(Ioffe & Szegedy, 2015).
We use convolution with stride 2 for downsampling in the encoder and bilinear upsampling in the decoder.
In the discriminator, we use consecutive stride 1 and stride 2 convolutions and weight normalization (Salimans & Kingma, 2016).
To regularize the discriminator, we apply dropout every 3 layers with a probability of retention of 0.2.
We also add Gaussian noise with standard deviation of 0.2 at the inputs of the discriminator and the encoder.
E MPIRICAL A NALYSIS I: R ECONSTRUCTIONS
One of the desired objectives of a generative model is to reconstruct the input images from the latent representation.
We show that HALI offers improved perceptual reconstructions relative to the (non-hierarchical)
ALI model.
5. Q UALITATIVE ANALYSIS
First, we present reconstructions obtained on ImageNet.
Reconstructions from SVHN and CIFAR can be seen in Fig.
7 in the appendix.
Fig.
1 highlights HALI’s ability to reconstruct the input samples with high ﬁdelity.
We observe that reconstructions from the ﬁrst level of the hierarchy exhibit local differences in the natural images, while reconstructions from the second level of the hierarchy displays global change.
Higher conditional reconstructions are more often than not reconstructed as a different member of the same class.
Moreover, we show in Fig.
2 that this increase in reconstruction ﬁdelity does not impact the quality of the generative samples from HALI’s decoder.
5. Q UANTITATIVE ANALYSIS
We further investigate the quality of the reconstructions with a quantitative assessment of the preservation of perceptual features in the input sample.
For this evaluation task, we use the CelebA dataset where each image comes with a 40 dimensional binary attributes vector.
A VGG-16 classiﬁer(Simonyan & Zisserman, 2014) was trained on the CelebA training set to classify the individual attributes.
This trained model is then used to classify the attributes of the reconstructions from the
[Figure] [Figure]
[Table]
validation set.
We consider a reconstruction as being good if it preserves – as measured by the trained classiﬁer – the attributes possessed by the original sample.
We report a summary of the statistics of the classiﬁer’s accuracies in Table 1.
We do this for three different models, VAE, ALI and HALI.
An inspection of the table reveals that the proportion of attributes where HALI’s reconstructions outperforms the other models is clearly dominant.
Therefore, the encoder-decoder relationship of HALI better preserves the identiﬁable attributes compared to other models leveraging such relationships.
Please refer to Table 5 in the appendix for the full table of attributes score.
5. P ERCEPTUAL R ECONSTRUCTIONS
In the same spirit as Larsen et al.
, we construct a metric by computing the Euclidean distance between the input images and their various reconstructions in the discriminator’s feature space.
More precisely, let · 7!
¯ D ( · ) be the embedding of the input to the pen-ultimate layer of the discriminator.
We compute the discriminator embedded distance
[Equation]
where · 7! k · k 2 is the Euclidean norm.
We then compute the average distances d c ( x , ˆ x 1 ) and d c ( x , ˆ x 2 ) over the ImageNet validation set.
Fig.
3a shows that under d c , the average reconstruction errors for both ˆ x 1 and ˆ x 2 decrease steadily as training advances.
Furthermore, the reconstruction error under d c of the reconstructions from the ﬁrst level of the hierarchy are uniformly bounded by above by those of the second.
We note that while the VAEGAN model of Larsen et al.
(2015) explicitly minimizes the perceptual reconstruction error by adding this term to their loss function,
HALI implicitly minimizes it during adversarial training, as shown in subsection 3.2.
[Figure]
E MPIRICAL A NALYSIS II: L EARNED R EPRESENTATIONS
We now move on to assessing the quality of our learned representation through inpainting, visualizing the hierarchy and innovation vectors.
6. I NPAINTING
Inpainting is the task of reconstructing the missing or lost parts of an image.
It is a challenging task since sufﬁcient prior information is needed to meaningfully replace the missing parts of an image.
While it is common to incorporate inpainting-speciﬁc training Yeh et al.
; Pérez et al.
Pathak et al. (2016), in our case we simply use the standard HALI adversarial loss during training and reconstruct incomplete images during inference time.
We ﬁrst predict the missing portions from the higher level reconstructions followed by iteratively using the lower level reconstructions that are pixel-wise closer to the original image.
Fig.
4 shows the inpaintings on center-cropped SVHN, CelebA and MS-COCO (Lin et al., 2014) datasets without any blending post-processing or explicit supervision.
The effectiveness of our model at this task is due the hierarchy – we can extract semantically consistent reconstructions from the higher levels of the hierarchy, then leverage pixel-wise reconstructions from the lower levels.
6. H IERARCHICAL LATENT REPRESENTATIONS
To qualitatively show that higher levels of the hierarchy encode increasingly abstract representation of the data, we individually vary the latent variables and observe the effect.
The process is as follow: we sample a latent code from the prior distribution z 2 .
We then multiply individual components of the vector by scalars ranging from  3 to 3 .
For z 1 , we ﬁx z 2 and multiply each feature map independently by scalars ranging from  3 to 3 .
In all cases these modiﬁed latent vectors are then decoded back to input data space
[Figure]
6. L ATENT SEMANTIC I NNOVATION
With HALI, we can exploit the jointly learned hierarchical inference mechanism to modify actual data samples by manipulating their latent codes.
We refer to these sorts of manipulations as latent semantic innovations.
Consider a given instance from a dataset x ⇠ q ( x ) .
Encoding x yields ˆ z 1 and ˆ z 2 .
We modify ˆ zby multiplying a speciﬁc entry by a scalar ↵ .
We denote the resulting vector by ˆ z ↵ 2 .
We decode the latter and get ˜ z ↵ 1 ⇠ T z 1 | z 2 .
We decode the unmodiﬁed encoding vector and get ˜ z
1 ⇠ T z 1 | ˆ z 2 .
We then form the innovation tensor ⌘ ↵ = ˜ z
˜
z ↵ 1 .
Finally, we subtract the innovation vector from the initial encoding, thus getting ˆ z ↵ 1 =
ˆ z 1  ⌘ ↵ , and sample ˜ x ↵ ⇠ T x
| ˆ z ↵ 1 .
This method provides explicit control and allows us to carry out these variations on real samples in a completely unsupervised way.
The results are shown in Fig.
These were done on the CelebA validation set and were not used for training.
E MPIRICAL E VALUATIONS III: L EARNING P REDICTIVE R EPRESENTATIONS
We evaluate the usefulness of our learned representation for downstream tasks by quantifying the performance of HALI on attribute classiﬁcation in CelebA and on a semi-supervised variant of the
MNIST digit classiﬁcation task.
7. U NSUPERVISED CLASSIFICATION
Following the protocol established by Berg & Belhumeur (2013); Liu et al.
, we trainlinear SVMs on HALI encoder representations (i.e. we utilize the inference network) on the CelebA validation set and subsequently measure performance on the test set.
As in Berg & Belhumeur (2013); Huang et al. (2016a); Kalayeh et al.
(2017), we report the balanced accuracy in order to evaluate the attribute prediction performance.
We emphasize that, for this experiment, the HALI encoder and decoder were trained in on entirely unsupervised data.
Attribute labels were only used to train the linear SVM classiﬁers.
A summary of the results are reported in Table 2.
HALI’s unsupervised features surpass those of VAE and ALI, but more remarkably, they outperform the best handcrafted features by a wide margin (Zhang et al., 2014).
Furthermore, our approach outperforms a number of supervised (Huang et al., 2016a) and deeply supervised (Liu et al., 2015) features.
Table 6 in the appendix arrays the results per attribute.
[Table] [Table]
7. S EMI - SUPERVISED LEARNING WITHIN HALI
The HALI hierarchy can also be used in a more integrated semi-supervised setting, where the encoder also receives a training signal from the supervised objective.
The currently most successful approach to semi-supervised in adversarially trained generative models are built on the approach introduced by Salimans et al.
This formalism relies on exploiting the discriminator’s feature to differentiate between the individual classes present in the labeled data as well as the generated samples.
Taking inspiration from (Makhzani et al., 2015; Makhzani & Frey, 2017), we adopt a different approach that leverages the Markovian hierarchical inference network made available by
HALI,
[Equation]
Where z = enc ( x +  ✏ ) , with ✏ ⇠ N (0 , I ) , and y is a categorical random variable.
In practice, we characterize the conditional distribution of y given z by a softmax.
The cost of the generator is then augmented by a supervised cost.
Let us write D sup as the set of pairs all labeled instance along with their label, the supervised cost reads
[Equation]
We showcased this approach on a semi-supervised variant of MNIST(LeCun et al., 1998) digit classiﬁcation task with 100 labeled examples evenly distributed across classes.
Table 3 shows that HALI achieves a new state-of-the-art result for this setting.
Note that unlike Dai et al.
(2017), HALI uses no additional regularization.
C ONCLUSION AND FUTURE WORK
In this paper, we introduced HALI, a novel adversarially trained generative model.
HALI learns a hierarchy of latent variables with a simple Markovian structure in both the generator and inference network.
We have shown both theoretically and empirically the advantages gained by extending the
ALI framework to a hierarchy.
While there are many potential applications of HALI, one important future direction of research is to explore ways to render the training process more stable and straightforward.
GANs are well-known to be challenging to train and the introduction of a hierarchy of latent variables only adds to this.
A A RCHITECTURE D ETAILS
[Table]
Convolution 3 ⇥1 ⇥
BN 0.
Leaky ReLU
Bilinear UpsamplingConvolution 3 ⇥1 ⇥ ⇥ 0.
Leaky ReLU
Gaussian Layer
G x ( z 1 ) – 64 ⇥ 32 ⇥ 32 input Convolution 1 ⇥1 ⇥
BN 0.
Leaky ReLU
Resnet Block 3 ⇥1 ⇥
BN 0.
Leaky ReLU
Bilinear UpsamplingResnetBlock 3 ⇥1 ⇥
BN 0.
Leaky ReLU
Bilinear UpsamplingConvolution 3 ⇥1 ⇥
BN 0.
Leaky ReLU
Convolution 3 ⇥1 ⇥
BN 0.
Leaky ReLU
Convolution 1 ⇥1 ⇥ ⇥ 0.
Tanh
D ( x ) – 3 ⇥ 128 ⇥ 128 input Convolution 3 ⇥1 ⇥
WN 0.
Leaky ReLU
Convolution 3 ⇥2 ⇥
WN 0.
Leaky ReLU
Convolution 3 ⇥2 ⇥
WN 0.
Leaky ReLU
Convolution 3 ⇥1 ⇥
WN 0.
Leaky ReLU
D ( x, z 1 ) – 128 ⇥ 32 ⇥ 32 input Concatenate D ( x ) and z 1 along the channel axis
Convolution 3 ⇥1 ⇥
WN 0.
Leaky ReLU
Convolution 3 ⇥2 ⇥
WN 0.
Leaky ReLU
Convolution 3 ⇥2 ⇥
WN 0.
Leaky ReLU
Convolution 3 ⇥2 ⇥
WN 0.
Leaky ReLU
Convolution 4 ⇥valid
WN 0.
Leaky ReLU
[Table]
Concatenate D ( x, z 1 ) and z 2 along the channel axis
Convolution
[Table]
Leaky ReLU
Convolution
[Table]
Leaky
[Table]
Sigmoid
B P ROOFS
Lemma 1.
Let f be a valid f-divergence generator.
Let p and q be joint distributions over a random vector x .
Let x A be any strict subset of x and x  A its complement, then
[Equation]
Proof.
By deﬁnition, we have
[Equation]
Using that f is convex, Jensen’s inequality yields
[Equation]
Simplifying the inner expectation on the right hand side, we conclude that
[Equation]
Lemma 2 (Kullback-Leibler’s upper bound by Jensen-Shannon) .
Assume that p and q are two probability distribution absolutely continuous with respect to each other.
Moreover, assume that q is bounded away from zero.
Then, there exist a positive scalar K such that
[Equation]
Proof.
We start by bounding the Kullblack-Leibler divergence by the  2 -distance.
We have
[Equation]
The ﬁrst inequality follows by Jensen’s inequality.
The third inequality follows by the Taylor expansion.
Recall that both the  2 -distance and the Jensen-Shanon divergences are f-divergences with generators given by f  2 ( t ) =
( t  1) 2 and f JS ( t ) =
u log( 2 t t +1 )
+ log( 2 t t +1 ) , respectively.
We form the function t 7!
h ( t ) =
f  2 ( t ) f JS ( t ) .
h is strictly increasing on [0 , 1 ) .
Since we are assuming q to be bounded away from zero, we know that there is a constant c 1 such that q ( x ) > c 1 for all x .
Subsequently for all x , we have that p ( x ) q ( x )  c 2 :=
max x p ( x ) c 1 .
Thus, for all x we have h ( p ( x ) q ( x ) )  K :
=
h ( c 2 ) and hence f  2 ( pq )  K f JS ( p ( x ) q ( x ) ) .
Intergrating with respect to q , we conclude
[Equation]
Proposition 3.
Assuming q ( x , z l ) and p ( x , z l ) are positive for any l 2 { 1 , . .
, L } .
We have
[Equation]
Where H ( x | z l ) is computed under the encoder’s distribution q ( x , z l )
Proof.
By elementary manipulations we have.
[Equation]
Where the conditional entropy H ( x l | z l ) is computed q ( x , z l ) .
By the non-negativity of the
KL-divergence we obtain
[Equation]
Using lemma 2, we have
[Figure]
[Equation]
The Jensen-Shanon divergence being f-divergence, using Lemma 1, we conclude
[Equation]
Proposition 4.
For any given latent variable z l , the reconstruction likelihood
E x ⇠ q x [ E z ⇠ T z l | x [  log p ( x | z l )]] is an upper bound on H ( x | z l ) .
Proof.
By the non-negativity of the Kullback-Leibler divergence, we have that
[Equation]
Integrating over the marginal and applying Fubini’s theorem yields
[Equation]
where the conditional entropy H ( x | z l ) is computed under the encoder distribution.
[Table]
l ace
W it
h L i p s ti c k
B i g L i p s
N a rr o w
E y e s
C hubby S m ili ng B u s hy B r o w s
W it
h E a rr
i ng s
Data                   74 VAE                   62 ALI                   83 HALI (
[Table]
)                  83 HALI (z2)
5o C l o c k
S h a do w
A r c h e d
E y e b r o w s
A tt r ac ti v e
B a g s U nd e r E y e s
B a l d B a ng s B
i
g L i p s
B i g N o s e
B l ac k H a i r
B l ond
H a i r
B l u rr y B
r
o w n
H a i r
B u s hy
E y e b r o w s
C hubby
D oub l e C h
i n
E y e g l a ss e s
G o a t ee
G r a y H a i r
H ea vy
M a k e up
H
i gh C h
ee kbon e s
Triplet-kNN    75             86 PANDA    74             89 Anet    73             89 LMLE-kNN    90             92 VAE    87             75 ALI    89             64 HALI(Unsup)
M a l e
M ou t h S li gh tl y
O p e n
M u s t ac h e
N a rr o w
E y e s
N o B ea r d
O v a l F ace
P a l e S k i n
P o i n t y
N o s e
R ece d i ng
H a
i r li n e
R o s y C h
ee k s
S i
d e bu r n s
S m ili ng S t r a i gh t
H a i r
W a vy H a i r
W ea r i ng
E a rr
i
ng s
W ea r i ng
H a t
W ea r i ng
L i p s ti c k
W ea r i ng
N ec k l ace
W ea r i ng
N ec k ti e
Y oung
Triplet-kNN    82             75 PANDA    87             78 Anet    93             84 LMLE-kNN    96             87 VAE    79
ALI    79             71 HALI(Unsup)