C OUNTERFACTUALS UNCOVER THE MODULAR STRUCTURE OF DEEP GENERATIVE MODELS
Anonymous authors
Paper under double-blind review
A BSTRACT
Deep generative models can emulate the perceptual properties of complex image datasets, providing a latent representation of the data.
However, manipulating such representation to perform meaningful and controllable transformations in the data space remains challenging without some form of supervision.
While previous work has focused on exploiting statistical independence to disentangle latent factors, we argue that such requirement can be advantageously relaxed and propose instead a non-statistical framework that relies on identifying a modular organization of the network, based on counterfactual manipulations.
Our experiments support that modularity between groups of channels is achieved to a certain degree on a variety of generative models.
This allowed the design of targeted interventions on complex image datasets, opening the way to applications such as computationally efﬁcient style transfer and the automated assessment of robustness to contextual changes in pattern recognition systems.
I NTRODUCTION
Deep generative models, by learning a non-linear function mapping a latent space to the space observations, have proven successful at designing realistic images in a variety of complex domains (objects, animals, human faces, interior scenes).
In particular, two kinds of approaches emerged as state-of-the-art (SOTA): Generative Adversarial Networks (GAN) (Goodfellow et al., 2014), and
Variational Autoencoders (VAE) (Kingma & Welling, 2013; Rezende et al., 2014).
Efforts have been made to have such models produce disentangled latent representations that can control interpretable properties of images (Kulkarni et al., 2015; Higgins et al., 2017).
However, the resulting models are not necessarily mechanistic (or causal ) in the sense that interpretable properties of an image cannot be ascribed to a particular part, a module , of the network architecture.
Gaining access to a modular organization of generative models would beneﬁt the interpretability and allow extrapolations , such as generating an object in a background that was not previously associated with this object, as illustrated in a preview of our experimental results in Fig.
Such extrapolations are an integral part of human representational capabilities (consider common expressions such as ”like an elephant in a china shop”) and consistent with the modular organization of its visual system, comprising specialized regions encoding objects, faces and places (see e.g. GrillSpector & Malach (2004)).
Extrapolations moreover likely support adaptability to environmental changes and robust decision making (Dvornik et al., 2018).
How to leverage trained deep generative architectures to perform such extrapolations is an open problem, largely due to the non-linearities and high dimensionality that prevent interpretability of computations performed in successive layers.
In this paper, we propose a causal framework to explore modularity, which relates to the causal principle of Independent Mechanisms , stating that the causal mechanisms contributing to the overall generating process do not inﬂuence nor inform each other (Peters et al., 2017).
1 We study the effect of direct interventions in the network from the point of view that the mechanisms involved in generating data can be modiﬁed individually without affecting each other.
This principle can be applied to generative models to assess how well they capture a causal mechanism (Besserve et al., 2018).
Causality allows to assay how an outcome would have changed, had some variables taken different values, referred to as a c ounterfactual (Pearl, 2009; Imbens & Rubin, 2015).
We use counterfactuals to assess the role of speciﬁc internal variables in the overall functioning of trained deep generative models, along with a rigorous deﬁnition of disentanglement in a causal framework.
Then, we analyze this disentanglement in implemented models based on unsupervised counterfactual manipulations.
We show empirically how VAEs and GANs trained on image databases exhibit modularity of their hidden units, encoding different features and allowing counterfactual editing of generated images.
Related work.
Our work relates to the interpretability of convolutional neural networks, which has been intensively investigated in discriminative architectures (Zeiler & Fergus, 2014;
Dosovitskiy &
Brox, 2016; Fong & Vedaldi, 2017; Zhang et al., 2017b;a).
Generative models require a different approach, as the downstream effect of changes in intermediate representations are high dimensional.
InfoGANs.
β -VAEs and other works (Chen et al., 2016; Mathieu et al., 2016; Kulkarni et al., 2015;
Higgins et al., 2017) address supervised or unsupervised disentanglement of latent variables related to what we formalize as extrinsic disentanglement of transformations acting on data points.
We introduce the novel concept of intrinsic disentanglement to uncover the internal organization of networks, arguing that many interesting transformations are statistically dependent and are thus unlikely to be disentangled in the latent space.
This relates to Bau et al.
(2018) who proposed a framework based on interventions on internal variables of a GAN which, in contrast to our fully unsupervised approach, requires semantic information.
Higgins et al.
(2018) suggest a deﬁnition of disentanglement based on group representation theory.
Compared to this proposal, our approach (introduced independently in (Anonymous, 2018)) is more ﬂexible as it applies to arbitrary continuous transformations, free from the strong requirements of representation theory (see Appendix F).
Finally, an interventional approach to disentanglement has also be taken by Suter et al.
(2018), who focuses on extrinsic disentanglement in a classical graphical model setting and develop measures of interventional robustness based on labeled data.
F ROM DISENTANGLEMENT TO COUNTERFACTUALS AND BACK
We introduce a general framework to formulate precisely the notion of disentanglement and bridge it to causal concepts.
This theory section will be presented informally to ease high level understanding.
Readers interested in the mathematical aspects can refer to Appendix A where we provide all details.
2. A C AUSAL G ENERATIVE M ODEL (CGM) FRAMEWORK
We consider a generative model M that implements a function g M , which maps a latent space Z to a manifold Y M where the learned data points live, embedded in ambient Euclidean space Y (Fig. 2a).
A sample from the model is generated by drawing a realization z from a prior latent variable distribution with mutually independent components, fully supported in Z .
We will use the term representation to designate a mapping r from Y M to some representation space R (we also call r ( y ) the representation of a point y ∈ Y M ).
In particular, we will assume (see Def. 6 and Prop. 6, in Appendix A) that g M is (left)-invertible, such that g − 1 M is a representation of the data, called the latent representation .
Assuming the generative model is implemented by a non-recurrent neural network, we can use a causal graphical model representation of the entailed computational graph implementing the mapping g M through a succession of operations (called functional assignments in causal language), as illustrated in Fig.
2b, that we will call Causal Generative Model (CGM).
In addition to the latent representation, we can then choose a collection of possibly multi-dimensional endogenous (internal) variables represented by nodes in the causal graph, such that the mapping g M is computed by composing the endogenous variable assignment v M with the endogenous mapping ˜ g M according to the diagram
[Equation]
zzz
T’
Y
T y
Z
Latent representation
Data ambient space
Support of data distribution g M g M-
(a) zz
V V
Y layer (cid:96)
Statistical independence
Independence of mechanisms
E ndog e nou s v a r i ab l e s
L a t e n t
i npu t
O u t pu t (b) y z K
z k ... zz (cid:48)
K ...
z (cid:48)
k z (cid:48)f y (cid:48)
id id id id
T g − 1 M g M
T (cid:48)
(c) zz
V
T ( Y )
V 2 T 2 ( V 2 ) (d)
A paradigmatic choice for these variables is the collection of output activation maps of each channel in one hidden layer of a convolutional neural network, as illustrated in Fig. 2b.
As for the latent case, we use mild conditions that guarantee ˜
g M to be left-invertible, deﬁning the internal representation of the network (see Def. 6 and Prop. 4 in Appendix A).
Given the typical choice of dimensions for latent and endogenous variables, the V k ’s are also constrained to take values in subsets V kM of smaller dimension than their Euclidean ambient space V k .
As detailed in Appendix A, we will denote the endogenous image sets of the form V E M = (cid:8) v ∈ (cid:81) k ∈E
[Equation]
k
[Equation]
z )
[Equation]
∈E , z ∈ Z (cid:9) for a subset of variables indexed by E (amounting to V M when E includes all endogenous variables).
This CGM framework allows deﬁning counterfactuals in the network following Pearl (2014).
Deﬁnition 1 (Unit level counterfactual, informal) .
Given CGM M , the interventional model M h is obtained by replacing assignments of the subset variables E and by the vector of assignments h .
Then for any latent input z , called unit , the unit-level counterfactual is the output of M h : g M h ( z ) .
Def. 1 is also in line with the concept of potential outcome (Imbens & Rubin, 2015).
Importantly, counterfactuals induce a transformation of the output of the generative model.
Deﬁnition 2 (Counterfactual mapping) .
Given an embedded CGM, we call the transformation
[Equation]
the h -counterfactual mapping.
We say it is faithful to M whenever (cid:121)
Y E h
[ Y M ] ⊂ Y M .
We introduce faithfulness of a counterfactual mapping to account for the fact that not all interventions on internal variables will result in an output that could have been generated by the original model.
In the context of generative model, non-faithful counterfactuals generate examples that leave the support of the distribution learned from data, possibly resulting in an artifactual output (assigning a large value to a neuron may saturate downstream neurons), or allowing extrapolation to unseen data.
2. U NSUPERVISED DISENTANGLEMENT : FROM STATISTICAL TO CAUSAL PRINCIPLES
The classical notion of disentangled representation (e.g. Bengio et al.
; Kulkarni et al.
, posits individual latent variables “ sparsely encode real-world transformations ”.
Although the concept of real-world transformations remains elusive, this insight, agnostic to statistical concepts, has driven supervised approaches to disentangling representations, where relevant transformations are well-identiﬁed and manipulated explicitly using appropriate datasets and training procedures.
In contrast, unsupervised learning approaches to disentanglement need to learn such real-world transformations from unlabeled data.
In order to address this challenge, SOTA approaches seek to encode such transformations by changes in individual latent factors, and resort to a statistical notion of disentanglement, enforcing conditional independence between latent factors (Higgins et al., 2017).
This statistical approach leads to several issues
: • The i.i.d.
constraints on the prior distribution of latent variables, impose statistical independence between disentangled factors on the data distribution.
This is unlikely for many relevant properties, counfounded by factors of the true data generating mechanisms (e.g. skin and hair color).
• Independence constraints are not sufﬁcient to specify a disentangled representation, such that the problem remains ill-posed (Locatello et al., 2018).
As a consequence, ﬁnding an appropriate inductive bias to learn a representation that beneﬁts downstream tasks remains an open question.
• To date, SOTA unsupervised approaches are mostly demonstrated on synthetic datasets, and beyond MNIST disentangling complex real world data has been limited to the well-calibrated CelebA dataset.
On complex real-world datasets, disentangled generative models exhibit visual sample quality far below non-disentangled SOTA (e
g. BigGAN exploited in our work (Brock et al., 2018)).
We propose an non-statistical deﬁnition of disentanglement by ﬁrst phrasing mathematically the transformation-based insights (Bengio et al., 2013; Kulkarni et al., 2015).
Consider a transformation
T acting on the data manifold Y M .
As illustrated by the commutative diagram of Fig.
2c, disentanglement of such property then amounts to having T correspond to a transformation T (cid:48) of the latent space that would act only on a single variable z k , using transformation f , leaving the other latent variables available to encode other properties.
More explicitly we have
[Equation]
( z 1 , .., f ( z k ) , .., z K ) , and T ( g M ( z )) =
g M ( T (cid:48)
( z )) .
It is then natural to qualify two transformations T 1 and T 2 as disentangled (from each other), whenever they modify different components of the latent representation (see Def. 9.
This amounts to saying that the transformations follow the causal principle of independent mechanisms (Peters et al., 2017;
Parascandolo et al., 2018).
Due to the fact that it relies on transformation of the latent representation, that are exogenous to the
CGM, we call this notion extrinsic disentanglement .
This “functional” deﬁnition has the beneﬁt of being agnostic the the subjective choice of the property to disentangle, and to the statistical notion of independence.
However, we can readily notice that, if applied to the latent space (where components are i.i.d.
distributed), this functional notion of disentangled transformation still entails statistical independence between disentangled factors.
We thus need to exploit a different representation to uncover possibly statistically related properties, but disentangled in the sense of our deﬁnition.
2. D ISENTANGLING BY MANIPULATING INTERNAL REPRESENTATIONS
As illustrated in the CGM of Fig.
2b, in contrast to latent variables, properties encoded by endogenous variables of the graphical model are not necessarily statistically independent due to common latent cause, but may still reﬂect interesting properties of the data that can be intervened on independently, following the principle of independence of mechanisms.
We thus extend our deﬁnition of disentanglement to allow transformations of the internal variables of the network as follows.
Deﬁnition 3 (Intrinsic disentanglement, informal) .
In a CGM M , a transformation T : Y M → Y M is intrinsically disentangled with respect to a subset E of endogenous variables, if there is transformation
T (cid:48) acting on the internal representation space such that for any endogenous value v
[Equation]
where T (cid:48) ( v ) only affects the variables indexed by E .
Fig.
2d illustrates this second notion of disentanglement, where the split node indicates that the value of V 2 is computed as in the original CGM (Fig. 2b) before applying transformation T 2 to the outcome.
While the above deﬁnition applies to a single transformation, straightforward extensions of this concept to families of transformations are provided in Appendix F. Faithful counterfactuals represent examples of disentangled transformations:
Proposition 1 (Counterfactuals and disentanglement, informal) .
Consider an intervention on subset
E , its associated counterfactual mapping is faithful if and only if it is disentangled.
For interventions
Latentsample z
E
Original
Latentsample z
Original
E (cid:101) v ( z
[Figure]
) v ( z 2 )
Hybridsample
[Figure]
on variables that remain within the support of the original marginal distribution, it is sufﬁcient that E and its complement E do not have common latent ancestors.
This indicates that ﬁnding faithful counterfactuals can be used to learn disentangled transformations.
F INDING MODULARITY IN DEEP GENERATIVE MODELS 3. D EFINING MODULARITY
Building on Sec. 2, we deﬁne modularity as a structural property of the internal representation, allowing (with the immediately following Prop. 2) to implement arbitrary disentangled transformations.
Deﬁnition 4 (Modularity) .
A subset of endogenous variables E is called modular whenever V M is the Cartesian product of V E M by V E M .
Proposition 2 (Modularity implies disentanglement) .
If E is modular, then any transformation applied to it staying within its input domain is disentangled.
The proof is a natural extension of Proposition 1.
Both the deﬁnition and the proposition have obvious extensions to multiple modules (based on Appendix F).
While we have founded this framework on a functional deﬁnition of disentanglement that applies to transformations, the link made here with an intrinsic property of the network allows us to deﬁne a disentangled representation as follows: consider of partition of the intermediate representation in several modules, such that their Cartesian product is a factorization of V M .
We can call this partition a disentangled representation because any transformation applied to a given module leads to a valid transformation in the data space (such transformations are relatively disentangled following Def. 9).
Interestingly, we obtain that a disentangled representation requires the additional introduction of a partition of the considered set of latent variables into modules.
This extra requirement was not considered in classical approaches to disentanglement as it was assumed that each single scalar variables could be considered as an independent module.
Our framework provides an insight relevant to artiﬁcial and biological systems: as the activity of multiple neurons can be strongly tied together, the concept of representation may not be meaningful at the ”atomic” level of single neurons, but require to group them into modules forming a ”mesoscopic” level, at which each group can be intervened on independently.
3. H YBRIDIZATION AS A DISENTANGLED TRANSFORMATION
As stated in Sec. 2, a functional deﬁnition of disentanglement, leaves unanswered how to ﬁnd relevant transformations.
Prop. 1 and 2 provide the following hints: (1) Once a modular structure is found in the network, a broad class of disentangled transformations are available,
(2) Transformations that stay within their input domain are good candidates of disentanglement, (3) Counterfactual interventions implicitly deﬁnes transformation.
We follow these guidelines by assigning a constant value v 0 to a subset of endogenous variables E to deﬁne counterfactuals (i.e. h is a constant function), aiming for faithful ones by constraining v 0 to belong to V E M .
To avoid characterizing V E M , we rely on sampling from the (joint) marginal distribution of the variables in E .
To illustrate the procedure, we consider a standard feed-forward multilayer neural network and choose endogenous variables to be the collection of all output activations of channels of a given layer (cid:96) .
Let
E be a subset of these channels, the hybridization procedure, illustrated in Fig.
3a goes as follows.
We take two independent examples of the latent variable z 1 and z 2 , that will generate two original examples of the output ( y 1 , y 2 ) =
( g M ( z 1 ) , g M ( z 2 ))
(that we call Original 1 and Original 2 ).
We also memorize the tuple v ( z 2 ) gathering values of variables indexed by E when generating Original 2, and (cid:101) v ( z 1 ) the tuple of values taken by all other endogenous variables on this layer, but when generating Original 1.
Assuming the choice of E identiﬁes a modular structure, (cid:101) v ( z 1 ) and v ( z 2 ) would encode different aspects of their corresponding generated images, such that one can generate a hybrid example mixing these features by assigning the collection of output values of layer (cid:96) with the concatenated tuple ( (cid:101) v ( z 1 ) , v ( z 2 )) and feeding it to the downstream part of the generator network.
3. M EASURING CAUSAL EFFECTS
The above counterfactual hybridization framework allows assessing how a given module E affects the output of the generator.
For this purpose we quantify its causal effect by repetitively generating pairs ( z 1 , z 2 ) from the latent space, where both vectors are sampled independently of each other.
We then generate and collect hybrid outputs following the above described procedure for a batch of samples and use them to estimate an inﬂuence map as the mean absolute effect:
[Equation]
where Y ( z 1 )
=
g M ( z 1 ) is the non-intervened output of the generator for latent input z 1 .
In eq. 2, the difference inside the absolute value can be interpreted as a unit-level causal effect in the potential outcome framework (Imbens & Rubin, 2015), and taking the expectation is analogous to computing the average treatment effect .
Our approach has however two speciﬁcities: (1) we take the absolute value of the unit-level causal effects, as their sign may not be consistent across units, (2) the result is averaged over many interventions corresponding to different values of z 2 .
While IM has the same dimension as the output image, we then average it across color channels to get a single grayscale heat-map pixel map.
We also deﬁne a scalar quantity to quantify the magnitude of the causal effect, the individual inﬂuence of module E , by averaging IM across output pixels.
3. U NSUPERVISED DETECTION OF MODULES AND COUNTERFACTUAL IMAGES
A challenge with the hybridization approach is to select the subsets E to intervene on, especially with networks containing a large amount of units or channels per layer.
We use a ﬁne to coarse approach to extract such groups, that we will describe in the context of convolutional layers.
First, we estimate elementary inﬂuence maps (EIM) associated to each individual output channel c of each convolutional layer of the network (i.e. we set E = { c } in eq.
Then inﬂuence maps are grouped by similarity to deﬁne modules at a coarser scale, as we will describe in detail below.
Representative EIMs for channels of convolutional layers of a VAE trained on the CelebA face dataset (see result section) are shown in Supplementary Fig.
6 and suggest channels are functionally segregated, with for example some inﬂuencing ﬁner face feature (eyes, mouth,...)
and others affecting the background of the image or the hair.
This supports the idea that individual channels can be grouped into modules that are mostly dedicated to one particular aspect of the output.
In order to achieve this grouping in an unsupervised way, we perform clustering of channels using their EIMs as feature vectors as follows.
We ﬁrst pre-process each inﬂuence map by: (1) performing a local averaging with a small rectangular sliding window to smooth the maps spatially, (2) thresholding the resulting maps at the 75% percentile of the distribution of values over the image to get a binary image.
After ﬂattening image dimensions, we get a (channel × pixels) matrix S which is then fed to a Non-negative Matrix Factorization (NMF) algorithm with manually selected rank K , leading to the factorization S = WH .
From the two resulting factor matrices, we get the K cluster template patterns (by reshaping each rows of H to image dimensions), and the weights representing the contribution of each of these pattern to individual maps (encoded in W ).
Each inﬂuence map is then ascribed a cluster based on which template pattern contributes to it with maximum weight.
The choice of NMF is justiﬁed by its success in isolating meaningful parts of images in different components (Lee & Seung, 1999).
However, we will also compare our approach to the classical k-means clustering algorithm.
In order to further justify our NMF based approach, we also introduce a toy generative model.
Model 1.
Consider Z a vector of K i.i.d.
uniformly distributed RVs.
Assume a neural network with one hidden layers composed of m vector variables
V k such that
[Equation]
with H k ∈ R n , n > 1 and S a strictly increasing activation function applied entry-wise to the components of each vector (e.g. a leaky ReLU).
These endogenous variables are mapped to the output following Y =
(cid:80)
Kk =1 W k V k with matrices W k ∈
R m × n , m > nK .
Assume additionally the following random choice for the model parameters: (1) all coefﬁcients of H k ’s are sampled i.i.d.
from an arbitrary distribution that has a density with respect to the Lebesgue measure, (2) there exists K sets of indices
I k over [1 , m ] each containing at least one element l k ∈ I k such that for all j (cid:54) =
k , l k / ∈ I
j , (3)
For a given column of W k , coefﬁcient in I k are sampled i.i.d.
from an arbitrary distribution that has a density with respect to the Lebesgue measure, while the remaining coefﬁcients are set to zero.
The speciﬁc condition on the
I k ’s enforced in (2) encodes the assumption that there is an area in the image that is only inﬂuenced by one of the modules.
For example, assuming a simple background/object module pair, it encodes that the borders of the image never belong to the object while the center of the image never belong to background.
We then get the following identiﬁability result.
Proposition 3.
For Model 1, with probability 1 we have:
(1) The partition of the hidden layer entailed by the K vectors { V k } corresponds to a disentangled representation (i.e. each vector is modular relatively to the others).
(2) Assume inﬂuence maps IM ( i, k ) of each component i in each vector V k are known and build the ( m × nK ) binary matrix B = IM ( i, k ) > 0 .
Non-negative matrix factorization of B is unique (up to trivial transformations) and identiﬁes the subsets of endogenous variables associated to each V k .
This result supports the application of NMF to a thresholded version of the inﬂuence map matrix computed for individual endogenous variables (to generate a binary matrix reﬂecting whether it inﬂuences or not a particular output pixel).
Moreover, the application of the sliding window is justiﬁed in order to enforce the similarity between the inﬂuence maps belonging to the same module, reﬂected by the condition on identical support I k for all columns of W k in Model 1, and facilitating matrix factorization.
E XPERIMENTS 4. DCGAN, β -VAE AND BEGAN ON THE C ELEB A DATASET
We ﬁrst investigated modularity of genrative models trained on the CelebFaces Attributes Dataset (CelebA)(Liu et al., 2015).We ﬁrst used a basic architecture: a plain β -VAE ( https://github.com/ yzwxx/vae-celebA (Higgins et al., 2017).
We ran the full procedure described in Sec. 3, comprised of EIM calculations, clustering of channels into modules, and hybridization of generator samples using these modules.
Hybridization procedures were performed by intervening on the output of the intermediate convolutional layer (indicated in Supplemental Fig. 7).
The results are summarized in Supplemental Fig.
We observed empirically that setting the number of clusters to 3 leads consistently to highly interpretable cluster templates as illustrated in the ﬁgure, with one cluster associated to the background, one to the face and one to the hair.
This observation was conﬁrmed by running the following cluster stability analysis: we partition at random the inﬂuence maps insubsets, and we use this partition to run the clustering twice on two thirds of the data, both runs overlapping only on one third.
The obtained clusters were then matched in order to maximize the label consistency (the proportion of inﬂuence maps assigned the same label by both runs) on the overlapping subset, and this maximum consistency was used to assess robustness of the clustering across the number of clusters.
The consistency results are provided in Supplemental Fig.
9 and show 3 clusters is a reasonable choice as consistency is large ( > 90% ) and drops considerably for 4 clusters.
Moreover, these results also show that the NMF-based clustering outperforms clustering with the more standard k-means algorithm.
In addition, we also assessed the robustness of the clustering by looking at the cosine distance between the templates associated to matching clusters, averaged across clusters.
The results, also provided in Supplemental Fig.
9, are consistent with the above analysis with an average cosine similarity of .9 (scalar product between the normalized feature vectors) achieved with 3 clusters (maximum similarity is 1 for perfectly identical templates).
Exemplary inﬂuence maps shown in Supplemental Fig.
8 (center panel) reﬂect also our general observation: some maps may spread over image locations reﬂecting different clusters.
Interestingly, applying the hybridization procedure to the resulting 3 modules obtained by clustering leads to a replacement of the features associated to the module we intervene on, as shown in Supplemental Fig.
8 (center panel), while respecting the overall structure of the image (no discontinuity introduced).
For example, on the middle row we see the facial features of the Original 2 samples are inserted in the Original 1 image (shown on the left), while preserving the hair.
While the β -VAE is designed for extrinsic disentanglement, further work has shown that it can prove suboptimal with respect to other approaches (Chen et al., 2018; Locatello et al., 2018) suggesting further work could investigate whether better extrinsic disentanglement could also favor intrinsic disentanglement.
It is however important to investigate intrinsic disentanglement in models for which (extrinsic) disentanglement is not enforced explicitly.
This is in particular the case of most GAN-like architectures, who typically outperform VAE-like approaches in terms of sample quality in complex image datasets.
Interestingly, the above results could also be reproduced in the ofﬁcial tensorlayer
DCGAN implementation, equipped with a similar architecture ( https://github.com/tensorlayer/dcgan ) (see Appendix E).
This suggests that our approach can be applied to models that have not been optimized for disentanglement.
After these experiments with basic models, we used a pretrained ( https: //github.com/Heumi/BEGAN-tensorflow )
Boundary Equilibrium GAN (BEGAN) (Berthelot et al., 2017), which used to set a milestone in visual quality for higher resolution face images.
The good quality and higher resolution of the generated images combined with the relatively simple generator architecture of BEGAN allows us to test our hypothesis with minimal modiﬁcations of the computational graph.
Most likely due to the increase in the number of layers, we observed that obtaining counterfactuals with noticeable effects required interventions on channels from the same cluster in two successive layers.
The results shown in Fig.
3b, obtained by intervening on layers 5 and 6, reveal a clear selective transfer of features from Original 2 to Original 1 .
As the model was trained on face images cropped with a tighter frame than for the above models, leaving little room for the hair and background, we observe only one module associated to these features (Fig.
3b, middle row) showing a clear hair transfer.
The remaining two modules are now encoding different aspects of face features: eye contour/mouth/nose for the top row and eyelids/face shape for the bottom row module.
We further evaluated the relative quality of the counterfactual images with respect to the original generated images using the Frechet Inception Distance (FID) (Heusel et al., 2017)
(Table 2 in the appendix), supporting that the hybridization procedure only mildly affects the image quality, in comparison to the original samples.
4. B IG GAN ON THE I MAGE N ET DATASET
In order to check whether our approach could scale to high resolution generative models, and generalize to complex image datasets containing a variety of objects, we used the BigGAN-deep architecture (Brock et al., 2018), pretrained ( https://tfhub.dev/deepmind/biggan-deep-256/1 ) on the ImageNet dataset ( http://www.image-net.org/ ).
This is a conditional GAN architecture comprising 12 so-called Gblocks, each containing a cascade of 4 convolutional layers (see Appendix C for details).
Each Gblock also receives direct input from the latent variables and the class label, and is bypassed by a skip connection.
We then checked that we were able to generate hybrids by mixing the features of different classes.
As for the case of BEGAN, intervening on two successive layers within a Gblock was more effective to generate counterfactuals (examples are provided for the 7th Gblock).
Examples provided in Fig.
4 (cock-ostrich) show that it is possible to generate high quality counterfactuals with modiﬁed background while keeping a very similar object in the foreground.
In a more challenging situation, with objects of different nature (Koala-teddy bear on the same ﬁgure), meaningful combinations of
See Fig.
13 for additional samples.
In order to investigate how the generated counterfactual images can be used to probe and improve the robustness of classiﬁers to contextual changes we compared the ability of several SOTA pretrained classiﬁer available on Tensorﬂow-hub ( https://tfhub.dev/ , see Appendix C for details) to recognize one of the original classes.
Fig.
5 shows the average recognition rate of the most recognized original class (teddy-bear or koala), as a function of layer depth tends overall to increase.
We ﬁrst observe that high recognition rates are in line with the small pixel distance between hybrids and original when intervening at layers closest to the output (right panel).
Interestingly, at intermediate blocks 5-6, there is a clear contrast between classiﬁers, with the Inception resnet performing better than the others.
Interestingly, examples of non-consensual classiﬁcation results in Supplementary Table 3, together with the associated hybrids (Supplementary Fig. 14) suggest different SOTA classiﬁers rely on different aspects of the image content to take their decision (e g. background versus object)
C ONCLUSION
We introduced a mathematical deﬁnition of disentanglement , related it to the causal notion of counterfactual and used it for the unsupervised characterization of the representation encoded by different groups of channels in deep generative architectures.
We found evidence for interpretable modules of internal variables in four different generative models trained on two complex real world datasets.
Our framework opens a way to a better understanding of complex generative architectures and applications such as the style transfer (Gatys et al., 2015) of controllable properties of generated images at low computational cost (no further optimization is required), and the automated assessment of robustness of object recognition systems to contextual changes.
From a broader perspective, this research direction contributes to a better exploitation of deep neural networks obtained by costly and highly energy-consuming training procedures, by (1) enhancing their interpretability and (2) allowing them to be used for tasks their where not trained for.
This offers a perspective on how more sustainable research in Artiﬁcial Intelligence could be fostered in the future.
Supplementary information A PPENDIX A: F ORMAL DEFINITIONS AND RESULTS FOR CAUSAL GENERATIVE MODELS (S ECTION 2)
We rely on the assumption that a trained generator architecture can be exploited as a mechanistic model, such that parts of this model can be manipulated independently.
A mathematical representation of such models can be given using structural causal models (SCMs , that rely on structural equations (SEs) of the form Y :
= f ( X 1 , X 2 , · · · , X N , (cid:15) ) , denoting the assignment of a value to variable Y , computed from the values of other variables X k in the system under consideration, and of putative exogenous inﬂuences (cid:15) , imposed by factors outside the system under study.
As in the above equation, we will use uppercase letters to indicate variables being the outcome of a structural assignment, while speciﬁc values taken by them will be lower case.
SEs stay valid even if right-hand side variables undergo a change due to interventions (Pearl, 2009; Peters et al., 2017, e.g.), and can model the operations performed in computational graphs of modern neural network implementations.
Such graphs then depict SCMs made of interdependent modules, for which assignments’ dependencies are represented by a directed acyclic graph G .
Without loss of generality, we introduce a Causal
Generative Model (CGM) M capturing the computational relations between a selected subset of variables comprising: (1) the input latent variables { z k } , (2) the generator’s output Y (typically multidimensional), and (3) a collection of possibly multi-dimensional endogenous (internal) variables forming an intermediate representation such that the generator’s output can be decomposed into two successive steps as { Z k } (cid:55)→ { V k } (cid:55)→ Y .
In a feed-forward neural network, one V k may for instance represent one channel of the output of a convolutional layer (e.g. after application of the
ReLU non-linearity).
Deﬁnition 5 (Causal Generative Model (CGM)) .
Given K real-valued latent variables z = ( z k ) taking arbitrary values on domain Z = (cid:81)
Kk =1 Z k , where all Z k ’s are closed intervals, the CGM
M = G ( Z , S , G ) comprises a directed acyclic graph G and a set S of N +1 deterministic continuous structural equations that assign:
• N endogenous variables { V k :=
f k ( Pa k ) } k =1 ..
N taking values in Euclidean spaces
( V k ) k
=1 ..N , based on their endogenous or latent parents Pa k in G ,• one output Y :=
f y ( Pa y ) taking values in Euclidean space Y , parents Pa y in G being endogenous.
Moreover, z k ’s are the only sources and Y is the only sink.
The graph of an example CGM is exempliﬁed on Fig.
2b, consisting of 3 endogenous variables,latent inputs and the output.
This aligns with the deﬁnition of a deterministic structural causal model by Pearl (2009, chapter 7), once our latent variables are identiﬁed with exogenous ones.
CGMs have however speciﬁcities reﬂecting the structure of models encountered in practice.
For instance, variable assignments may or may not involve latent/exogenous variables in their right-hand side, which is unusual in causal inference.
This allows modeling feed-forward networks consisting in a ﬁrst layer receiving latent inputs followed by a cascade of deterministic operations in downstream layers.
The above deﬁnition guaranties several basic properties found in the computational graph of existing generative networks: (1) all endogenous variables V k are unambiguously assigned once z is chosen, (2) the output Y is unambiguously assigned once either z is chosen, or, alternatively, if an appropriate subset of V k ’s, such as Pa y , is assigned.
This allows us to introduce several useful mappings.
In an ideal case, while the support of the latent distribution covers the whole latent space Z , internal variables and outputs typically live on manifolds of smaller dimension than their ambient space.
These can be deﬁned as the images 4 of Z by operations of the graph: the output image Y M
=
Y [ Z ] ,
the endogenous images
V kM =
V k
[ Z ] for a
single
variable
V
E
M
=
(cid:8) v ∈ (cid:81)
k ∈E
V
k :
v
= (
v
k ( z ))
k ∈E , z ∈ Z (cid:9) for a subset of variables indexed by E , and V M when E includes all endogenous variables.
Functions assigning Y from latent variables and from endogenous variables, respectively, are
[Equation]
and
[Equation]
and we call them latent and endogenous mappings , respectively.
Given the typical choice of dimensions for latent and endogenous variables, the V k ’s and Y are constrained to take values in subsets of their euclidean ambient space.
We will assume that ˜ g M and g M deﬁne proper embeddings, in particular implying that they are both invertible.
We call a CGM satisfying these assumptions an embedded CGM.
With this vocabulary we can for example verify the example of Fig.
2b contains exactly two layers (in green).
Note g M and ˜ g M are well deﬁned because the output can be unambiguously computed from their inputs by successive assignments along G , and are both surjective due to appropriate choices for domains and codomains.
All deﬁned image sets ( V (cid:96)M , Y M , ...) are constrained by the parameters of M , and are typically not easy to characterize.
For example V M is likely a strict subset of the
Cartesian product (cid:81) k V kM .
Importantly, the image set Y M of a trained model is of particular signiﬁcance, as it should approximate at best the support of the data distribution we want to model.
Learning the generator parameters such that Y M precisely matches the support of the target data distribution is arguably a major goal for generative models (see e.g. Sajjadi et al.
As we will manipulate properties of the output, we restrict ourselves to transformations that respect the topology of Y M , and use embeddings as the basic structure for it, allowing inversion of g M .
Deﬁnition 6 (Embedded CGMs) .
If f : X → Y is a continuous injective function with continuous inverse f − 1 : f [ X ] → Y , we call f an embedding of X in Y .
We say that a CGM M is embedded if g M and ˜ g M are respective embeddings of Z and V M in Y .
Since Deﬁnition 5 imposes continuous structural equations,which is satisﬁed for all operations in standard generative models, injectivity of g M is the key additional requirement for embedded CGMs.
Proposition 4.
If Z of CGM M is compact (all Z k ’s are bounded), then M is embedded if and only if g M is injective.
Proof is provided in Appendix B. This implies that generative models based on uniformly distributed latent variables (the case of many GANs), provided they are injective, are embedded CGMs.
While
VAEs’ latent space is typically not compact (due to the use of normally distributed latent variables), we argue that restricting it to a product of compact intervals (covering most of the probability mass) will result in an embedded CGM that approximates the original one for most samples.
Based on this precise framework, we can now provide the formal deﬁnitions and results described informally in main text.
The CGM framework allows deﬁning counterfactuals in the network following Pearl (2014).
Deﬁnition 7 (Unit level counterfactual) .
Given CGM M , for a subset of endogenous variables
E = { e 1 , .., e n } , and assignment h of these variables, we deﬁne the interventional CGM M h obtained by replacing structural assignments for V |E by assignments { V e k :=
h k ( z ) } e k ∈E .
Then for a given value z of the latent variables, called unit , the unit-level counterfactual is the output of M h :
Y E h ( z ) =
g M h ( z ) .
Deﬁnition 7 is also in line with the concept of potential outcome (Imbens & Rubin, 2015).
Importantly, conterfactuals induce a transformation of the output of the generative model.
Deﬁnition 2 (Counterfactual mapping) .
Given an embedded CGM, we call the continuous map
[Equation]
the ( E , h ) -counterfactual mapping.
We say it is faithful to M whenever (cid:121)
Y E h
[ Y M ] ⊂ Y M .
Our approach then relates counterfactuals to a form of disentanglement allowing transformations of the internal variables of the network as follows.
Deﬁnition 3 (Intrinsic disentanglement) .
In a CGM M , endomorphism T : Y M → Y M is intrinsically disentangled with respect to a subset E of endogenous variables, if it exists a transformation T (cid:48) of endogenous variables such that for any latent z ∈ Z , leading to the tuple of values v ∈ V M ,
T ( Y ( v ))
=
Y ( T (cid:48) ( v )) (3) where T (cid:48) ( v ) only affects the variables indexed by E .
In this deﬁnition, Y ( v ) corresponds to the unambiguous assignment of Y based on endogenous values.
5 Fig.
2d illustrates this second notion of disentanglement, where the split node indicates that the value of V 2 is computed as in the original CGM (Fig. 2b) before applying transformation T 2 to the outcome.
Intrinsic disentanglement relates to a causal interpretation of the generative model’s structure in the sense that it expresses a form of robustness to perturbation of one of its subsystems.
Counterfactuals represent examples of such perturbations, and as such, may be disentangled given their faithfulness.
Proposition 1 (Counterfactuals and disentanglement, formal) .
For an embedded CGM M and continuous assignment h , the ( E , h ) -counterfactual mapping (cid:121)
Y E h is faithful if and only if it is intrinsically disentangled with respect to subset E .
Moreover, if h [ Z ] ⊂ V E M , it is sufﬁcient that E and E do not have common latent ancestors for (cid:121) Y E h to be faithful.
The proof is provided in Appendix B.
A PPENDIX B: A DDITIONAL DETAILS FOR S ECTION 2 ANDT OPOLOGICAL CONCEPTS
Continuity.
We recall the classical deﬁnition of continuity of f : X → Y .
Given the respective topologies τ X
and τ Y of domain and codomain (the sets of all open sets), f is continuous whenever for all A ∈ τ Y , f − 1 ( A ) ∈
τ X .
Euclidean topology.
For deﬁning continuity between Euclidean spaces, we rely on the Euclidean (or standard) topology naturally induced by the metric: as set is open if and only if it contains and open ball around each if its points.
Subset topology.
When restricting the domain or codomain of a mapping to a subset A of the
Euclidean space, we rely on the subspace topology, that consists in the intersection of A will all open sets.
P ROOF OF P ROPOSITION
Following a result stated in Armstrong (2013), since Z is compact and the codomain of g M is
Hausdorff (because Euclidean), then a continuous (by deﬁnition) and injective g M is an embedding.
In addition, g M injective implies ˜ g
(cid:96)M ’s are injective on their respective domains V (cid:96)M .
Moreover, the V (cid:96)M ’s being image of a compact Z by a continuous mapping (by the CGM deﬁnition), they are compact, such that the respective ˜ g (cid:96)M ’s are also embeddings.
P ROOF OF P ROPOSITION
Part 1: Proof of the equivalence between faithful and disentangled.
One conditional is trivial: if a transformation is disentangled, it is by deﬁnition an endomorphism of Y M so the counterfactual mapping must be faithful.
For the second conditional, let us assume a faithful (cid:121) Y E h and denote the (unambiguous) map from V to the output
[Equation]
This map differs from ˜ g M due to its broader domain and codomain, such that it is neither necessarily an injection nor a surjection, but they coincide on the image V M .
We can ﬁrst notice (using
Deﬁnition 7 and the embedding property) that the counterfactual mapping can be decomposed as
[Equation]
where T (cid:48) : V E × V E → V E × V E (˜ v , v ) (cid:55)→ (˜ v , h ) .
Since (cid:121) Y E h is faithful, it is then an endomorphism of it
Y M
(continuity comes form the composition of continuous functions), as required by the deﬁnition of disentanglement.
For any v ∈ V , consider then the quantity
[Equation]
using the above decomposition, we can rewrite it as
[Equation]
where T (cid:48) is a transformation that only affects endogenous variables in E , demonstrating that (cid:121)
Y E h ( Y ( v )) is disentangled with respect to E .
Part 2: Sufﬁcient condition.
This is a direct application of the following Proposition 5 after observing that in our case, the endomorphism T E required in this proposition is the constant function with value h .
Proposition 5.
For embedded CGM M , if a subset E of endogenous variables does not share common latent ancestors 6 with the reminder of endogenous variables E , then any endomorphism
T E : V E M → V E M leads to a transformation
[Equation]
with T (cid:48)
[Equation]
such that T is disentangled with respect to E in M .
Proof of Proposition 5.
The absence of common latent ancestor between E and E ensures that values in both subsets are unambiguously assigned by non-overlapping subsets of latent variables, A and B respectively, such that we can write
[Equation]
This implies that the image set of this layer fully covers the Cartesian product of the image sets of the two subsets of variables,
i.e. V M =
V E M
×
V E M , and guaranties that T (cid:48) is and endomorphism of V (cid:96)M for any choice of endomorphism T E .
This further implies T is well deﬁned and an endomorphism.
P ROOF SKETCH FOR P ROPOSITION
Due to the i.i.d.
assumption on Z and the structure following the sufﬁcient condition of Prop. 1, it is clear that the subsets of endogenous variables associated to each V k are modular and the associated partition of the hidden layer is a disentangled representation.
The choice of increasing dimensions as well as the i.i.d.
sampling of the model parameters from a distribution with a density make sure the resulting mapping is injective and follow the embedded CGM assumptions of Def. 6.
Finally, the conditions on the
I k ’s and the thresholding approach guaranties a rank K binary factorization of the matrix B , with one factor gathering the indicator vectors associated to each V k and the uniqueness of this factorization is guaranteed by classical NMF identiﬁability results, e.g. following (Diop et al.)[Theorem III,1].
A PPENDIX C: A RCHITECTURE DETAILS V ANILLA β -VAE AND DCGAN
The β -VAE architecture is presented in Supplementary Fig.
7 and is very similar to the DCGAN architecture.
Hyperparameters for both structures are speciﬁed in Table 1.
BEGAN C ELEB A
We used the method proposed in Berthelot et al.
(2017) for CelebA dataset.
We used the pre-trained model with the same architecture as was used in the paper.
It consists of three blocks of convolutional layers each followed by an upsampling layer.
The ﬁlter size of convolutional layers is (3 , 3) all over the generator.
There is also skip connections in the model that is argued to increase the sharpness of images.
Consult (Berthelot et al., 2017, Figure 1) for architectural details.
B IG GAN- DEEP -256 ARCHITECTURE DETAILS
The pretrained model is taken from Tensorﬂow-hub ( https://tfhub.dev/ , we summarize below the main aspects of the architectures.
We used the BigGan-deep architecture of Brock et al.
(2018) as a pre-trained model on 256x256 ImageNet.
We did not retrain the model.
The architecture consists of several ResBlocks which are the building block of the generator.
Each ResBlock contains
BatchNorm-ReLU-Conv Layers followed by upsampling transformations and augmented with skip connections that bring fresh signal from the input to every ResBlock.
Consult Brock et al.
(2018) for architectural details.
C LASSIFIERS ARCHITECTURE DETAILS
All pretrained models are taken from Tensorﬂow-hub ( https://tfhub.dev/ , we summarize below the main aspects of the architectures.
I NCEPTION R ES N ET V
Inception ResNet V2 is a neural network architecture for image classiﬁcation, originally published by
Christian Szegedy, Sergey Ioffe, Vincent Vanhoucke, Alex Alemi: ”Inception-v4,
Inception-ResNet and the Impact of Residual Connections on Learning”, 2016.
I NCEPTION V
Inception V3 is a neural network architecture for image classiﬁcation, originally published by
Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jonathon Shlens, Zbigniew
Wojna: ”Rethinking the Inception Architecture for Computer Vision”, 2015.
N ASNET LARGE
NASNet-A is a family of convolutional neural networks for image classiﬁcation.
The architecture of its convolutional cells (or layers) has been found by Neural Architecture Search (NAS).
NAS and
NASNet were originally published by
Barret Zoph
Barret Zoph, Vijay Vasudevan
NASNets come in various sizes.
This TF-Hub module uses the TF-Slim implementation nasnet large of NASNet-A for ImageNet that uses 18 Normal Cells, starting with 168 convolutional ﬁlters (after the ”ImageNet stem”).
It has an input size of 331x331 pixels.
[Table]
ResNet V2 is a family of network architectures for image classiﬁcation with a variable number of layers.
It builds on the ResNet architecture originally published by
Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun: ”Deep Residual Learning for Image Recognition”, 2015.
The full preactivation ’V2’ variant of ResNet used in this module was introduced by
Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun: ”Identity Mappings in
Deep Residual Networks”, 2016.
A PPENDIX D: A DDITIONAL FILES .
The ﬁle inﬂuence.py provided at the link https://www.dropbox.com/sh/ 4qnjictmh4a2soq/AAAa5brzPDlt69QOc9n2K4uOa?dl=0 contains key elements of the code for counterfactual analysis of generative models.
A PPENDIX E: A DDITIONAL R ESULTS I NFLUENCE MAP CLUSTERING AND HYBRIDIZATION IN DCGAN S
We replicated the above approach for GANs on the CelebA dataset.
The result shown in Supplemental
Fig.
11 summarize the main differences.
First, the use of three clusters seemed again optimal according to the stability of the obtained cluster templates.
However, we observed that the eyes and mouth location were associated with the top of the head in one cluster, while the rest of the face and the sides of the image (including hair and background) respectively form the two remaining clusters.
In this sense, the GAN clusters are less aligned with high level concepts reﬂecting the causal structure of these images.
However, such clustering still allows a good visual quality of hybrid samples.
A PPENDIX F: A DDITIONAL D ISCUSSION E XTENSION AND RELATION TO OTHER FRAMEWORKS
While we deﬁned disentanglement of transformations, this concept has been classically attributed to a representation, or factors of variation.
Focusing on a transformation aligns to our aim of providing an agnostic deﬁnition, in the sense that it only relies on the generator architecture and a given transformation, but neither on data, nor on properties that are not stated explicitly in the deﬁnition.
In contrast, disentangled representation is usually understood as intervening on meaningful/interpretable features in the image, which may be subjective, or at least referring to some external knowledge.
Alternatively, one might expect that what should be disentangled is a property or a factor of variation (say “hair color”).
We argue that we can state a property is disentangled by the generalizing our notion of disentanglement to a family of transformations as follows.
Deﬁnition 8 (Disentangled family) .
A family of transformations (possibly parametric) is disentangled if all members are disentangled with respect to the same E .
Then a property may be disentangled if the class of all transformations changing “only” the value of this speciﬁc property is disentangled according to Deﬁnition 8.
Finally, one might also expect that several transformations (or families of transformations) should be disentangled with respect to each other, e.g. allowing to state that hair color should be disentangled from hair length.
This relative disentanglement is easily deﬁned based on our original deﬁnition.
Deﬁnition 9 (Relative disentanglement) .
The families of functions ( F i ) i ∈ 1 ..
N are called jointly disentangled whenever they are disentangled with respect to non-overlapping subsets of variables ( E i ) i ∈ 1 ..N within a given layer.
We argue that the notion introduced in Higgins et al.
(2018) can be framed as a special case of
Deﬁnition 9.
S UPPLEMENTARY FIGURES AND TABLES
[Table]
G
C 1 .0 .
C 1 .0 .0 . C 1 .0 .0 .0 .
R
G
C C
C
[Figure] [Table]