Title: UNSUPERVISED MODEL SELECTION FOR VARIATIONAL DISENTANGLED REPRESENTATION LEARNING

Abstract: Disentangled representations have recently been shown to improve fairness, data efficiency and generalisation in simple supervised and reinforcement learning tasks. To extend the benefits of disentangled representations to more complex domains and practical applications, it is important to enable hyperparameter tuning and model selection of existing unsupervised approaches without requiring access to ground truth attribute labels, which are not available for most datasets. This paper addresses this problem by introducing a simple yet robust and reliable method for unsupervised disentangled model selection. Our approach, Unsupervised Disentanglement Ranking (UDR) 1 , leverages the recent theoretical results that explain why variational autoencoders disentangle (Rolinek et al., 2019) , to quantify the quality of disentanglement by performing pairwise comparisons between trained model representations. We show that our approach performs comparably to the existing supervised alternatives across 5400 models from six state of the art unsupervised disentangled representation learning model classes. Furthermore, we show that the ranking produced by our approach correlates well with the final task performance on two different domains. * Equal contribution. 1 We have released the code for our method as part of disentanglement_lib

1. INTRODUCTION:

Happy families are all alike; every unhappy family is unhappy in its own way. -Leo Tolstoy, Anna Karenina Despite the success of deep learning in the recent years (Hu et al., 2018; Espeholt et al., 2018; Silver et al., 2018; Lample et al., 2018; Hessel et al., 2017; Oord et al., 2016) , the majority of state of the art approaches are still missing many basic yet important properties, such as fairness, data efficient learning, strong generalisation beyond the training data distribution, or the ability to transfer knowledge between tasks (Lake et al., 2016; Garnelo et al., 2016; Marcus, 2018) . The idea that a good representation can help with such shortcomings is not new, and recently a number of papers have demonstrated that models with disentangled representations show improvements in terms of these shortcomings (Higgins et al., 2017b; 2018b; Achille et al., 2018; Steenbrugge et al., 2018; Nair et al., 2018; Laversanne-Finot et al., 2018; van Steenkiste et al., 2019; Locatello et al., 2019) . A common intuitive way to think about disentangled representations is that it should reflect the compositional Figure 1 : Latent traversals for one of the best and worst ranked trained β-VAE models using the Unsupervised Disentanglement Ranking (UDR L ) method on the 3D Cars dataset. For each seed image we fix all latents z i to the inferred value, then vary the value of one latent at a time to visualise its effect on the reconstructions. The high scoring model (left 3 blocks) appears well disentangled, since individual latents have consistent semantic meaning across seeds. The low scoring model (right block) is highly entangled, since the latent traversals are not easily interpretable.

structure of the world. For example, to describe an object we often use words pertaining to its colour, position, shape and size. We can use different words to describe these properties because they relate to independent factors of variation in our world, i.e. properties which can be compositionally recombined. Hence a disentangled representation of objects should reflect this by factorising into dimensions which correspond to those properties (Bengio et al., 2013; Higgins et al., 2018a) .

The ability to automatically discover the compositional factors of complex real datasets can be of great importance in many practical applications of machine learning and data science. However, it is important to be able to learn such representations in an unsupervised manner, since most interesting datasets do not have their generative factors fully labelled. For a long time scalable unsupervised disentangled representation learning was impossible, until recently a new class of models based on Variational Autoencoders (VAEs) (Kingma & Welling, 2014; Rezende et al., 2014) was developed. These approaches (Higgins et al., 2017a; Burgess et al., 2017; Chen et al., 2018; Kumar et al., 2017; Kim & Mnih, 2018) scale reasonably well and are the current state of the art in unsupervised disentangled representation learning. However, so far the benefits of these techniques have not been widely exploited because of two major shortcomings: First, the quality of the achieved disentangling is sensitive to the choice of hyperparameters, however, model selection is currently impossible without having access to the ground truth generative process and/or attribute labels, which are required by all the currently existing disentanglement metrics (Higgins et al., 2017a; Kim & Mnih, 2018; Chen et al., 2018; Eastwood & Williams, 2018; Ridgeway & Mozer, 2018) . Second, even if one could apply any of the existing disentanglement metrics for model selection, the scores produced by these metrics can vary a lot even for models with the same hyperparameters and trained on the same data (Locatello et al., 2018) . While a lot of this variance is explained by the actual quality of the learnt representations, some of it is introduced by the metrics themselves. In particular, all of the existing supervised disentanglement metrics assume a single "canonical" factorisation of the generative factors, any deviation from which is penalised. Such a "canonical" factorisation, however, is not chosen in a principled manner. Indeed, for the majority of datasets, apart from the simplest ones, multiple equally valid disentangled representations may be possible (see Higgins et al. (2018a) for a discussion). For example, the intuitive way that humans reason about colour is in terms of hue and saturation. However, colour may also be represented in RGB, YUV, HSV, HSL, CIELAB. Any of the above representations are as valid as each other, yet only one of them is allowed to be "canonical" by the supervised metrics. Hence, a model that learns to represent colour in a subspace aligned with HSV will be penalised by a supervised metric which assumes that the canonical disentangled representation of colour should be in RGB. This is despite the fact that both representations are equal in terms of preserving the compositional property at the core of what makes disentangled representations useful (Higgins et al., 2018a) . Hence, the field finds itself in a predicament. From one point of view, there exists a set of approaches capable of reasonably scalable unsupervised disentangled representation learning. On the other hand, these models are hard to use in practice, because there is no easy way to do a hyperparameter search and model selection.

This paper attempts to bridge this gap. We propose a simple yet effective method for unsupervised model selection for the class of current state-of-the-art VAE-based unsupervised disentangled representation learning methods. Our approach, Unsupervised Disentanglement Ranking (UDR), leverages the recent theoretical results that explain why variational autoencoders disentangle (Rolinek et al., 2019) , to quantify the quality of disentanglement by performing pairwise comparisons between trained model representations. We evaluate the validity of our unsupervised model selection metric against the four best existing supervised alternatives reported in the large scale study by Locatello et al. (2018) : the β-VAE metric (Higgins et al., 2017a) , the FactorVAE metric (Kim & Mnih, 2018) , Mutual Information Gap (MIG) (Chen et al., 2018) and DCI Disentanglement scores (Eastwood & Williams, 2018) . We do so for all existing state of the art disentangled representation learning approaches: β-VAE (Higgins et al., 2017a) , CCI-VAE (Burgess et al., 2017) , FactorVAE (Kim & Mnih, 2018) , TC-VAE (Chen et al., 2018) and two versions of DIP-VAE (Kumar et al., 2017) . We validate our proposed method on two datasets with fully known generative processes commonly used to evaluate the quality of disentangled representations: dSprites (Matthey et al., 2017) and 3D Shapes (Burgess & Kim, 2018) , and show that our unsupervised model selection method is able to match the supervised baselines in terms of guiding a hyperparameter search and picking the most disentangled trained models both quantitatively and qualitatively. We also apply our approach to the 3D Cars dataset (Reed et al., 2014) , where the full set of ground truth attribute labels is not available, and confirm through visual inspection that the ranking produced by our method is meaningful (Fig. 1 ). Overall we evaluate 6 different model classes, with 6 separate hyperparameter settings and 50 seeds on 3 separate datasets, totalling 5400 models and show that our method is both accurate and consistent across models and datasets. Finally, we validate that the model ranking produced by our approach correlates well with the final task performance on two recently reported tasks: a classification fairness task (Locatello et al., 2019) and a model-based reinforcement learning (RL) task (Watters et al., 2019) . Indeed, on the former our approach outperformed the reported supervised baseline scores.

2. OPERATIONAL DEFINITION OF DISENTANGLING:

Given a dataset of observations X = {x 1 ,...,x N }, we assume that there exist a number of plausible generative processes g i that produce the observations from a small set of corresponding K i independent generative factors c i . For each choice of i, g :

c n → x n , where p(c n ) = K j=1 p(c j n ).

For example, a dataset containing images of an object, which can be of a particular shape and colour, and which can be in a particular vertical and horizontal positions, may be created by a generative process that assumes a ground truth disentangled factorisation into shape x colour x position, or shape x hue x saturation x position X x position Y. We operationalise a model as having learnt a disentangled representation, if it learns to invert of one of the generative processes g i and recover a latent representation z ∈ R L , so that it best explains the observed data p(z,x) ≈ p(c i ,x), and factorises the same way as the corresponding data generative factors c i . The choice of the generative process can be determined by the interaction between the model class and the observed data distribution p(x), as discussed next in Sec. 3.1.

3. VARIATIONAL UNSUPERVISED DISENTANGLING:

The current state of the art approaches to unsupervised disentangled representation learning are based on the Variational Autoencoder (VAE) framework (Rezende et al., 2014; Kingma & Welling, 2014) . VAEs attempt to estimate the lower bound on the joint distribution of the data and the latent factors p(x,z) by optimising the following objective:

L V AE = E p(x) [ E q φ (z|x) [log p θ (x|z)]-KL(q φ (z|x) || p(z)) ] (1)

where, in the usual case, the prior p(z) is chosen to be an isotropic unit Gaussian. In order to encourage disentangling, different approaches decompose the objective in Eq. 1 into various terms and change their relative weighting. In this paper we will consider six state of the art approaches to unsupervised disentangled representation learning that can be grouped into three broad classes based on how they modify the objective in Eq. 1: 1) β-VAE (Higgins et al., 2017a) and CCI-VAE (Burgess et al., 2017) upweight the KL term; 2) FactorVAE (Kim & Mnih, 2018) and TC-VAE (Chen et al., 2018) introduce a total correlation penalty; and 3) two different implementations of DIP-VAE (-I and -II) (Kumar et al., 2017) penalise the deviation of the the marginal posterior from a factorised prior (see Sec. A.4.1 in Supplementary Material for details).

3.1. WHY DO VAES DISENTANGLE?:

In order to understand the reasoning behind our proposed unsupervised disentangled model selection method, it is first important to understand why VAEs disentangle. The objective in Eq. 1 does not in itself encourage disentangling, as discussed in Rolinek et al. (2019) and Locatello et al. (2018) . Indeed, any rotationally invariant prior makes disentangled representations learnt in an unsupervised setting unidentifiable when optimising Eq. 1. This theoretical result is not surprising and has been known for a while in the ICA literature (Comon, 1994) , however what is surprising is that disentangling VAEs appear to work in practice. The question of what makes VAEs disentangle was answered by Rolinek et al. (2019) , who were able to show that it is the peculiarities of the VAE implementation choices that allow disentangling to emerge (see also discussion in Burgess et al. (2017) ; Mathieu et al. (2019) ). In particular, the interactions between the reconstruction objective (the first term in Eq. 1) and the enhanced pressure to match a diagonal prior created by the modified objectives of the disentangling VAEs, force the decoder to approximate PCA-like behaviour locally around the data samples. Rolinek et al. (2019) demonstrated that during training VAEs often enter the so-called "polarised regime", where many of the latent dimensions of the posterior are effectively switched off by being reduced to the prior q φ (z j ) = p(z j ) (this behaviour is often further encouraged by the extra disentangling terms added to the ELBO). When trained in such a regime, a linear approximation of the Jacobian of the decoder around a data sample x i ,

J i = ∂Dec θ (µ φ (xi)) ∂µ φ (xi)

, is forced to have orthogonal columns, and hence to separate the generative factors based on the amount of reconstruction variance they induce. Given that the transformations induced by different generative factors will typically have different effects on the pixel space (e.g. changing the position of a sprite will typically affect more pixels than changing its size), such local orthogonalisation of the decoder induces an identifiable disentangled latent space for each particular dataset. An equivalent statement is that for a well disentangled VAE, the SVD decomposition J = U ΣV of the Jacobian J calculated as above, results in a trivial V , which is a signed permutation matrix.

4. UNSUPERVISED DISENTANGLED MODEL SELECTION:

We now describe how the insights from Sec. 3.1 motivate the development of our proposed Unsupervised Disentanglement Ranking (UDR) method. Our method relies on the assumption that for a particular dataset and a VAE-based unsupervised disentangled representation learning model class, disentangled representations are all alike, while every entangled representation is entangled in its own way, to rephrase Tolstoy. We justify this assumption next.

Disentangled representations are similar According to Rolinek et al. (2019) for a given non-adversarial dataset a disentangling VAE will likely keep converging to the same disentangled representation (up to permutation and sign inverse). Note that this representation will correspond to a single plausible disentangled generative process g i using the notation we introduced in Sec. 2. This is because any two different disentangled representations z a and z b learnt by a VAE-based model will only differ in terms of the corresponding signed permutation matrices V a and V b of the SVD decompositions of the locally linear approximations of the Jacobians of their decoders.

Entangled representations are different Unfortunately the field of machine learning has little theoretical understanding of the nature and learning dynamics of internal representations in neural networks. The few pieces of research that have looked into the nature of model representations (Raghu et al., 2017; Li et al., 2016; Wang et al., 2018; Morcos et al., 2018) have been empirical rather than theoretical in nature. All of them suggest that neural networks tend to converge to different hidden representations despite being trained on the same task with the same hyperparameters and architecture and reaching similar levels of task performance. Furthermore, the theoretical analysis and the empirical demonstrations in Rolinek et al. (2019) suggest that the entangled VAEs learn representations that are different at least up to a rotation induced by a non-degenerate matrix V in the SVD decomposition of the local linear approximation of the decoder Jacobian J i .

The justifications presented above rely on the theoretical work of Rolinek et al. (2019) , which was empirically verified only for the β-VAE. We have reasons to believe that the theory also holds for the other model classes presented in this paper, apart from DIP-VAE-I. We empirically verify that this is the case in Sec. A.10 in Supplementary Materials. Furthermore, in Sec. 5 we show that our proposed method works well in practice across all model classes, including DIP-VAE-I.

Unsupervised Disentanglement Ranking Our proposed UDR method consists of four steps (illustrated in Fig. 4 in Supplementary Material):

1. Train M = H ×S models, where H is the number of different hyperparameter settings, and S is the number of different initial model weight configurations (seeds). 2. For each trained model i ∈ {1,...,M }, sample without replacement P ≤ S other trained models with the same hyperparameters but different seeds. 3. Perform P pairwise comparisons per trained model and calculate the respective UDR ij scores, where i ∈ {1,...,M } is the model index, and j ∈ {1,...,P } is its unique pairwise match from Step 2. 4. Aggregate UDR ij scores for each model i to report the final UDR i = avg j (UDR ij ) scores, where avg j (•) is the median over P scores.

The key part of the UDR method is Step 3, where we calculate the UDR ij score that summarises how similar the representations of the two models i and j are. As per the justifications above, two latent representations z i and z j should be scored as highly similar if they axis align with each other up to permutation (the same ground truth factor c k may be encoded by different latent dimensions within the two models, z i,a and z j,b where a = b), sign inverse (the two models may learn to encode the values of the generative factor in the opposite order compared to each other, z i,a = -z j,b ), and subsetting (one model may learn a subset of the factors that the other model has learnt if the relevant disentangling hyperparameters encourage a different number of latents to be switched off in the two models). In order for the UDR to be invariant to the first scenario, we propose calculating a full L×L similarity matrix R ij between the individual dimensions of z i ∈ R L and z j ∈ R L (see Fig. 5 in Supplementary Material). In order to address the second point, we take the absolute value of the similarity matrix

|R ij |.

Finally, to address the third point, we divide the UDR score by the average number of informative latents discovered by the two models. Note that even though disentangling often happens when the VAEs enter the "polarised regime", where many of the latent dimensions are switched off, the rankings produced by UDR are not affected by whether the model operates in such a regime or not.

To populate the similarity matrix R ij we calculate each matrix element as the similarity between two vectors z i,a and z j,b , where z i,a is a response of a single latent dimension z a of model i over the entire ordered dataset or a fixed number of ordered mini-batches if the former is computationally restrictive (see Sec. A.5 in Supplementary Material for details). We considered two versions of the UDR score based on the method used for calculating the vector similarity: the non-parametric UDR S , using Spearman's correlation; and the parametric UDR L , using Lasso regression following past work on evaluating representations (Eastwood & Williams, 2018; Li et al., 2016) . In practice the Lasso regression version worked slightly better, so the remainder of the paper is restricted to UDR L (we use UDR L and UDR interchangeably to refer to this version), while UDR S is discussed in the Supplementary Materials.

Given a similarity matrix R ij , we want to find one-to-one correspondence between all the informative latent dimensions within the chosen pair of models. Hence, we want to see at most a single strong correlation in each row and column of the similarity matrix. To that accord, we step through the matrix R = |R ij |, one column and row at a time, looking for the strongest correlation, and weighting it by the proportional weight it has within its respective column or row. We then average all such weighted scores over all the informative row and column latents to calculate the final UDR ij score: We define a latent dimension as "informative" if it has learnt a latent posterior which diverges from the prior:

EQUATION

I KL (a) = 1 KL(q φ (z a |x) || p(z a )) > 0.01 0 otherwise (3)

UDR variations We explored whether doing all-to-all pairwise comparisons, with models in

Step 2 sampled from the set of all M models rather than the subset of S models with the same hyperparameters, would produce more accurate results. Additionally we investigated the effect of choosing different numbers of models P for pairwise comparisons by sampling P ∼ U [5, 45] . UDR assumptions and limitations Note that our approach is aimed at the current state of the art disentangling VAEs, for which the assumptions of our metric have been demonstrated to hold (Rolinek et al., 2019) . It may be applied to other model classes, however the following assumptions and limitations need to be considered:

1. Disentangled representations produced by two models from the same class trained on the same dataset are likely to be more similar than entangled representations -this holds for disentangling VAEs (Rolinek et al., 2019) , but may not hold more broadly.

2. Continuous, monotonic and scalar factors -UDR assumes that these properties hold for the data generative factors and their representations. This is true for the disentangling approaches described in Sec. To summarise, UDR relies on a number of assumptions and has certain limitations that we hope to relax in future work. However, it offers improvements over the existing supervised metrics. Apart from being the only method that does not rely on supervised attribute labels, its scores are often more representative of the true disentanglement quality (e.g. see Fig. 3 and Fig. 9 in Supplementary Materials), and it does not assume a single "canonical" disentangled factorisation per dataset. Hence, we believe that UDR can be a useful method for unlocking the power of unsupervised disentangled representation learning to real-life practical applications, at least in the near future.

5. EXPERIMENTS:

Our hope was to develop a method for unsupervised disentangled model selection with the following properties: it should 1) help with hyperparameter tuning by producing an aggregate score that can be used to guide evolutionary or Bayesian methods (Jaderberg et al., 2018; Snoek et al., 2012; Thornton et al., 2012; Bergstra et al., 2011; Hutter et al., 2011; Miikkulainen et al., 2017) ; 2) rank individual trained models based on their disentanglement quality; 3) correlate well with final task performance.

In this section we evaluate our proposed UDR against these qualities. For the reported experiments we use the trained model checkpoints and supervised scores from Locatello et al. (2018) UDR is useful for hyperparameter selection. Fig. 2 compares the scores produced by UDR and the four supervised metrics for 3600 trained models, split over six model classes, two datasets and six hyperparameter settings. We consider the median score profiles across the six hyperparameter settings to evaluate whether a particular setting is better than others. It can be seen that UDR broadly agrees with the supervised metrics on which hyperparameters are more promising for disentangling. This holds across datasets and model classes. Hence, UDR may be useful for evaluating model fitness for disentangled representation learning as part of an evolutionary algorithm or Bayesian hyperparameter tuning.

UDR is useful for model selection. Fig. 2 can also be used to examine whether a particular trained model has learnt a good disentangled representation. We see that some models reach high UDR scores. For example, more models score highly as the value of the β hyperparameter is increased in the β-VAE model class. This is in line with the previously reported results (Higgins et al., 2017a) . Note that the 0th hyperparameter setting in this case corresponds to β = 1, which is equivalent to the standard VAE objective (Kingma & Welling, 2014; Rezende et al., 2014) . As expected, these models score low in terms of disentangling. We also see that for some model classes (e.g. DIP-VAE-I, DIP-VAE-II and FactorVAE on dSprites) no trained model scores highly according to UDR. This suggests that none of the hyperparameter choices explored were good for this particular dataset, and that no instance of the model class learnt to disentangle well. To test this, we use latent traversals to qualitatively evaluate the level of disentanglement achieved by the models, ranked by their UDR scores. This is a common technique to qualitatively evaluate the level of disentanglement on simple visual datasets where no ground truth attribute labels are available. Such traversals involve changing the value of one latent dimension at a time and evaluating its effect on the resulting reconstructions to understand whether the latent has learnt to represent anything semantically meaningful. Fig. 3 demonstrates that the qualitative disentanglement quality is reflected well in the UDR scores. The figure also highlights that the supervised metric scores can sometimes be overoptimistic. For example, compare TC-VAE and β-VAE traversals in Fig. 3 . These are scored similarly by the supervised metric (0.774 and 0.751) but differently by UDR (0.444 and 0.607). Qualitative evaluation of the traversals clearly shows that β-VAE learnt a more disentangled representation than TC-VAE, which is captured by UDR but not by the supervised metric. Fig. 9 in Supplementary Material provides more examples. We also evaluated how well UDR ranks models trained on more complex datasets, CelebA and ImageNet, and found that it performs well (see Sec. A.9 in Supplementary Materials). UDR works well even with five pairwise comparisons. We test the effect of the number of pairwise comparisons P on the variance and accuracy of the UDR scores. Tbl. 2 reports the changes in the rank correlation with the β-VAE metric on the dSprites dataset as P is varied between 5 and 45.

We see that the correlation between the UDR and the β-VAE metric becomes higher and the variance decreases as the number of seeds is increased. However, even with P = 5 the correlation is reasonable.

UDR generalises to a dataset with no attribute labels. We investigate whether UDR can be useful for selecting well disentangled models trained on the 3D Cars (Reed et al., 2014) dataset with poorly labelled attributes, which makes it a bad fit for supervised disentanglement metrics. Fig. 1 shows that a highly ranked model according to UDR appears disentangled, while a poorly ranked one appears entangled. Fig. 10 in Supplementary Material provides more examples of high and low scoring models according to the UDR method.

UDR predicts final task performance. We developed UDR to help practitioners use disentangled representations to better solve subsequent tasks. Hence, we evaluate whether the model ranking produced by UDR correlates with task performance on two different domains: the fairness on a classification task introduced by Locatello et al. (2018) , and data efficiency on a clustering task for a model-based reinforcement learning agent introduced by Watters et al. ( 2019) (see Sec. A.8 in Supplementary Materials for more details). We found that UDR had an average of 0.8 Spearman correlation with the fairness scores, which is higher than the average of 0.72 correlation between fairness and supervised scores reported by Locatello et al. (2018) . We also found that UDR scores had 0.56 Spearman correlation with data efficiency of the COBRA agent. The difference between the best and the worst models according to UDR amounted to around 66% reduction in the number of steps to 90% success rate on the task.

6. CONCLUSION:

We have introduced UDR, the first method for unsupervised model selection for variational disentangled representation learning. We have validated our approach on 5400 models covering all six state of the art VAE-based unsupervised disentangled representation learning model classes.

We compared UDR to four existing supervised disentanglement metrics both quantitatively and qualitatively, and demonstrated that our approach works reliably well across three different datasets, often ranking models more accurately than the supervised alternatives. Moreover, UDR avoids one of the big shortcomings of the supervised disentangling metrics -the arbitrary choice of a "canonical" disentangled factorisation, instead allowing any of the equally valid disentangled generative processes to be accepted. Finally, we also demonstrated that UDR is useful for predicting final task performance using two different domains. Hence, we hope that UDR can be a step towards unlocking the power of unsupervised disentangled representation learning to real-life applications.

A SUPPLEMENTARY MATERIAL:

A.1 USEFUL PROPERTIES OF DISENTANGLED REPRESENTATIONS Disentangled representations are particularly useful because they re-represent the information contained in the data in a way that enables semantically meaningful compositionality. For example, having discovered that the data is generated using two factors, colour and shape, such a model would be able to support meaningful reasoning about fictitious objects, like pink elephants, despite having never seen one during training (Higgins et al., 2017b; 2018b) . This opens up opportunities for counterfactual reasoning, more robust and interpretable inference and model-based planning (Higgins et al., 2018a; Suter et al., 2018) . Furthermore, such a representation would support more data efficient learning for subsequent tasks, like a classification objective for differentiating elephants from cats. This could be achieved by ignoring the nuisance variables irrelevant for the task, e.g. the colour variations, by simply masking out the disentangled subspaces that learnt to represent such nuisances, while only paying attention to the task-relevant subspaces, e.g. the units that learnt to represent shape (Cohen & Welling, 2016; Gens & Domingos, 2014; Soatto, 2010) . Hence, the semantically meaningful compositional nature of disentangled representations is perhaps the most sought after aspect of disentangling, due to its strong implications for generalisation, data efficiency and interpretability (Schmidhuber, 1992; Bengio et al., 2013; Higgins et al., 2018a) .

A.2 ASPECTS OF DISENTANGLEMENT MEASURED BY DIFFERENT METRICS:

Methods for evaluating and comparing representations have been proposed in the past. The most similar approaches to ours are the DCI Disentanglement score from Eastwood & Williams (2018) and the axis alignment comparison of representations in trained classifiers proposed in Li et al. (2016) . The former is not directly applicable for unsupervised disentangled model selection, since it requires access to the ground truth attribute labels. Even when adapted to compare two latent representations, our preliminary experiments suggested that the entropy based aggregation proposed in Eastwood & Williams (2018) is inferior to our aggregation in Eq. 2 when used in the UDR setup. The approach by Li et al. (2016) shares the similarity matrix calculation step with us, however they never go beyond that quantitatively, opting for qualitative evaluations of model representations instead. Hence, their approach is not directly applicable to quantitative unsupervised disentangled model ranking.

Other related approaches worth mentioning are the Canonical Correlation Analysis (CCA) and its modifications (Hardoon et al., 2004; Raghu et al., 2017; Morcos et al., 2018) . These approaches, however, tend to be invariant to invertible affine transformations and therefore to the axis alignment of individual neurons, which makes them unsuitable for evaluating disentangling quality. Finally, Representation Similarity Matrix (RSM) (Kriegeskorte et al., 2008 ) is a commonly used method in Neuroscience for comparing the representations of different systems to the same set of stimuli. This technique, however, is not applicable for measuring disentangling, because it ignores dimension-wise response properties.

When talking about disentangled representations, three properties are generally considered: modularity, compactness and explicitness2 (Ridgeway & Mozer, 2018) . Modularity measures whether each latent dimension encodes only one data generative factor, compactness measures whether each data generative factor is encoded by a single latent dimension, and explicitness measures whether all the information about the data generative factors can be decoded from the latent representation. We believe that modularity is the key aspect of disentangling, since it measures whether the representation is compositional, which gives disentangled representations the majority of their beneficial properties (see Sec. A.1 in Supplementary Materials for more details). Compactness, on the other hand, may not always be desirable. For example, according to a recent definition of disentangled representations (Higgins et al., 2018a) , it is theoretically impossible to represent 3D rotation in a single dimension (see also Ridgeway & Mozer (2018) ). Finally, while explicitness is clearly desirable for preserving information about the data that may be useful for subsequent tasks, in practice models often fail to discover and represent the full set of the data generative factors due to restrictions on both the observed data distribution and the model capacity (Mathieu et al., 2019) . Hence, we suggest noting the explicitness of a representation, but not necessarily punishing its disentanglement ranking if it is not fully explicit. Instead, we suggest that the practitioner should have the choice to select the most disentangled model given a particular number of discovered generative factors. Hence, in the rest of the paper we will use the term "disentanglement" to refer to the compositional property of a representation related to the modularity measure. Tbl. 3 provides a summary of how the different metrics considered in the paper compare in terms of modularity, compactness and explicitness.

A.3 DATASET DETAILS:

dSprites A commonly used unit test for evaluating disentangling is the dSprites dataset (Matthey et al., 2017) .

This dataset consists of images of a single binary sprite pasted on a blank background and can be fully described by five generative factors: shape (3 values), position x (32 values), position y (32 values), size (6 values) and 

METRIC M C E β-VAE √ × √ FACTORVAE √ √ √ MIG √ √ √ DCI DISENTANGLEMENT √ × × UDR √ × ×

rotation (40 values). All the generative factors are sampled from a uniform distribution. Rotation is sampled from the full 360 degree range. The generative process for this dataset is fully deterministic, resulting in 737,280 total images produced from the Cartesian product of the generative factors.

3D Shapes A more complex dataset for evaluating disentangling is the 3D Shapes dataset (Burgess & Kim, 2018) . This dataset consists of images of a single 3D object in a room and is fully specified by six generative factors: floor colour (10 values), wall colour (10 values), object colour (10 values), size (8 values), shape (4 values) and rotation (15 values). All the generative factors are sampled from a uniform distribution. Colours are sampled from the circular hue space. Rotation is sampled from the [-30, 30] degree angle range.

3D Cars This dataset was adapted from Reed et al. (2014) . The full data generative process for this dataset is unknown. The labelled factors include 199 car models and 24 rotations sampled from the full 360 degree out of plane rotation range. An example of an unlabelled generative factor is the colour of the car -this varies across the dataset.

A.4 UNSUPERVISED DISENTANGLED REPRESENTATION LEARNING MODELS:

As mentioned in Sec. 3, current state of the art approaches to unsupervised disentangled representation learning are based on the VAE (Kingma & Welling, 2014; Rezende et al., 2014) objective presented in Eq. 1. These approaches decompose the objective in Eq. 1 into various terms and change their relative weighting to exploit the trade-off between the capacity of the latent information bottleneck with independent sources of noise, and the quality of the resulting reconstruction in order to learn a disentangled representation. The first such modification was introduced by Higgins et al. (2017a) in their β-VAE framework:

EQUATION

In order to achieve disentangling in β-VAE, the KL term in Eq. 4 is typically up-weighted by setting β > 1. This implicitly reduces the latent bottleneck capacity and, through the interaction with the reconstruction term, encourages the generative factors c k with different reconstruction profiles to be encoded by different independent noisy channels z l in the latent bottleneck. Building on the β-VAE ideas, CCI-VAE (Burgess et al., 2017) suggested slowly increasing the bottleneck capacity during training, thus improving the final disentanglement and reconstruction quality:

EQUATION

Later approaches (Kim & Mnih, 2018; Chen et al., 2018; Kumar et al., 2017) showed that the KL term in Eq. 1 can be further decomposed according to:

EQUATION

Hence, penalising the full KL term as in Eqs. 4-5 is not optimal, since it unnecessarily penalises the mutual information between the latents and the data. To remove this undesirable side effect, different authors suggested instead adding more targeted penalised terms to the VAE objective function. These include different implementations of the total correlation penalty (FactorVAE by Kim & Mnih (2018) and TC-VAE by Chen et al. ( 2018)):

EQUATION

and different implementations of the penalty that pushes the marginal posterior towards a factorised prior (DIP-VAE by Kumar et al. (2017) ):

EQUATION

A.4.1 MODEL IMPLEMENTATION DETAILS:

We re-used the trained checkpoints from Locatello et al. (2018) , hence we recommend the readers to check the original paper for model implementation details. Briefly, the following architecture and optimiser were used.

EQUATION

where a β value of 1 corresponds to the vanilla VAE model. Increasing β enforces a stronger prior on the latent distribution and encourages the representation to be independent.

CCI-VAE:

The CCI-VAE model (Burgess et al., 2017) is a variant of the β-VAE where the KL divergence is encouraged to match a controlled value C which is increased gradually throughout training. This yields us the objective function for CCI-VAE.

EQUATION

FactorVAE FactorVAE (Kim & Mnih, 2018) specifically penalises the dependencies between the latent dimensions such that the "Total Correlation" term is targeted yielding a modified version of the β-VAE objective.

EQUATION

The "Total Correlation" term is intractable in this case so for FactorVAE, samples are used from both q(z|x) and q(z) as well as the density-ratio trick to compute an estimate of the "Total Correlation" term. FactorVAE uses an additional discriminator network to approximate the density ratio in the KL divergence. The implementation details for the discriminator network and its hyperparameters can be found in Table 5 (b) and 5(c).

TC-VAE:

The TC-VAE model (Chen et al., 2018) which independently from FactorVAE has a similar objective KL regulariser which contains a "Total Correlation" term. In the case of TC-VAE the "Total Correlation" term is estimated using a biased Monte-Carlo estimate.

( 

E p(x) [ E q φ (z|x) [log p θ (x|z)]-KL(q φ (z|x) || p(z)) ] -λ od i =j [Cov p(x) [µ φ (x)]] 2 ij -λ d i ([Cov p(x) [µ φ (x)]]ii -1) 2 (12)

or Covq φ [z] is used instead yielding the DIP-VAE-II objective.

E p(x) [ E q φ (z|x) [log p θ (x|z)]-KL(q φ (z|x) || p(z)) ] -λ od i =j [Covq φ [z]] 2 ij -λ d i ([Covq φ [z]]ii -1) 2 (13)

A.5 UDR IMPLEMENTATION DETAILS Similarity matrix To compute the similarity matrix Rij we follow the approach of Li et al. (2016) and Morcos et al. (2018) . For a given dataset X = {x1, x2, ..., , xN } and a neuron a ∈ {1, ..., L} of model i (denoted as zi,a), we define zi,a to be the vector of mean inferred posteriors qi(zi|xi) across the full dataset: zi,a = (zi,a(x1),...,zi,a(xN )) ∈ R N . Note that this is different from the often considered notion of a "latent representation vector". Here zi,a is a response of a single latent dimension over the entire dataset, not an entire latent response for a single input. We then calculate the similarity between each two of such vectors zi,a and z j,b using either Lasso regression or Spearman's correlation.

Lasso regression (UDR L ):

We trained L lasso regressors to predict each of the latent responses zi,a from zj using the dataset of latent encodings Zi,a = {(zj,1,zi,a,1),...,(zj,N ,zi,a,N )}. Each row in Rij(a) is then filled in using the weights of the trained Lasso regressor for zi,a. The lasso regressors were trained using the default Scikit-learn multi-task lasso objective minw

1 2n samples ||XW -Y || 2

F ro +λ||W ||21 where F ro is the Frobenius norm: ||A||F ro = ij a 2 ij and the l1l2 loss is computed as ||A||21 = i j a 2 ij . λ is chosen using cross validation and the lasso is trained until convergence until either 1000 iterations have been run or our updates are below a tolerance of 0.0001. Lasso regressors were trained on a dataset of 10000 latents from each model and training was performed using coordinate descent over the entire dataset. Rnm is then computed by extracting the weights in the trained lasso regressor and computing their absolute value (Eastwood & Williams, 2018) . It is important that the representations are normalised per-latent such that the relative importances computed per latent are scaled to reflect their contribution to the output. Normalising our latents also ensures that the weights that are computed roughly lie in the interval [-1,1].

Spearman's based similarity matrix (UDR S ) We calculate each entry in the similarity matrix according to Rij(a,b) = Corr(zi,a,z j,b ), where Corr stands for Spearman's correlation. We use Spearman's correlation to measure the similarity between zi,a and z j,b , because we do not want to necessarily assume a linear relationship between the two latent encodings, since the geometry of the representational space is not crucial for measuring whether a representation is disentangled (see Sec. 2), but we do hope to find a monotonic dependence between them. Spearman correlation coefficients were computed by extracting 1000 samples from each model and computing the Spearman correlation over all the samples on a per-latent basis.

All-to-all calculations:

To make all-to-all comparisons, we picked 10 random seeds per hyperparameter setting and limited all the calculations to those models. Hence we made the maximum of (60 choose 2) pairwise model comparisons when calculating UDR-A2A.

Informative latent thresholding Uninformative latents typically have KL 0.01 while informative latents have KL 0.01, so KL= 0.01 threshold in Eq. 3 is somewhat arbitrarily chosen to pick out the informative latents z.

Sample reduction experiments:

We randomly sampled without replacement 20 different sets of P models for pairwise comparison from the original set of 50 models with the same hyperparameter setting for UDR or 60 models with different seeds and hyperparameters for UDR-A2A.

A.6 SUPERVISED METRIC IMPLEMENTATION DETAILS:

Original β-VAE metric. First proposed in Higgins et al. (2017a) , this metric suggests sampling two batches of observations x where in both batches the same single data generative factor is fixed to a particular value, while the other factors are sampled randomly from the underlying distribution. These two batches are encoded into the corresponding latent representations q φ (z|x) and the pairwise differences between the corresponding mean latent values from the two batches are taken. Disentanglement is measured as the ability of a linear classifier to predict the index of the data generative factor that was fixed when generating x.

We compute the β-VAE score by first randomly picking a single factor of variation and fixing the value of that factor to a randomly sampled value. We then generate two batches of 64 where all the other factors are sampled randomly and take the mean of the differences between the latent mean responses in the two batches to generate a training point. This process is repeated 10000 times to generate a training set by using the fixed factor of variation as the label. We then train a logistic regression on the data using Scikit-learn and report the evaluation accuracy on a test set of 5000 as the disentanglement score.

FactorVAE metric. Kim & Mnih (2018) proposed a modification on the β-VAE metric which made the classifier non-parametric (majority vote based on the index of the latent dimension with the least variance after the pairwise difference step). This made the FactorVAE metric more robust, since the classifier did not need to be optimised. Furthermore, the FactorVAE metric is more accurate than the β-VAE one, since the β-VAE metric often over-estimates the level of disentanglement by reporting 100% disentanglement even when only K -1 factors were disentangled.

The Factor VAE score is computed similarly to the β-VAE metric but with a few modifications. First we draw a set of 10000 random samples from the dataset and we estimate the variance of the mean latent responses in the model. Latents with a variance of less than 0.05 are discarded. Then batches of 64 samples are generated by a random set of generative factors with a single fixed generative factor. The variances of all the latent responses over the 64 samples are computed and divided by the latent variance computed in the first step. The variances are averaged to generate a single training point using the fixed factor of variation as the label. 10000 such training points are generated as the training set. A majority vote classifier is trained to pick out the fixed generative factor and the evaluation accuracy is computed on test set of 5000 and reported as the disentanglement score. 

Mutual Information Gap (MIG).:

The MIG metric proposed in Chen et al. ( 2018) proposes estimating the mutual information (MI) between each data generative factor and each latent dimension. For each factor, they consider two latent dimensions with the highest MI scores. It is assumed that in a disentangled representation only one latent dimension will have high MI with a single data generative factor, and hence the difference between these two MI scores will be large. Hence, the MIG score is calculated as the average normalised difference between such pairs of MI scores per each data generative factor. Chen et al. ( 2018) suggest that the MIG score is more general and unbiased than the β-VAE and FactorVAE metrics.

We compute the Mutual Information Gap by taking the discretising the mean representation of 10000 samples into 20 bins. The disentanglement score is then derived by computing, per generative factor, the difference between the top two latents with the greatest mutual information with the generative factor and taking the mean.

dSprites Shapes 3D

Score In this section we attempt to qualitatively verify our assumption that "for a particular dataset and a VAE-based unsupervised disentangled representation learning model class, disentangled representations are all alike, while every entangled representation is entangled in its own way, to rephrase Tolstoy". The theoretical justification of the proposed UDR hinges on the work by Rolinek et al. (2019) . However, that work only empirically evaluated their analysis on the β-VAE model class. Even though we have reasons to believe that their theoretical results would also hold for the other disentangling VAEs evaluated in this paper, in this section we empirically evaluate whether this is true.

β-VAE U D R L U D R S U D R L -A 2 A U D R S -A 2 A DIP-VAE U D R L U D R S U D R L -A 2 A U D R S -A 2 A TC-VAE U D R L U D R S U D R L -A 2 A U D R S -A 2 A Score β-VAE U D R L U D R S U D R L -A 2 A U D R S -A 2 A DIP-VAE U D R L U D R S U D R L -A 2 A U D R S -A 2 A TC-VAE U D R L U D R S U D R L -A 2 A U D R S -A 2 A

First, we check if all model classes operate in the so called "polarised regime", which was highlighted by Rolinek et al. (2019) as being important for pushing VAEs towards disentanglement. It is known that even vanilla VAEs (Kingma & Welling, 2014; Rezende et al., 2014) enter the "polarised regime", which is often cited as one of their shortcomings (e.g. see Rezende & Viola (2018) ). All of the disentangling VAEs considered in this paper augment the original ELBO objective with extra terms. None of these extra terms penalise entering the "polarised regime", apart from that of DIP-VAE-I. We tested empirically whether different model classes entered the "polarised regime" during our hyperparameter sweeps. We did this by counting the number of latents that were "switched off" in each of the 5400 models considered in our paper by using Eq. 3. We found that all models apart from DIP-VAE-I entered the polarised regime during the hyperparameter sweep, having on average 2.95/10 latents "switched off" (with a standard deviation of 1.97).

Second, we check if the models scored highly by the UDR do indeed have similar representations, and models that are scored low have dissimilar representations. We do this qualitatively by plotting latent traversals for three randomly chosen models within each of the six disentangling VAE model classes considered in this paper. We groups these plots by UDR scores into three bands: high (UDR>0.4), medium (0.3<UDR<0.4) and low (UDR<0.3). Fig. 15 shows latent traversals for all model classes that were able to achieve the high range of UDR scores (note that some model classes were not able to achieve high UDR values with the hyperparameter settings evaluated in this paper). We present the latent traversals for all ten latents per model without sorting them in any particular way. We also colour code the latents by their semantic meaning (if the meaning is apparent from the latent traversal). Fig. 15 shows that the representations learnt by the highly ranked models all appear to be very similar (up to subsetting, sign inverse and permutation). Note that the models also include many latents that are "switched off". Fig. 16 shows latent traversals for two model classes that did not achieve high UDR scores. We see that these models now have fewer semantically meaningful latent dimensions, and fewer latents that are uninformative or "switched off". Finally, Fig. 17 shows latent traversals for all model classes that had models which scored low on UDR. We see that many of these models do not have any uninformative latents, and their representations are hard to interpret. Furthermore, it is hard to find similarity between the representations learnt by the different models. Together, Figs. 15-17 empirically verify that our assumption holds for the model classes considered in this paper. However, we recommend that any practitioner using UDR on new disentangling model classes developed in the future first verify that the assumptions of the UDR hold for those models. We suggest training the new models on a number of toy but well studied datasets (like dSprites or Shapes3D) and checking if the ranks produced by UDR correlate with those produced by the supervised metrics. Furthermore, we suggest a qualitative evaluation of the traversals plots for the high and low scoring models. Figure 13 : Latent traversals for the four most informative latents ordered by their KL from the prior for three different β-VAE models that ranked high or low according to UDR. Those models that were ranked high have learnt representations that are both interpretable and very similar across models. Those models that were ranked low have learnt representations that are harder to interpret and they do not appear similar to each other across models.

Input Reconstruction Input Reconstruction:



:

Similar properties have also been referred to as disentanglement, completeness and informativeness respectively in the independent yet concurrent paper byEastwood & Williams (2018).

Figures and Tables:

) where r a = max a R(a, b) and r b = max b R(a, b). I KL indicates an "informative" latent within a model and d is the number of such latents: d a = a I KL (a) and d b = b I KL (b).

Figure 2: Hyperparameter search results for six unsupervised disentangling model classes evaluated using the unsupervised UDR and the supervised β-VAE, FactorVAE, MIG and DCI Disentangling metrics and trained on either dSprites (top) or 3D Shapes (bottom) datasets. "Hyper" corresponds to the particular hyperparameter setting considered (see Tbl. 5 in Supplementary Materials for particular values). The box and whisker plots for each hyperparameter setting are summarising the scores for 50 different model seeds. Higher median values indivate better hyperparameters. The ranking of hyperparameters tends to be similar between the different metrics, including UDR.

Figure 3: Latent traversals of the top ranked trained DIP-VAE-I, TC-VAE, CCI-VAE and β-VAE according to the UDR method. At the top of each plot the two presented scores are UDR/FactorVAE metric. Note that the FactorVAE metric scores visually entangled models very highly. d is the number of informative latents. The uninformative latents are greyed out.

Figure 4: Schematic illustration of the UDR method. See details in text. DIP-VAE The DIP-VAE model also adds regularisation to the aggregated posterior but instead an additional loss term is added to encourage it to match the factorised prior. Since the KL divergence is intractable, other measures of divergence are used instead. Cov p(x) [µ φ (x)] can be used, yielding the DIP-VAE-I objective

Figure 5: A: Schematic illustration of the pairwise model comparison. Two trained models i and j are sampled for pairwise comparison. Both models learnt a perfectly disentangled representation, learning to represent two (positions x/y) and three (positions x/y, and size) generative factors respectively. Similarity matrix R ij : white -high similarity between latent dimensions, black -low. B: Similarity matrix R ij for the same pair of models, calculated using either Spearman correlation or Lasso regression. The latter is often cleaner. C: Examples of Lasso similarity matrices of an entangled vs a disentangled model.

Figure7: The range of scores for each hyperparameter setting for the dSprites and 3D Shapes datasets for various models and metrics. We see that the different versions of the UDR method broadly agree with each other.

Figure 8: Rank correlations of the different versions of the UDR score with the β-VAE metric on the dSprites dataset for a β-VAE hyperparameter search as the number of pairwise comparisons per model were changed. Higher number of comparisons leads to more accurate and more stable rankings, however these are still decent even with 5 pairwise comparisons per model.

Figure 12: Distribution of UDR S scores (P=50) for 300 β-VAE models trained with 6 settings of the β hyperparameter and 50 seeds on CelebA and ImageNet datasets. The reconstructions shown are for the vanilla VAE (β = 1). ImageNet is a complex dataset that VAEs struggle to model well.

Rank correlations between MIG and different versions of UDR across two datasets and three model classes. The performance is comparable across datasets, UDR versions and model classes. See Fig.6in Supplementary Materials for comparisons with other supervised metrics.3. Herd effect -since UDR detects disentangled representations through pairwise comparisons, the score it assigns to each individual model will depend on the nature of the other models involved in these comparisons. This means that UDR is unable to detect a single disentangled model within a hyperparameter sweep. It also means that when models are only compared within a single hyperparameter setting, individual model scores may be over/under estimated as they tend to be drawn towards the mean of the scores of the other models within a hyperparameter group. Thus, it is preferable to perform the UDR-A2A during model selection and UDR during hyperparameter selection.

Table content: <table><tr><td>MODEL CLASS</td><td/><td colspan="2">DSPRITES</td><td/><td/><td colspan="2">3DSHAPES</td><td/></tr><tr><td/><td/><td>LASSO</td><td colspan="2">SPEARMAN</td><td/><td>LASSO</td><td colspan="2">SPEARMAN</td></tr><tr><td/><td colspan="8">HYPER ALL-2-ALL HYPER ALL-2-ALL HYPER ALL-2-ALL HYPER ALL-2-ALL</td></tr><tr><td>β-VAE</td><td>0.60</td><td>0.76</td><td>0.54</td><td>0.72</td><td>0.71</td><td>0.68</td><td>0.70</td><td>0.71</td></tr><tr><td>TC-VAE</td><td>0.40</td><td>0.67</td><td>0.37</td><td>0.60</td><td>0.81</td><td>0.79</td><td>0.81</td><td>0.75</td></tr><tr><td>DIP-VAE</td><td>0.61</td><td>0.69</td><td>0.65</td><td>0.72</td><td>0.75</td><td>0.74</td><td>0.75</td><td>0.78</td></tr></table>

to evaluate β-VAE, CCI-VAE, FactorVAE, TC-VAE, DIP-VAE-I and DIP-VAE-II on two benchmark datasets: dSprites(Matthey et al., 2017) and 3D Shapes(Burgess & Kim, 2018) (see Sec. A.3 for details). Each model is trained with H = 6 different hyperparameter settings (detailed in Sec. A.4.1 in Supplementary Material), with S = 50 seeds per setting, and P = 50 pairwise comparisons.

Table content: <table/>

Rank correlations of the UDR score with the β-VAE metric on the dSprites dataset for a β-VAE hyperparameter search as the number of pairwise comparisons P per model were changed.

Table content: <table><tr><td>SAMPLE # (P )</td><td>5</td><td>10</td><td>15</td><td>20</td><td>25</td><td>30</td><td>35</td><td>40</td><td>45</td></tr><tr><td colspan="10">CORRELATION 0.51±0.07 0.57±0.03 0.57±0.05 0.6±0.03 0.59±0.03 0.61±0.02 0.61±0.02 0.61±0.01 0.61±0.01</td></tr></table>

Disentangled model selection metrics comparison. M -modularity, C -compactness, Eexplicitness(Ridgeway & Mozer, 2018)

Table content: <table/>

Peer review (iclr2020):
This paper proposes a criterion called Unsupervised Disentanglement Ranking (UDR) score. The score is computed based on the assumption that good disentangled representations are alike, while the representations can be entangled in multiple possible ways. The UDR score can be used for unsupervised hyperparameter tuning and model selection for variational disentangled method. The problem this paper focuses on is essential because we usually apply unsupervised disentangled methods to analyze the data when the labels are unavailable. However, existing metrics for hyperparameter tuning and model selection requires ground-truth labels. This paper allows measuring model performance without supervision, making the hyperparameter tuning and model selection possible in practice. It looks like some parts of this paper need rewriting. In the abstract, it is not mentioned at all what is the proposed approach. Most paragraphs in the introduction section review the related work and background but do not introduce what assumption and strategy the proposed method adopted. It looks like the proposed UDR is theoretically supported by Rolinek et al. (2019). However, the proof given by Rolinek et al. (2019) is for -VAE, where the regularization can be turned into the constraint on KL divergence. I do not think the *polarised regime* holds for other disentangled model, for example, TCVAE, where a biased estimation of total correlation is introduced in the objective function. Therefore, I am not convinced that I should trust the results of the UDR, which combines multiple disentangled models. The computational process of UDR is heuristic and somewhat arbitrary. There is no theoretical guarantee that UDR should be a useful disentanglement metric. Although the UDR is supported by some experiments, I am not convinced that it is trustworthy for more complex real-world datasets. Equation (3) looks problematic. Note that it is possible to train a Bidirectional Generative Adversarial Network (BiGAN) that can generate complex images based on a uniform distribution (Donahue et al., 2016). The encoder of the BiGAN can be considered as the inverse of the generator, which maps images back to the uniform distribution. This suggests that under the encoder-decoder framework, it is possible that latent variables can be informative even the posterior distribution matches the prior distribution. Although VAEs are trained using a different strategy, I do not see why the posterior needs to diverge from the prior distribution for informative latent representations. The encoder might simply be the inverse of the decoder under a certain scenario. In summary, this paper focuses on solving an important problem. However, the proposed method is not well supported by theorems as it seems. The paper also appears to contain minor technical issues. Therefore, I am inclined to reject this paper. References Donahue, Jeff, Philipp Krähenbühl, and Trevor Darrell. *Adversarial feature learning.* arXiv preprint arXiv:1605.09782 (2016).