S PATIAL D EPENDENCY N ETWORKS : N EURAL L AYERS FOR I MPROVED G ENERATIVE I MAGE M ODELING
Anonymous authors
Paper under double-blind review
A BSTRACT
How to improve generative modeling by better exploiting spatial regularities and coherence in images?
To answer this question, we introduce a novel neural layer for building image generators (decoders) and apply it to variational autoencoders (VAEs).
Our spatial dependency networks (SDNs) compute feature maps in a spatially coherent way, utilizing a sequential gating-based mechanism to distribute contextual information across 2-D maps.
Different SDN layers of a deep neural network represent spatial dependencies at different levels of abstraction.
Augmenting the decoder of a hierarchical VAE by spatial dependencies considerably improves density estimation over baseline convolutional architectures and the state-of-the-art among the models within the same class.
We show that SDN can be applied to large images by synthesizing samples of high quality and coherence.
In a vanilla VAE setting, we ﬁnd that a powerful SDN decoder also improves learning disentangled representations, indicating that neural architectures play an important role in this task.
Our results suggest favoring SDNs over convolutional networks in various VAE settings.
I NTRODUCTION
The abundance of data and computation are often identiﬁed as core facilitators of the deep learning revolution.
In addition to this technological leap, historically speaking, most major algorithmic advancements critically hinged on the existence of inductive biases, incorporating prior knowledge in different ways.
Main breakthroughs in image recognition (Cires¸an et al., 2012; Krizhevsky et al., 2012) were preceded by the long-standing pursuit for shift-invariant pattern recognition (Fukushima & Miyake, 1982) which catalyzed the ideas of weight sharing and convolutions (Waibel et al., 1989;
LeCun et al., 1989).
Recurrent networks (exploiting temporal recurrence) and transformers (modeling the ”attention” bias) revolutionized the ﬁeld of natural language processing (Mikolov et al., 2011;
Vaswani et al., 2017).
Visual representation learning is also often based on priors e.g. independence of latent factors (Schmidhuber, 1992; Bengio et al., 2013) or invariance to input transformations (Becker & Hinton, 1992; Chen et al., 2020).
Clearly, one promising strategy to move forward is to introduce more structure into learning algorithms, and more knowledge on the problems and data.
Along this line of thought, we explore a way to improve the architecture of deep neural networks that generate images, here referred to as (deep) image generators, by incorporating prior assumptions based on topological image structure.
More speciﬁcally, we aim to integrate the priors on spatial dependencies in images.
We would like to enforce these priors on all intermediate image representations produced by an image generator, including the last one from which the ﬁnal image is synthesized. To that end, we introduce a neural layer designed speciﬁcally for building image generators – spatial dependency network (SDN). Concretely, the proposed SDN layer incorporates two priors: (i) spatial coherence reﬂects our assumption that feature vectors should be dependent on each other in a spatially consistent, smooth way.
Thus in SDN, the neighboring feature vectors tend to be more similar than the non-neighboring ones, where the similarity correlates with the 2-D distance. The graphical model of SDN captures this assumption (see Figure 1(a)).
Note that SDN can nevertheless model long-range dependencies; (ii) spatial dependencies between feature vectors should not depend on their 2-D coordinates. Mathematically speaking, SDN should be equivariant to spatial translation, in the same way convo-
[Figure]
The particular focus of this paper is the application of SDN to variational autoencoders (VAEs) (Kingma & Welling, 2013). The main motivation is to improve the performance of VAE generative models by endowing their image decoders with SDNs (Figure 1(b)).
While out of the scope of this work, SDN could also be applied to other generative models, e.g. generative adversarial networks (Goodfellow et al., 2014). More generally, SDN could be potentially used in any task in which image generation is required, such as image-to-image translation, super-resolution, image in-painting, image segmentation, or scene labeling.
SDN is experimentally examined in two different settings.
In the context of real-life-image density modeling, SDN-empowered hierarchical VAE is shown to reach considerably higher test loglikelihoods than the baseline CNN-based architectures, and is able to synthesize perceptually appealing and coherent images even at high sampling temperatures.
In a synthetic data setting, we observe that enhancing a non-hierarchical VAE with an SDN also facilitates learning of factorial latent codes, suggesting that unsupervised ’disentanglement’ of representations can be bettered by using more powerful neural architectures, where SDN stands out as a good candidate model.
The contributions and the contents of this paper can be summarized as follows.
C ONTRIBUTIONS AND CONTENTS :
• The architecture of SDN is introduced and then contrasted to the related ones, including convolutional network and self-attention. The relationship of SDN with autoregressive density models and normalizing ﬂows is also explored.
• The architecture of SDN-VAE is introduced – the result of applying SDN to IAF-VAE (Kingma et al., 2016), with modest modiﬁcations to the original architecture. SDN-VAE is evaluated in terms of: (a) density estimation, where the performance is considerably improved both upon the baseline and related approaches to non-autoregressive modeling, on CIFAR10 and ImageNet32 data sets; (b) image synthesis, where images of competitively high perceptual quality are generated based on CelebAHQ256 data set.
• By integrating SDN into a relatively simple, non-hierarchical VAE, trained on the synthetic 3D-Shapes data set, we demonstrate in another comparative analysis substantial improvements upon convolutional networks in terms of: (a) optimization of the evidence lower bound (ELBO); (b) learning of disentangled representations with respect to two popular metrics, when β -VAE (Higgins et al., 2016) is used as an objective function.
• The implementation of the proposed architectures and of our experiments is disclosed in the frameworks of Pytorch (Paszke et al., 2019) and PytorchLightning (Falcon, 2019). [Figure]
SDN A RCHITECTURE
The architectural design of SDN is motivated by our intent to improve modeling of spatial coherence and higher-order statistical correlations between pixels.
Schematic overview of SDN is given in
Figure 2.
Technically speaking, SDN layer is a differentiable function which transforms input to output feature maps in a 3-stage procedure.
We ﬁrst describe the stages of SDN in detail, then address practical and computational concerns.
Project-in stage.
Using a simple feature vector-wise afﬁne transformation, the input representation X L k at the layer L k is transformed into the intermediate representation I L k :
[Equation]
where i and j are the corresponding 2-D coordinates in X L k and I L k , b ( 1 ) is a vector of learnable biases and W ( 1 ) is a learnable matrix of weights whose dimensions depend on the number of channels of X L k and I L k .
In the absence of overﬁtting, it is advisable to increase the number of channels to enhance the memory capacity of I L k and enable unimpeded information ﬂow in the correction stage.
Notice that described transformation corresponds to the convolutional (CNN) operator with a kernel of size 1.
If the scales between the input X L k and the output X L k +1 differ (e.g. if converting an 8x8 to a 16x16 tensor), in this stage we additionally perform upsampling by applying the corresponding transposed CNN operator, also known as ‘deconvolution’ (Zeiler & Fergus, 2014).
Correction stage.
The elements of I L k are ‘corrected’ in a 4-step procedure.
In each step, a unidirectional sweep through I L k is performed in one of the 4 possible directions: (i) bottom-totop; (ii) right-to-left; (iii) left-to-right; and (iv) top-to bottom.
During a single sweep, columns/rows are computed in parallel.
The corresponding correction equations implement controlled updates of I L k using a gating mechanism, as done in popular recurrent units (Hochreiter & Schmidhuber, 1997; Cho et al., 2014).
Speciﬁcally, we use a multiplicative update akin to the one found in GRUs (Cho et al., 2014), but adapted to the spatial setting.
The procedure for the bottom-to-top sweep is given in Algorithm 1 where W ∗ denote learnable weights, B ∗ are learnable biases, i is the height (growing bottom-to-top), j is the width and c is the channel dimension. Gating elements r i,j,c and z i,j,c control the correction contributions of the a priori value of I i,j,c and the proposed value n i,j,c , respectively. For the borderline elements of I L k , missing neighbors are initialized to zeros (hence the zero padding).
The sweeps in the remaining 3 directions are performed analogously.
Project-out stage. Corrected ( a posteriori ) representation I L k + is then mapped to the output X L k +1 , which has the same number of channels as the input X L k :
[Equation] (2) where W ( 3 ) is the stage-level learnable weight matrix and b ( 3 ) is the corresponding bias vector.
Input: I L k – intermediate representation; N – the scale of I L k ;
Output: I L k + – corrected intermediate representation; # after all 4 sweeps
Complexity: O ( N )
I L k = tanh( I L k )
# done for the ﬁrst direction only
I L k = zero padding ( I L k ) # done for the ﬁrst direction only for i = 1 to N and ( j = 1 to N in parallel ) do r i,j,c = σ ([ W r1 I i,j ] c
+ [ W r2 I i − 1 ,j ] c + [ W r3 I i − 1 ,j − 1 ] c )
+ [ W r3 I
i − 1 ,j +1 ] c
+ B r i,j,c ) # reset gate z i,j,c = σ ([ W z1 I i,j ] c +[ W z2 I i − 1 ,j ] c +[ W z3 I i − 1 ,j − 1 ] c )+[ W z3 I i − 1 ,j +1 ] c + B z i,j,c ) #update gate n i,j,c = tanh( r i,j,c
[ W n1 I i,j ] c
+ [ W n2 I
i − 1 ,j ] c
+ [ W n3 I
i − 1 ,j − 1 ] c )
+ [ W n3 I
i − 1 ,j +1 ] c + B n i,j,c )
I i,j,c
=
z i,j,c
I i,j,c + (1 − z i,j,c ) n i,j,c # feature correction end for
Computational considerations.
A valid concern in terms of scaling SDN to large images is the computational complexity of O ( N ) , N being the scale of the output.
We make two key observations:
a. one can operate with less than 4 directions per layer, alternating them across layers to achieve the ‘mixing’ effect.
This improves runtime with some sacriﬁce in performance; b. in practice, we found it sufﬁcient to apply SDN only at lower scales (e
g. up to 64x64 on CelebAHQ256) with little to no
loss
in performance. We speculate that this is
due
to redundancies in high-resolution images, which allows
modelling
of relevant spatial structure at lower scales
To provide additional insights on the computational characteristics, we compared SDN to CNN concerning the number of parameters and runtime in a constrained (unit test-like) setting.
This is documented in Appendix A.3.
Avoiding vanishing gradients.
The problem of vanishing gradient might arise when SDN is plugged in a very deep neural network (such as the one discussed in Section 4).
To remedy this, in our SDN-VAE experiments we used the variant of SDN with ’highway’ connection, i.e. gated residual (Srivastava et al., 2015), to which we refer to as ResSDN (shown in Figure 3).
[Figure]
R ELATED W ORK
Convolutional networks.
Both SDN and CNN layers exploit locality (a feature vector in SDN is corrected based on its direct neighbors) and equivariance to translation (achieved through parameter sharing). Additionally, SDN enforces spatial coherence.
There are also differences in the dependency modeling (depicted in Figures 2(b) and 2(c)).
Firstly, when conditioned on the input X L k , the output feature vectors of CNN are statistically independent: X L k +1 i,j
[-+
-][Equation]
where i and j are feature map coordinates.
In SDNs, all feature vectors are dependent: X L k +1 i
[Equation]
j
[Equation]
⊥ X L k +1 l,m |
X L k ∀
i, j ) (cid:54) =
( l, m ) .
Secondly, in the observed one-layer setup, the unconditional dependency neighborhood of CNN is bounded by the size of its receptive ﬁeld – a conceptual limitation not present in SDN. Hence unlike CNN, SDN can model long-range spatial dependencies.
Autoregressive models and normalizing ﬂows.
SDN design is inspired by how autoregressive models capture spatial dependencies due to the pixel-by-pixel generation process (Theis & Bethge, 2015).
One advantage of SDN-VAE is its ability to model multi-directional spatial dependencies since the sweeps are done in latent space, whereas autoregressive models are inherently unidirectional; the generation order of pixels can be changed, but is ﬁxed for training and sampling.
Most autoregressive models leverage on teacher forcing during training to avoid sequential computation, but sampling time complexity is quadratic.
SDN have linear complexity in both cases. Parallel computation of SDN is similar to the one found in PixelRNN (Van Oord et al., 2016), but implemented in the deterministic autoregressive setting with no directionality or constraints. One can also draw parallels with how autoregressive models describe normalizing ﬂows, for example, IAF (Kingma et al., 2016) and MAF (Papamakarios et al., 2017). In this case, each ﬂow in a stack of ﬂows is described with an autoregressive model that operates in a different direction, or more generally, has a different output ordering.
In its standard 4-directional form, SDN creates dependencies between all input and output feature vectors (recall Figure 1(a)); this renders a full, difﬁcult-to-compute Jacobian matrix.
For this reason, SDN is not directly suitable for parameterizing normalizing ﬂows in the same way.
In contrast, the main application domain of SDN is rather the parameterization of deterministic, unconstrained mappings.
Self-attention.
The attention mechanism has been one of the most prominent models in the domain of text generation (Vaswani et al., 2017).
Recently, it has also been applied to generative image modeling (Parmar et al., 2018; Zhang et al., 2019).
Both SDN and self-attention can model long-range dependencies.
The key difference is how this is done.
In SDN, only neighboring feature vectors are dependent on each other (see Figures 1 and 2) hence the spatial locality is exploited.
Gated units are used to ensure that the information is propagated across large distances.
On the other hand, self-attention requires an additional mechanism to incorporate positional information, but the dependencies between non-neighboring feature vectors are direct.
We believe that the two models should be treated as complementary; self-attention excels in capturing long-range dependencies while SDN is better in enforcing spatial coherence, equivariance to translation and locality.
Note ﬁnally that standard self-attention is costly, with quadratic complexity in time and space in the number of pixels, which makes it O ( N 4 ) in the feature map scale, if implemented naively.
Other related work. SDNs are also notably reminiscent of Multi-Dimensional RNNs (Graves et al., 2007) which were used for image segmentation (Graves et al., 2007; Stollenga et al., 2015) and
recognition (Visin et al., 2015), but not in the context of generative modeling.
One technical advantage of our work is the linear training time complexity in the feature map scale. Another difference is that SDN uses GRU, which is less powerful than LSTM, but more memory efﬁcient.
SDN-VAE: A N I MPROVED V ARIATIONAL A UTOENCODER FOR I MAGES
As a ﬁrst use case, SDN is used in the SDN-VAE architecture.
The basis of SDN-VAE is the
IAF-VAE model (Kingma et al., 2016).
Apart from integrating SDNs, we introduce additional modiﬁcations for improved performance, training stability, and reduced memory requirements.
We ﬁrst cover the basics of VAEs, then brieﬂy summarize IAF-VAE and the related work.
Finally, we elaborate on the novelties in the SDN-VAE design.
Background on VAEs.
VAEs assume a latent variable generative model p θ ( X ) =
(cid:82) p θ ( X, Z ) dZ where θ are model parameters.
When framed in the maximum likelihood setting, the marginal probability of data is intractable due to the integral in the above expression.
VAEs take a variational approach, approximating posterior q φ ( Z | X ) using a learnable function q with parameters φ .
Following Kingma & Welling (2019), we can derive the following equality:
[Equation]
L φ,θ ( X ) is the evidence lower bound (ELBO), since it ‘bounds’ the marginal log-likelihood term log p θ ( X ) , where the gap is deﬁned by the KL-divergence term on the right.
In VAEs, both q φ and p θ are parametrized by deep neural networks.
The model is learned via backpropagation, and a low variance approximation of the gradient ∇ φ,θ L φ,θ ( X ) can be computed via the reparametrization trick (Kingma & Welling, 2019; Rezende et al., 2014).
Background on IAF-VAE.
Main advancements of IAF-VAE in comparison to the vanilla VAE include: (a) leveraging on a hierarchical (ladder) network of stochastic variables (Sønderby et al., 2016) for increased expressiveness and improved training; (b) introducing inverse autoregressive ﬂows to enrich simple isotropic Gaussian-based posterior with a normalizing ﬂow; (c) utilizing a structured bi-directional inference procedure to encode latent variables through an encoder-decoder interplay; (d) introducing a ResNet block as a residual-based (He et al., 2016) instantiation of the ladder layer.
For more details, we refer the reader to the original paper (Kingma et al., 2016).
Related work.
BIVA (Maaløe et al., 2019) is an extension of IAF-VAE which adds skip connections across latent layers, and a stochastic bottom-up path.
In our experiments, however, we were not able to improve performance in a similar way.
Concurrently to our work, NVAE (Vahdat & Kautz, 2020) reported signiﬁcant improvements upon the IAF-VAE baseline, by leveraging on many technical advancements including: batch normalization, depth-wise separable convolutions, mixed-precision, spectral normalization and residual parameterization of the approximate posterior.
Both methods use the discretized mixture of logistics (Salimans et al., 2017).
SDN-VAE ARCHITECTURE
Our main contribution to the IAF-VAE architecture is the integration of ResSDN layers (Figure 3).
We replace the convolutional layers on the top-down (generation) path of the IAF-VAE ResNet block, up to a particular scale: up to 32x32 for images of that resolution, and up to 64x64 for 256x256 images.
For the convenience of the reader, we borrowed the scheme from the original paper and clearly marked the modiﬁcations (Figure 4).
[Figure]
Other notable include Figure 4) training stability b more ﬂexible based on a mixture of logistics instead of a discretized logistic distribution, for improved performance; and (c) mixed-precision (Micikevicius et al., 2018), which reduced memory requirements thus allowing training with larger batches.
Without SDNs, we refer to this architecture as IAF-VAE+.
I MAGE D ENSITY M ODELING
Proposed SDN-VAE and the contributions of SDN layers to its performance were empirically evaluated in terms of: (a) density estimation, where SDN-VAE was in a quantitative fashion compared to the convolutional network baseline, and to the related state-of-the-art approaches; (b) image synthesis, where a learned distribution was analyzed in a qualitative way by sampling from it in different ways.
Exact details of our experiments, additional ablation studies and additional results in image synthesis are documented in the Appendix sections A.1, A.2 and A.4 respectively.
Density estimation.
From a set of i.i.d.
images D train =
X 1 ..N , the true probability density function p
( X ) is estimated via a parametric model p θ ( X ) , whose parameters θ are learned using the maximum log-likelihood objective: arg max θ (cid:104) log p θ ( X ) ≈ 1 N (cid:80)
Ni =1 log p θ ( X i ) (cid:105) .
The test loglikelihood is computed on an isolated set of images D test =
X 1 ..K , to evaluate learned p θ ( X ) .
SDN-VAE and the competing methods were tested on CIFAR-10 (Krizhevsky et al., 2009), ImageNet
(Van Oord et al.
is given in Table 1.
IAF-VAE+ denotes our technically enhanced implementation of IAF-VAE, but without the SDN modules (recall Section 4) [Table] [Table] autoregressive we
[Table]
based
[Table]
[Equation]
Image synthesis.
We additionally inspected the trained p θ ( X ) by: (a) unconditionally generating samples from the prior, at different temperatures (Figure 6 left); (b) sampling in the neighborhood of an image not seen during training time (Figure 6 right); (c) interpolating between two images not seen during training time (Figure 5).
All technical details on these experiments are in Appendix A.1.
Additional images are given in Appendix A.4.
Discussion.
Our results clearly suggest that SDN-VAE is not only superior to the convolutional network baseline, but also to all previous related approaches for non-autoregressive density modeling.
To further inspect whether the increase in performance is due to applying SDN or due to the implicit increase in the number of parameters, we conducted additional ablation studies (described in Appendix A.2).
These results provide additional evidence that SDN is the cause of increased performance, as even convolutional networks with more parameters, increased receptive ﬁeld or more depth lead to inferior performance.
In our image generation experiments we conﬁrmed that SDN-VAE can be successfully scaled to large images.
Generated samples are of exceptionally high quality.
What is particularly challenging in VAE-based image generation, is sampling at high temperatures, however as shown in Figureof our Appendix, SDN-VAE can successfully synthesize coherent images even in this case.
L EARNING D ISENTANGLED R EPRESENTATIONS
To study its performance impact in a more constrained setting, SDN was paired with a VAE architecturally much simpler than IAF-VAE.
Apart from the implementation simplicity and shorter training time, non-hierarchical VAE is more suitable for disentangled representation learning, at least in the sense of (Higgins et al., 2016) where the aim is to factorize the dimensions of a latent vector.
In particular, the gains in performance when using SDN were evaluated with respect to: (a) evidence lower bound (ELBO), as a proxy to measure how well an image distribution is approximated; (b) disentanglement of latent codes based on the corresponding metrics, to examine the effects of SDN decoder to the quality of learned latent representations.
Experiment setting.
A relatively simple VAE architecture with a stack of convolutional networks in both the encoder and decoder (Higgins et al., 2016) was used as a baseline model.
SDN decoder was constructed using a single non-residual, one-directional instance of SDN placed at the scale 32.
The competing methods were evaluated on 3D-Shapes (Burgess & Kim, 2018), a synthetic dataset containing 64 × 64 images of scenes with rooms and objects of various colors and shapes.
Following related literature (Locatello et al., 2019), there was no training-test split, so the reported ELBOs are measured on the training set.
The remaining details are provided in Appendix A.5. [Figure]
[Table]
Training with an unmodiﬁed VAE objective.
Using the original VAE objective (Kingma &
Welling, 2013), competing architectures were compared in terms of ELBO (Table 2).
SDN leads to substantially better estimates which come from better approximation of the conditional log-likelihood term, as shown in more detail in Figure 12 in the Appendix A.6.
Training with β -VAE objective.
The same models were trained using β -VAE objective (Higgins et al., 2016).
In the β -VAE algorithm, the ‘disentanglement’ of latent dimensions is controlled by an additional hyperparameter denoted as β , which effectively acts as a regularizer.
Modiﬁed ELBO reads as: L φ,θ ( X, β ) =
E q φ ( Z | X ) [ log p θ ( X | Z )] − β KL ( q φ ( Z | X ) || {+p 
+}
( Z )) .
To investigate the effects of
SDN decoder on the shaping of the latent space, we measured disentanglement for different values of β , for two popular disentanglement metrics: β -VAE (Higgins et al., 2016) and FactorVAE (Kim & Mnih, 2018).
The results are shown in Figure 7.
[Figure]
Discussion.
In a more constrained VAE setting, the beneﬁcial effects of SDN to image modeling were conﬁrmed.
Perhaps surprisingly at ﬁrst glance, we also found that improved VAE decoder facilitates factorization of latent codes.
This may seem contradictory to the previous ﬁndings (Bowman et al., 2015; Chen et al., 2016) which suggest that a powerful decoder hurts representation learning.
However, the difference here is that SDN decoders do not leverage on teacher forcing.
‘Posterior collapse’ can happen only very early in the training, but this is in our case easily solved using β annealing (warm-up) procedure (Bowman et al., 2015).
Our results indicate the importance of good neural architectures in learning disentangled representations.
C ONCLUSIONS
Summary.
This paper introduced a novel neural layer suitable for deep neural networks that produce images – image generators (decoders).
Proposed SDN improves upon convolutional networks in terms of incorporating the prior on spatial coherence and modeling of long-range spatial dependencies. SDN was analyzed in the context of: (a) a complex hierarchical VAE model, where the state-of-the-art performance was obtained in non-autoregressive density modeling; (b) a vanilla VAE, resulting in improvements in both density modeling and disentangled representation learning.
Implications.
SDN is a simple-to-use module which can be easily integrated into any deep neural network, and as demonstrated in the paper, it is favorable to convolutional networks in multiple settings.
SDN was shown to improve the performance of VAEs immensely, which is relevant since
VAEs can be used in any density modeling task (unlike generative adversarial networks), e.g. outlier detection.
VAEs are also favorable to autoregressive models in the settings where an explicit latent representation of data is needed, e.g. when the latent interpolation between test samples is necessary.
We also provide an insight how VAE decoders can be changed for improved representation learning, suggesting an alternative way, and a concrete solution to tackle this important problem.
Limitations and future work.
The main downside of SDN remains the computation time.
However, we suspect that a more optimized implementation could substantially improve the runtime performance of SDN.
In the future, it would be beneﬁcial to explore the applicability of SDN in other settings, e.g. to apply it to other generative models such as generative adversarial networks (Goodfellow et al., 2014) or to any other image processing task such as image super-resolution or image segmentation.
A A PPENDIX A. D ENSITY ESTIMATION – E XPERIMENT D ETAILS
[Table] [Table]
[Table] [Table]
TeslaV TeslaV
[Table]
32GB
[Table]
32GB
[Table]
Gaussian
[Table]
Gaussian Gaussian
Gaussian
[Table]
1 IAF 1 IAF 1 IAF
[Table]
model
DML DML
DML
DML Mixture components
Exponential Moving Average (EMA) 0.
[Table]
bits 0.
Number
[Table]
importance samples
Mixed
[Table]
Yes Yes
Yes
Weight normalization
Yes
Yes Yes
Horizontal ﬂip data augmentation
Yes
[Table]
On conﬁguring hyperparameters.
Due to high computational demands, we only modestly optimized hyperparameters.
In principle, our strategy was to scale up: (a) the number of deterministic and SDN ﬁlters; (b) batch size; (c) learning rate; (d) the number of SDN directions and (e) the number of DML components; as long as we found no signs of overﬁtting, had no memory or stability issues, and the training was not considerably slower.
EMA coefﬁcient values were taken from the previous related works (Kingma et al., 2016; Chen et al., 2018) – we tested 0.999 and 0.9995.
We also swept through the values { 2 , 4 , 8 , 15 } for the number of latent stochastic ﬁlters, but saw no signiﬁcant difference in the performance.
Most extensively we explored the number of layers per scale, and found this to have relevant impact on runtime and over/underﬁtting, for both baseline and our architecture.
We found that more downsampling improved runtime and reduced memory consumption, but made the tested models prone to overﬁtting.
A. D ENSITY E STIMATION – A BLATION S TUDIES
Additional ablation studies on SDN-VAE were conducted in order to explore in more detail whether the good performance on the density estimation experiments (Table 1) indeed comes from the proposed SDN layer.
We used CIFAR-10 data on which both baseline and SDN-VAE models converged faster in comparison to two other data sets.
Our main motivation was to understand whether the increase in performance comes from our architectural decisions or simply from the increase in the number of parameters.
Namely, since ResSDN (from Figure 3) is a network with a larger number of parameters in comparison to the baseline 3x3 convolutional network, it would be justiﬁed to question if the increase in performance can be indeed attributed to ResSDN layers.
To that end, we designed multiple baseline blocks to replace CNN in the IAF-VAE+ architecture, by replicating the design protocol from Section 4 in which ResSDN was applied to create the SDNVAE architecture.
Baseline blocks are illustrated in Figure 8.
The main idea is to explore whether possibly increased kernel of a CNN would be sufﬁcient to model spatial dependencies, or whether a deeper network can bring the same performance to the basic VAE architecture.
[Figure]
All baseline blocks were trained in the same setting as SDN-VAE i.e. all the parameters were kept ﬁxed, except from the learning rate, which we halved after every 10 unsuccessful attempts to stabilize the training.
IAF-VAE based on the CNN block was stable at the default learning rate of 0.002, B2 was stable at the learning rate of 0.001, while B4 and B1 were stable only at 0.0005.
B was unstable.
We also tested ResSDN at a learning rate of 0.001 to understand if there would be a drop in performance, but there wasn’t any except from marginally slower convergence time.
The best runs in terms of negative evidence lower bound (ELBO) for each of the baseline blocks, along with our most successful run for SDN-VAE architecture are reported in Table 4.
What we can observe is that the increase in capacity can indeed be correlated with good performance.
However, even those VAE models which contained more parameters than the proposed SDN-VAE architecture were not able to converge to a higher negative ELBO.
In fact, there exist a considerable performance gap between baseline blocks and the proposed ResSDN layer.
[Table]
A. A DDITIONAL SDN A NALYSIS
Number of parameters.
For a ﬁlter size of 200 (a value used in the SDN-VAE experiments), we compare the number of parameters between CNN and SDN layers.
Note that the input scale does not have any effect on the resulting numbers.
The numbers are given in Table 5.
Here ‘d’ denotes the directions in SDN. ’
Project phase’ denotes the size of project-in and project-out SDN sub-layers which are in this experiment of the same size, since no upsampling is performed.
We can observe that the 2-directional SDN is approximately of the same size as 5x5CNN in terms of number of free parameters.
[Table]
Runtime unit tests.
We measured the execution times of forward propagation of CNN and SDN, for different input scales.
To obtain standard deviation estimates, each forward propagation was repeated 100 times.
The batch size was set to 128.
The results are given in Table 6.
SDN is considerably slower than CNN, but in the reasonable limits.
Note that more efﬁcient implementation will likely improve SDN
[Table]
performance
[Table]
A. I MAGE S YNTHESIS – A DDITIONAL R ESULTS
Presented is a 3x3 grid In there is a 3x3 sub conditioned on number
A. L EARNING D ISENTANGLED R EPRESENTATIONS – E XPERIMENT D ETAILS
The hyperparameter conﬁguration is given in Table 7.
In principle, we followed Higgins et al.
; Locatello et al.
(2019) in conﬁguring parameters.
Notable changes include using of dicretized logistics (Kingma et al., 2016) as the observation model and the Adamax optimizer.
We also applied β -VAE annealing to avoid posterior collapse early in the training, an issue for both considered architectures.
The base architecture was again taken from the same previous works.
The exact description of architectures is given in Table 8 for the CNN-based VAE, and in Table 9 for the
SDN-based VAE
[Table] [Table]
[Table]
A. L EARNING D ISENTANGLED R EPRESENTATIONS – A DDITIONAL R ESULTS
For the sake of completeness, we also provide learning curves for varying values of β and for different individual terms of β -VAE objective function.
The plots are shown in Figure
[Table]
[Figure] [Figure]
K L ( q ( Z | X ) | p 0 ( Z ))
CNNSDN
[Figure]
[Figure]
( q ( Z | X ) | p 0 ( Z ))
[Figure] [Figure]
Z )
[Figure]
| X ) | p 0 ( Z ))
[Figure]
- formed, where β was increased from 0 to its ﬁnal value across the span of 100K training iterations (the end of the annealing procedure is denoted by the vertical line in the plots of the column (c)).