Log In Sign Up

Progressive Learning and Disentanglement of Hierarchical Representations

Learning rich representation from data is an important task for deep generative models such as variational auto-encoder (VAE). However, by extracting high-level abstractions in the bottom-up inference process, the goal of preserving all factors of variations for top-down generation is compromised. Motivated by the concept of "starting small", we present a strategy to progressively learn independent hierarchical representations from high- to low-levels of abstractions. The model starts with learning the most abstract representation, and then progressively grow the network architecture to introduce new representations at different levels of abstraction. We quantitatively demonstrate the ability of the presented model to improve disentanglement in comparison to existing works on two benchmark data sets using three disentanglement metrics, including a new metric we proposed to complement the previously-presented metric of mutual information gap. We further present both qualitative and quantitative evidence on how the progression of learning improves disentangling of hierarchical representations. By drawing on the respective advantage of hierarchical representation learning and progressive learning, this is to our knowledge the first attempt to improve disentanglement by progressively growing the capacity of VAE to learn hierarchical representations.


page 7

page 8

page 11


Learning Representations by Maximizing Mutual Information in Variational Autoencoder

Variational autoencoders (VAE) have ushered in a new era of unsupervised...

Hierarchical VampPrior Variational Fair Auto-Encoder

Decision making is a process that is extremely prone to different biases...

dpVAEs: Fixing Sample Generation for Regularized VAEs

Unsupervised representation learning via generative modeling is a staple...

Online Deep Learning based on Auto-Encoder

Online learning is an important technical means for sketching massive re...

Towards the One Learning Algorithm Hypothesis: A System-theoretic Approach

The existence of a universal learning architecture in human cognition is...

Improving Disentangled Representation Learning with the Beta Bernoulli Process

To improve the ability of VAE to disentangle in the latent space, existi...

Deep Generative Model with Beta Bernoulli Process for Modeling and Learning Confounding Factors

While deep representation learning has become increasingly capable of se...

1 Introduction

Variational auto-encoder (VAE), a popular deep generative model (DGM), has shown great promise in learning interpretable and semantically meaningful representations of data (Higgins et al. (2017); Chen et al. (2018); Kim and Mnih (2018); Gyawali et al. (2019)

). However, VAE has not been able to fully utilize the depth of neural networks like its supervised counterparts, for which a fundamental cause lies in the inherent conflict between the bottom-up inference and top-down generation process (

Zhao et al. (2017); Li et al. (2016)): while the bottom-up abstraction is able to extract high-level representations helpful for discriminative tasks, the goal of generation requires the preservation of all generative factors that are likely at different abstraction levels. This issue was addressed in recent works by allowing VAEs to generate from details added at different depths of the network, using either memory modules between top-down generation layers (Li et al. (2016)

), or hierarchical latent representations extracted at different depths via a variational ladder autoencoder (VLAE,

Zhao et al. (2017)).

However, it is difficult to learn to extract and disentangle all generative factors at once, especially at different abstraction levels. Inspired by human cognition system, Elman (1993) suggested the importance of “starting small” in two aspects of the learning process of neural networks: incremental input in which a network is trained with data and tasks of increasing complexity, and incremental memory in which the network capacity undergoes developmental changes given fixed external data and tasks — both pointing to an incremental learning strategy for simplifying a complex final task. Indeed, the former concept of incremental input has underpinned the success of curriculum learning (Bengio et al. (2015)). In the context of DGMs, various stacked versions of generative adversarial networks (GANs) have been proposed to decompose the final task of high-resolution image generation into progressive sub-tasks of generating small to large images (Denton et al. (2015); Zhang et al. (2018)). The latter aspect of “starting small” with incremental growth of network capacity is less explored, although recent works have demonstrated the advantage of progressively growing the depth of GANs for generating high-resolution images (Karras et al. (2018); Wang et al. (2018)). These works, so far, have focused on progressive learning as a strategy to improve image generation.

We are motivated to investigate the possibility to use progressive learning strategies to improve learning and disentangling of hierarchical representations. At a high level, the idea of progressively or sequentially learning latent representations has been previously considered in VAE. In Gregor et al. (2015), the network learned to sequentially refine generated images through recurrent networks. In Lezama (2019), a teacher-student training strategy was used to progressively increase the number of latent dimensions in VAE to improve the generation of images while preserving the disentangling ability of the teacher model. However, these works primarily focus on progressively growing the capacity of VAE to generate, rather than to extract and disentangle hierarchical representations.

In comparison, in this work, we focus on 1) progressively growing the capacity of the network to extract hierarchical representations, and 2) these hierarchical representations are extracted and used in generation from different abstraction levels. We present a simple progressive training strategy that grows the hierarchical latent representations from different depths of the inference and generation model, learning from high- to low-levels of abstractions as the capacity of the model architecture grows. Because it can be viewed as a progressive strategy to train the VLAE presented in Zhao et al. (2017), we term the presented model pro-VLAE. We quantitatively demonstrate the ability of pro-VLAE to improve disentanglement on two benchmark data sets using three disentanglement metrics, including a new metric we proposed to complement the metric of mutual information gap (MIG) previously presented in Chen et al. (2018). These quantitative studies include comprehensive comparisons to -VAE (Higgins et al. (2017)), VLAE (Zhao et al. (2017)), and the teacher-student strategy as presented in (Lezama (2019)

) at different values of the hyperparameter

. We further present both qualitative and quantitative evidence that pro-VLAE is able to first learn the most abstract representations and then progressively disentangle existing factors or learn new factors at lower levels of abstraction, improving disentangling of hierarhical representations in the process.

2 Related works

A hierarchy of feature maps can be naturally formed in stacked discriminative models (Zeiler and Fergus (2014)). Similarly, in DGM, many works have proposed stacked-VAEs as a common way to learn a hierarchy of latent variables and thereby improve image generation (Sønderby et al. (2016); Bachman (2016); Kingma et al. (2016)). However, this stacked hierarchy is not only difficult to train as the depths increases (Sønderby et al. (2016); Bachman (2016)), but also has an unclear benefit for learning either hierarchical or disentangled representations: as shown in Zhao et al. (2017), when fully optimized, it is equivalent to a model with a single layer of latent variables. Alternatively, instead of a hierarchy of latent variables, independent hierarchical representations at different abstraction levels can be extracted and used in generation from different depths of the network (Rezende et al. (2014); Zhao et al. (2017)). A similar idea was presented in Li et al. (2016) to generate lost details from memory and attention modules at different depths of the top-down generation process. The presented work aligns with existing works (Rezende et al. (2014); Zhao et al. (2017)) in learning independent hierarchical representation from different levels of abstraction, and we look to facilitate this learning by progressively learning the representations from high- to low-levels.

Progressive learning has been successful for high-quality image generation, mostly in the setting of GANs. Following the seminar work of Elman (1993), these progressive strategies can be loosely grouped into two categories. Mostly, in line with incremental input, several works have proposed to divide the final task of image generation into progressive tasks of generating low-resolution to high-resolution images with multi-scale supervision (Denton et al. (2015); Zhang et al. (2018)). Alternatively, in line with incremental memory,

a small number of works have demonstrated the ability to simply grow the architecture of GANs from a shallow network with limited capacity for generating low-resolution images, to a deep network capable of generating super-resolution images (

Karras et al. (2018); Wang et al. (2018)). This approach was also shown to be time-efficient since the early-stage small networks require less time to converge comparing to training a full network from the beginning. This latter group of works provided compelling evidence for the benefit of progressively growing the capacity of a network to generate images, although its extension for growing the capacity of a network to learn hierarchical representations has not been explored.

Limited work has considered incremental learning of representations in VAE. In Gregor et al. (2015), recurrent networks with attention mechanisms were used to sequentially refines the details in generated images. It however focused on the generation performance of VAE without considering the learned representations. In Lezama (2019), a teacher-student strategy was used to progressively grow the dimension of the latent representations in VAE. Its fundamental motivation was that, given a teacher model that has learned to effectively disentangle major factors of variations, progressively learning additional nuisance variables will improve generation without compromising the disentangling ability of the teacher – the latter accomplished via a newly-proposed Jacobian supervision. The capacity of this model to grow, thus, is by design limited to the extraction of nuisance variables. In comparison, we are interested in a more significant growth of the VAE capacity to progressively learn and improve disentangling of important factors of variations which, as we will later demonstrate, is not what the model in Lezama (2019) is intended for. In addition, neither of these works considered learning different levels of abstractions at different depths of the network, and the presented pro-VLAE provides a simpler training strategy to achieve progressive representation learning.

Learning disentangled representation is a primary motivation of our work, and an important topic in VAE. Existing works mainly tackle this by promoting the independence among the learned latent factors in VAE (Higgins et al. (2017); Kim and Mnih (2018); Chen et al. (2018)). The presented progressive learning strategy provides a novel approach to improve disentangling that is different to these existing methods and a possibility to augment them in the future.

3 Methods

3.1 model: VAE with hierarchical representations

We assume a generative model for observed and its latent variable . To learn hierarchical representations of , we decompose into with from different abstraction levels that are loosely guided by the depth of neural network as in Zhao et al. (2017). We define the hierarchical generative model as:


Note that there is no hierarchical dependence among the latent variables as in common hierarchical latent variable models. Rather, similar to that in Rezende et al. (2014) and Zhao et al. (2017), ’s are independent and each represents generative factors at an abstraction level not captured in other levels. We then define an inference model to approximate the posterior as:


where represents a particular level of bottom-up abstraction of . We parameterize and with an encoding-decoding structure and, as in Zhao et al. (2017), we approximate the abstraction level with the network depth. The full model is illustrated in Fig. 1(c), with a final goal to maximize a modified evidence lower bound (ELBO) of the marginal likelihood of data :



denotes the Kullback-–Leibler divergence, prior

is set to isotropic Gaussian according to standard practice, and is a hyperparameter introduced in Higgins et al. (2017) to promote disentangling, defaulting to the standrd ELBO objective when .

3.2 progressive learning of hierarchical representation

We present a progressive learning strategy, as illustrated in Fig. 1, to achieve the final goal in equation (3) by learning the latent variables progressively from the highest to the lowest level of abstractions. We start by learning the most abstraction representations at layer as show in Fig. 1(a). In this case, our model degenerates to a vanilla VAE with latent variables at the deepest layer. We keep the dimension of small to start small in terms of the capacity to learn latent representations, where we define the inference model at progressive step as:


and the generative model as:


where , , and are parts of the encoder architecture, are parts of the decoder architecture, and is the distribution of parametrized by , which can be either Bernoulli or Gaussian depending on the data. Next, as shown in Fig. 1, we progressively grow the model to learn from high to low abstraction levels. At each progressive step , we move down one abstraction level, and grow the inference model by introducing new latent code:


Simultaneously, we grow the decoder such that it can generate with the new latent code as:


where includes transposed convolution layers outputting a feature map in the same shape as , and denotes a concatenation operation. The training objective at progressive step is then:


By replacing the full objective in equation (3) with a sequence of the objectives in equation (8) as the training progresses, we incrementally learn to extract and generate with hierarchical latent representations ’s from high to low levels of abstractions. Once trained, the full model as shown in Fig. 1(c) will be used for inference and generation, and progressive processes are no loner needed.

Figure 1: Progressive learning of hierarchical representations. White blocks and solid lines are VAE models at the current progression. is a fade-in coefficient for blending in the new network component. Gray circles and dash line represents (optional) constraining of the future latent variables.

3.3 implementation strategies

Two important strategies are utilized to implement the proposed progressive representation learning. First, directly adding new components to a trained network often introduce a sudden shock to the gradient: in VAEs, this often leads to the explosion of the variance in the latent distributions. To avoid this shock, we adopt the popular method of “fade-in” (

Karras et al. (2018)) to smoothly blend the new and existing network components. In specific, we introduce a “fade-in” coefficient to equations (6) and (7) when growing new components in the encoder and the decoder:


where increases from 0 to 1 within a certain number of iterations (5000 in our experiments) since the addition of the new network components ,, and .

Second, we further stabilize the training by weakly constraining the distribution of ’s before they are added to the network. This can be achieved by a applying a KL penalty, modulated by a small coefficient , to all latent variables that have not been used in the generation at progressive step :


where is set to 0.5 in our experiments. The final training objective at step then becomes:


Note that the latent variables at the hierarchy lower than are neither meaningfully inferred nor used in generation at progressive step , and merely intends to regularize the distribution of these latent variables before they are added to the network. In the experiments below, we use both “fade-in” and when implementing the progressive training strategy.

3.4 disentanglement metric

Various quantitative metrics for measuring disentanglement have been proposed (Higgins et al. (2017); Kim and Mnih (2018); Chen et al. (2018)). For instance, the recently proposed MIG metrics (Chen et al. (2018)) measures the gap of mutual information between the top two latent dimensions that have the highest mutual information with a given generative factor. A low MIG score, therefore, suggests an undesired outcome that the same factor is split into multiple dimensions. However, if different generative factors are entangled into the same latent dimension, the MIG score will not be affected.

Therefore, we propose a new disentanglement metric to supplement MIG by recognizing the entanglement of multiple generative factors into the same latent dimension. We define MIG-sup as:


where is the latent variables and is the ground truth factors, , is the number of meaningful latent dimensions, and is normalized mutual information . Considering MIG and MIG-sup together will provide a more complete measure of disentanglement, accounting for both the splitting of one factor into multiple dimensions and the encoding of multiple factors into the same dimension. In an ideal disentanglement, both MIG and MIG-sup should be 1, recognizing a one-to-one relationship between a generative factor and a latent dimension. This would have a similar effect to the metric that was proposed in Eastwood and Williams (2018)

, although MIG-based metrics do not rely on training extra classifiers or regressors and are unbiased for hyperparameter settings. The factor metric (

Kim and Mnih (2018)) also has similar properties with MIG-sup, although MIG-sup is stricter on penalizing any amount of other minor factors in the same dimension.

Figure 2: Quantitative comparison of disentanglement metrics. Each point is annotated by the value and averaged over top three best random seeds for the given on the give model. Left to right: reconstruction errors vs. disentanglement metrics of factor, MIG, and MIG-sup, a higher value indicating a better disentanglement in each metric.
Figure 3: MIG vs. MIG-sup following a similar presentation in Fig. 2. A better disentanglement should have higher MIG and higher MIG-sup, locating at the top-right quadrant of the plot.

4 Experiment

We tested the presented pro-VLAE on four benchmark data sets: dSprites (Matthey et al. (2017)), 3DShapes (Burgess and Kim (2018)), MNIST (LeCun et al. (1998)), and CelebA (Liu et al. (2015)), where the first two include ground-truth generative factors that allow us to carry out comprehensive quantitative comparisons of disentangling metrics with existing models. In the following, we first quantitatively compare the disentangling ability of pro-VLAE in comparison to three existing models using three disentanglement metrics. We then analyze pro-VLAE from the aspects of how it learns progressively, its ability to disentangle, and its ability to learn abstractions at different levels.

Comparisons in quantitative disentanglement metrics: For quantitative comparisons, we considered the factor metric in Kim and Mnih (2018), the MIG in Chen et al. (2018), and the MIG-sup presented in this work. We compared pro-VLAE (changing ) with beta-VAE (Higgins et al. (2017)), VLAE (Zhao et al. (2017)) as a hierarchical baseline without progressive training, and the teacher-student model (Lezama (2019)) as the most related progressive VAE without hierarchical representations. All models were considered at different values of except the teacher-student model: the comparison of -VAE, VLAE, and the presented pro-VLAE thus also provides an ablation study on the effect of learning hierarchical representations and doing so in a progressive manner.

For fair comparisons, we strictly required all models to have the same number of latent variables and the same number of training iterations. For instance, if a hierarchical model has three layers that each has three latent dimensions, a non-hierarchical model will have nine latent dimensions; if a progressive method has three progressive steps with 15 epochs of training each, a non-progressive method will be trained for 45 epochs. Three to five experiments were conducted for each model at each

value, and the average of the top three is used for reporting the quantitative results in Fig. 2.

As shown, for MIG and MIG-sup, VLAE generally outperformed -VAE at most values, while pro-VLAE showed a clear margin of improvement over both methods. With the factor metric, pro-VLAE was still among the top performers, although with a smaller margin and a larger overlap with VLAE on 3DShapes, and with -VAE () on dSprites. The teacher-student strategy with Jacobian supervision in general had a low to moderate disentangling score, especially on 3DShapes. This is consistent with the original motivation of the method for progressively learning nuisance variables after the teacher learns to disentangle effectively, rather than progressively disentangling hierarchical factors of variations as intended by pro-VLAE. Note that pro-VLAE in general performed better with a smaller value of (), suggesting that progressive learning already had an effect of promoting disentangling and a high value of may over-promote disentangling at the expense of reconstruction quality.

Fig. 3 shows MIG vs. MIG-sup scores among the tested models. As shown, results from pro-VLAE were well separated from the other three models at the right top quadrant of the plots, obtaining simultaneously high MIG and MIG-sup scores as a clear evidence for improved disentangling ability.

Fig. 4 provides images generated by traversing each latent dimension using the best pro-VLAE (), the best VLAE (), and the teacher-student model on 3DShapes data. As shown, pro-VLAE learned to disentangle the object, wall, and floor color in the deepest layer; the following hierarchy of representations then disentangled objective scale, orientation, and shape, while the lowest-level of abstractions ran out of meaningful generative factors to learn. In comparison, the VLAE distributed six generative factors over the nine latent dimensions, where color was split across the hierarchy and sometimes entangled with the object scale (in ). The teacher-student model was much less disentangled, which we will delve into further in the following section.

Figure 4: Traversing each latent dimension in pro-VLAE (), VLAE (), and teacher-student model. The hierarchy of the latent variables is noted by brackets on the side.
Figure 5: Progressive learning of hierarchical representations. At each progression and for each , the row of images are generated by randomly sampling from its prior distributions while fixing the other latent variables (this is NOT traversing). The green bar at each row tracks the mutual information , while the total mutual information is labeled on top.

Information flow during progressive learning: To further understand what happened during progressive learning, we use mutual information as a surrogate to track the amount of information learned in each hierarchy of latent variables during the progressive learning. We adopted the approach in Chen et al. (2018)

to empirically estimate the mutual information by stratified sampling.

Fig. 5 shows an example from 3DShapes. At progressive step 0, pro-VAE was only learning the deepest latent variables in , discovering most of the generative factors including color, objective shape, and orientation entangled within . At progressive step 1, interestingly, the model was able to “drag” out shape and rotation factors from and disentangle them into along with a new scale factor. Thus decreased from 10.59 to 6.94 while increased from 0.02 to 5.98 in this progression, while the total mutual information increased from 10.61 to 12.84, suggesting the overall learning of more detailed information. Since 3DShapes only has 6 factors, the lowest-level representation had nothing to learn in progressive step 2, and the allocation of mutual information remained nearly unchanged. Note that the sum of ’s does not equal to and suggests the amount of information that is entangled.

In comparison, the teacher-student model was less effective in progressively dragging entangled representations to newly added latent dimensions, as suggested by the slowing changing of ’s during progression and the larger value of

. This suggests that, since the teacher-student model was motivated for progressively learning nuisance variables, the extent to which its capacity can grow for learning new representations is limited by two fundamental causes: 1) because it increases the dimension of the same latent vectors at the same depth, the growth of the network capacity is limited in comparison to

pro-VLAE, and 2) the Jacobian supervision further restricts the student model to maintain the same disentangling ability of the teacher model.

Disentangling hierarchical representations: We also qualitatively examined pro-VLAE on data with both relatively simple (MNIST) and complex (CelebA) factors of variations, all done in unsupervised training. On MNIST (Figure 6), while the deepest latent representations encoded the highest-level features in terms of digit identity, the representations learned at shallower levels encoded changes in writing styles. In Figure 7, we show the latent representation progressively learned in CelebA from the highest to lowest levels of abstractions, along with disentangling within each level demonstrated by traversing one selected dimension at a time. These dimensions are selected as examples associated with clear semantic meanings. As shown, while the deepest latent representation learned to disentangle high-level features such as gender and race, the shallowest representation learned to disentangle low-level features such as eye-shadow. Moreover, the number of distinct representations learned decreased from deep to shallow layers. While demonstrating disentangling by traversing each individual latent dimension or by hierarchically-learned representations has been separately reported in previous works (Higgins et al. (2017); Zhao et al. (2017)), to our knowledge this is the first time the ability of a model to disentangle individual latent factors in a hierarchical manner has been demonstrated. This provides evidence that the presented progressive strategy of learning can improve the disentangling of first the most abstract representations followed by progressively lower levels of abstractions.

Figure 6: Visualization of hierarchical features learnt for MNIST data. Each sub-figure is generated by randomly sampling from the prior distribution of at one abstraction level while fixing the others. The original latent code is inferred from a image with digit “0”. From left to right: encodes the highest abstraction: digit identity; encodes stroke width; and encodes other digit styles.
Figure 7: Visualization of hierarchical features learnt for CelebA data. Each subfigure is generated by traversing along a selected latent dimension in each row within each hierarchy of ’s. From left to right: latent variables to progressively learn major (e.g., gender in and smile in ) to minor representations (e.g. wavy-hair in and eye-shadow in ) in a disentangled manner.

5 Conclusion

In this work, we present a progressive strategy for learning and disentangling hierarchical representations. Starting from a simple VAE, the model first learn the most abstract representation. Next, the model learn independent representations from high- to low-levels of abstraction by progressively growing the capacity of the VAE deep to shallow. Experiments on several benchmark data sets demonstrated the advantages of the presented method. An immediate future work is to include stronger guidance for allocating information across the hierarchy of abstraction levels, either through external multi-scale image supervision or internal information-theoretic regularization strategies.


  • P. Bachman (2016) An architecture for deep, hierarchical generative models. In Advances in Neural Information Processing Systems, pp. 4826–4834. Cited by: §2.
  • Y. Bengio, J. Louradour, R. Collobert, and J. Weston (2015) Curriculum learning. In

    International Conferences on Machine Learning

    Cited by: §1.
  • C. Burgess and H. Kim (2018) 3D shapes dataset. Note: Cited by: §4.
  • T. Q. Chen, X. Li, R. B. Grosse, and D. K. Duvenaud (2018) Isolating sources of disentanglement in variational autoencoders. In Advances in Neural Information Processing Systems, pp. 2610–2620. Cited by: §1, §1, §2, §3.4, §4, §4.
  • E. L. Denton, S. Chintala, A. Szlam, and R. Fergus (2015) Deep generative image models using a laplacian pyramid of adversarial networks. In Advances in Neural Information Processing Systems, pp. 1486–1494. Cited by: §1, §2.
  • C. Eastwood and C. K. Williams (2018) A framework for the quantitative evaluation of disentangled representations. In International Conference on Learning Representations, Cited by: §3.4.
  • J. L. Elman (1993) Learning and development in neural networks: the importance of starting small. Cognition 48 (1), pp. 71–99. Cited by: §1, §2.
  • K. Gregor, I. Danihelka, A. Graves, D. J. Rezende, and D. Wierstra (2015)

    Draw: a recurrent neural network for image generation

    In International Conference on Machine Learning, Cited by: §1, §2.
  • P. K. Gyawali, Z. Li, C. Knight, S. Ghimire, B. M. Horacek, J. Sapp, and L. Wang (2019)

    Improving disentangled representation learning with the beta bernoulli process

    In IEEE International Conference on Data Mining, Cited by: §1.
  • I. Higgins, L. Matthey, A. Pal, C. Burgess, X. Glorot, M. Botvinick, S. Mohamed, and A. Lerchner (2017) Beta-vae: learning basic visual concepts with a constrained variational framework.. In International Conference on Learning Representations, Cited by: §1, §1, §2, §3.1, §3.4, §4, §4.
  • T. Karras, T. Aila, S. Laine, and J. Lehtinen (2018) Progressive growing of gans for improved quality, stability, and variation. In International Conference on Learning Representations, Cited by: §1, §2, §3.3.
  • H. Kim and A. Mnih (2018) Disentangling by factorising. In International Conference on Machine Learning, Cited by: §1, §2, §3.4, §3.4, §4.
  • D. P. Kingma, T. Salimans, R. Jozefowicz, X. Chen, I. Sutskever, and M. Welling (2016) Improved variational inference with inverse autoregressive flow. In Advances in neural information processing systems, pp. 4743–4751. Cited by: §2.
  • Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner (1998) Gradient-based learning applied to document recognition. Proceedings of the IEEE 86 (11), pp. 2278–2324. Cited by: §4.
  • J. Lezama (2019) Overcoming the disentanglement vs reconstruction trade-off via jacobian supervision. In International Conference on Learning Representations, Cited by: §1, §1, §2, §4.
  • C. Li, J. Zhu, and B. Zhang (2016) Learning to generate with memory. In International Conference on Machine Learning, pp. 1177–1186. Cited by: §1, §2.
  • Z. Liu, P. Luo, X. Wang, and X. Tang (2015) Deep learning face attributes in the wild. In

    Proceedings of the IEEE International Conference on Computer Vision

    pp. 3730–3738. Cited by: §4.
  • L. Matthey, I. Higgins, D. Hassabis, and A. Lerchner (2017) DSprites: disentanglement testing sprites dataset. Note: Cited by: §4.
  • D. J. Rezende, S. Mohamed, and D. Wierstra (2014)

    Stochastic backpropagation and approximate inference in deep generative models

    In International Conference on Machine Learning, Cited by: §2, §3.1.
  • C. K. Sønderby, T. Raiko, L. Maaløe, S. K. Sønderby, and O. Winther (2016) Ladder variational autoencoders. In Advances in neural information processing systems, pp. 3738–3746. Cited by: §2.
  • Y. Wang, F. Perazzi, B. McWilliams, A. Sorkine-Hornung, O. Sorkine-Hornung, and C. Schroers (2018) A fully progressive approach to single-image super-resolution. In

    Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops

    pp. 864–873. Cited by: §1, §2.
  • M. D. Zeiler and R. Fergus (2014) Visualizing and understanding convolutional networks. In European Conference on Computer Vision, pp. 818–833. Cited by: §2.
  • H. Zhang, T. Xu, H. Li, S. Zhang, X. Wang, X. Huang, and D. N. Metaxas (2018) Stackgan++: realistic image synthesis with stacked generative adversarial networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 41 (8), pp. 1947–1962. Cited by: §1, §2.
  • S. Zhao, J. Song, and S. Ermon (2017) Learning hierarchical features from deep generative models. In International Conference on Machine Learning, pp. 4091–4099. Cited by: Figure 10, §1, §1, §2, §3.1, §4, §4.


Appendix A Examples of performance of different metrics

Figure 8: An example of one factor being encoded in multiple dimensions. Each row is a traverse for one dimension (dimension order adjusted for better visualization). Notice that both dim1 and dim2 are encoding floor-color, both dim3 and dim4 are encoding wall-color, and both dim5 and dim6 are encoding object color. Therefore, the MIG is very low since it penalizes splitting one factor to multiple dimensions. On the other hand, the MIG-sup and factor-metric is not too bad since one dimension mainly encodes one factor, even though there are some entanglement of color-vs-shape and color-vs-scale.
Figure 9: An example of one dimension containing multiple factors. Each row is a traverse for one dimension (dimension order adjusted for better visualization). Notice that both models achieve high and similar MIG because all 6 factors are encoded and no splitting to multiple dimensions. However, the right-hand side model has much lower MIG-sup and factor-metric than the left-hand side model. Because both scale and shape are encoded in dim5, while dim6 has no factor. Both MIG-sup and factor-metric penalize encoding multiple factors in one dimension. Besides, our MIG-sup is lower and drops more than factor-metric because MIG-sup is stricter in this case.

Appendix B A closer comparison with VLAE

b.1 Two dimensional traversing on MNIST dataset

Figure 10: MNIST traversing results following the same generation strategy and network hierarchy as those presented in Figure 5 of (Zhao et al. (2017)). The network has 3 layers and 2 dimensional latent code at each layer. Each image is generated by traversing each of the two-dimensional latent code in one layer, while randomly sampling from the other layers. From left to right: The top layer encodes the digit identity and tilt; encodes digit width (digits around top-left are thicker than digits around bottom-right); and the bottom layer encodes stroke width. Compared to VLAE, the representation learnt in the presented method suggests smoother traversing on digits and similar results for digit width and stroke width.

b.2 Information allocation in each layer

3DShapes total
VLAE 4.41 4.69 5.01 12.75
pro-VLAE 6.94 6.07 0.00 13.02
Table 1: Mutual information between data and latent codes at each -th depth of the network, corresponding to the qualitative results presented in Fig. 4 and Fig. 6 on 3Dshapes and MNIST data sets. Both VLAE and the presented -VLAE models have the same hierarchical architecture with 3 layers and 3 latent dimensions for each layer. Compared to VLAE, the presented method allocates information in a more clear descending order owing to the progressive learning.
MNIST total
VLAE 8.28 8.89 7.86 11.04
pro-VLAE 9.83 8.24 6.28 10.93

Appendix C Ablation study on implementation strategies

no strategies pre-trained KL only fade-in only Both
0.0 0.667 0.733 0.867
Table 2: The effect of progressive implementation strategies, i.e., “fade-in” and pre-trained KL penalty, on successful training rates. We conducted 15 ablations experiments that each has 4 sub-experiments. As shown, the pro-VLAE cannot be trained successfully without the presented implementation strategies, while each of the strategies helps stabilize the progressive training.

Appendix D Closer investigation of Information flow over latent variables

In this section, we present additional quantitative results on how information flow among the latent variables during progressive training. We conducted experiments on both 3DShapes and MNIST data sets, considering different hierarchical architectures including a combination of different number of latent layers and different number of latent dimensions

for each layer. Each experiment was repeated three times with random initializations, from which the mean and the standard deviation of mutual information

were computed.

As shown in Tables 3-8, for all hierarchical architectures, the information amount in each layer is captured in a clear descending order, which aligns with the motivation of the presented progressive learning strategy. Generally, the information also tends to flow from previous layers to new layers, suggesting a disentanglement of latent factors as new latent layers are added. This is especially obvious for 3DShapes data where the generative factors are better defined.

In addition, models with small latent codes () are not able to learn the same amount of information (total ) as those with larger latent codes (). The variance of information in each layer in the former also appears to be high. We reason that it may be because that the model is trying to squeeze too much information into a small code, resulting in large vibrations during progressive learning. On the other hand, while a model has large latent codes (), the information flow becomes less clear after the addition of certain layers. Overall, assuming there are generative factors and there are dimensions in total available in model, ideally we would like to design the model such that . However, since is unknown in most data, and become hyperparameters that need to be tuned for different data sets.

progressive step total
Table 3: 3DShapes,
progressive step total
Table 4: 3DShapes,
progressive step total
Table 5: 3DShapes,
progressive step total
Table 6: MNIST,
progressive step total
Table 7: MNIST,
progressive step total
Table 8: MNIST,