M ULTI - DOMAIN IMAGE GENERATION AND TRANSLATION WITH IDENTIFIABILITY GUARANTEES
Anonymous authors
Paper under double-blind review
A BSTRACT
Multi-domain image generation and unpaired image-to-to-image translation are two important and related computer vision problems.
The common technique for the two tasks is the learning of a joint distribution from multiple marginal distributions.
However, it is well known that there can be infinitely many joint distributions that can derive the same marginals.
Hence, it is necessary to formulate suitable constraints to address this highly ill-posed problem.
Inspired by the recent advances in nonlinear Independent Component Analysis (ICA) theory, we propose a new method to learn the joint distribution from the marginals by enforcing a specific type of minimal change across domains.
We provide the formulations of minimal changes and some other assumptions, under which the true joint distribution across domains is identifiable.
We also provide a practical implementation of multidomain image generation and a technique to improve unpaired image-to-image translation.
We apply our method to five multi-domain image generation and six image-to-image translation tasks.
The superior performance of our model supports our theory and demonstrates the effectiveness of our method.
I NTRODUCTION
Multi-domain image generation and unpaired image-to-image translation are two important and closely related problems in computer vision and machine learning.
They have many promising applications such as domain adaptation (Liu & Tuzel, 2016; Hoffman et al., 2018; Murez et al., 2018;
Wang & Jiang, 2019) and medical analysis (Armanious et al., 2019; 2020; Kong et al., 2021).
As shown in Fig.
1, multi-domain image generation takes as input the random noise ϵ and domain label u and the task aims to generate image tuples where the images in the tuple share the same content, e.g., different facial expressions of the same people.
The second task takes as input an image in one domain and target domain label u and aims to generate another image which is in the target domain but share the same content of input, e.g., the output image has the same identity but different facial expression from the input image.
Both tasks can be viewed as instantiations of joint distribution learning problem.
A joint distribution of multi-domain images is a probability density function that gives a density value to each joint occurrence of images in different domains such as images of the same people with different facial expressions.
Once the joint distribution is learned, it can be used to generate meaningful tuples (the first task) and translate an input image into another domain without content distortion (the second task).
If the correspondence across domains is given (e.g., the identity), we can apply supervised approaches to learn the joint distribution easily.
However, collecting corresponding data across domains can be prohibitively expensive .
For example, collecting different facial expressions of same person may need controlled experiments.
By contrast, collecting image domains without correspondence can be relatively cheap, e.g., facial expressions of different people can be easily accessed online (once permission is granted).
Therefore, we consider the problem of unsupervised joint distribution learning P ( x (1) , x (2) , ..., x ( d ) ) where we are only given multiple marginal distributions in different yet related domains { P ( x ( i ) ) }
ni =1 , where d is the number of domains and x ( i ) denotes the images in domain i .
However, there can be infinitely many joint distributions that can produce the same marginals (Lindvall, 2002).
For example, we can apply conditional GANs (Mirza & Osindero, 2014; Odena et al., 2017; Miyato & Koyama, 2018;
Brock et al., 2018) to match the marginal distributions in each domain and they learn joint distributions implicitly.
We can sample a tuple ⟨ x (0) , ..., x ( d ) ⟩ from its learned joint distribution using the same random noise and different domain labels.
However, there is no guarantee that the learned joint distribution in conditional GANs are optimal and it may drop the correspondence in the generated tuples (e.g., Fig.5(b)).
To tackle this problem, CoGAN (Liu & Tuzel, 2016) proposes to use different generators for each domain and share weights of high level layers in different generators.
JointGAN (Pu et al., 2018) proposes to factorize the joint distribution (e.g., P ( x (1) , x (2) )
=
P ( x (1) ) P ( x (2) | x (1) ) ) and learn one marginal and one conditional distribution with cycle consistency (Zhu et al., 2017).
While existing approaches (e.g., Liu et al.
(2017); Pu et al.
(2018) add constraints for the purpose of removing unwanted joint distributions, they are not guaranteed to find the true joint distribution.
If we are unsure about the learned joint distribution, we cannot guarantee that the generated tuples are meaningful.
Learning the true joint distribution seems to be impossible since we only have access to marginal distributions and domain label and we do not have access to the latent content and style variables.
Fortunately, recent advances in nonlinear Independent Component Analysis (ICA) theory (Hyvarinen & Morioka, 2016; 2017; Hyvarinen et al., 2019; Khemakhem et al., 2020b;b;
Von Kügelgen et al., 2021; Kong et al., 2022) show that deep nonlinear latent variable models are identifiable with auxiliary variables (e.g., domain label in our case), meaning that we can recover the latent variables (e.g., content and style in our case) up to some component-wise transformation.
Inspired by these advances, we propose a new method to learn the true joint distribution from the marginals by enforcing a specific type of minimal changes across domains.
Specifically, we assume that the influence of domain information (i.e., the underlying changes across domains) is minimal in the data generation process, e.g., only facial expression changes and no hair style changes is allowed.
To achieve the minimal changes, we inject the domain information through a component-wise strictly increasing transformation instead arbitrary complex transformation.
In addition, we assume the number of the underlying components affected by the domain information (and thus with changing distributions) is minimal.
Then we show that if the influence of domain information is minimal, the true joint distribution can be recovered from the marginal distributions.
Afterwards, we can use the learned joint distribution to sample meaningful tuples and translate input images into another domain without content distortion.
Our method can be applied to datasets where the content across domains are aligned and most existing datasets in multi-domain image generation and translation satisfy this requirement, e.g., the facial image dataset, animal face and digit images.
Our method may not be as effective when the contents when some domains contain unaligned contents.
We may need to pay more attention to the artworks-related dataset, since different painters focus on different objects in their painting (e.g., there are many fruit paintings by Cezanne and landscape paintings by Monet).
Our proposed method has several theoretical and practical contributions:
We provide the properties of an image generation process under which the true joint distribution can be recovered from marginal distributions.
In light of our theoretical results, we provide a practical method for multi-domain image generation.
The proposed method can automatically determine the underlying dimension of the latent variables with changing distributions.
Our method achieves promising results across five image generation tasks.
We propose to encourage the mapping function in image translation task to preserve the correspondence learned by our image generation model.
The significant gain over the baseline
methods on six image translation tasks demonstrate the effectiveness of our technique.
R ELATED W ORK
Multi-domain image generation and translation Generative Adversarial Network (GAN) (Goodfellow et al., 2014) performs adversarial training between the generator and the discriminator.
At the end, the distribution of sample generated by the generator is matched to the real data distribution.
Conditional GAN (Mirza & Osindero, 2014) is a variant of GAN that incorporates additional information and have been widely applied for class-conditional image generation (Brock et al., 2018).
CoGAN (Liu & Tuzel, 2016) learns the joint distribution by sharing the higher layers of two generators.
JointGAN (Pu et al., 2018) proposes to factorize the joint distribution and learn marginal and conditionals and regularize the conditionals with cycle consistency.
RegCGAN (Mao &
Li, 2018) penalizes the distance between the features of the synthesized pairs.
Methods by Liu &
Tuzel (2016); Pu et al.
(2018); Mao & Li (2018) are shown to be effective on some tasks but they do not have identifiability guarantees that they are recovering the true joint distribution (we provide a formal definition of identifiability later).
Unpaired image-to-image translation relies on additional assumptions to address the task and cycle consistency (Zhu et al., 2017)
is arguably most widely used.
However, it has been argued that cycle consistency may not be enough to learn a good mapping (Alami Mejjati et al., 2018).
Therefore, we propose a new regularization with generated tuples to help find a good mapping.
We provide more related works in appendix B.
Nonlinear ICA Nonlinear ICA aims to recover independent latents from the data that are generated by nonlinear invertible transformations from the underlying independent variables (Hyvarinen &
Morioka, 2016; 2017; Hyvarinen et al., 2019).
Recent works have shown that the true latent variables may be identifiable given additional information (Khemakhem et al., 2020a;
Gresele et al., 2020;
Locatello et al., 2020; Shu et al., 2019; Zimmermann et al., 2021; Hälvä & Hyvarinen, 2020; Klindt et al., 2020a)).
Khemakhem et al.
(2020a) prove that the latent variable is identifiable if the prior distribution is conditionally factorized.
Von Kügelgen et al.
(2021) show that the latent content variable is block-identifiable given two views of same image, which is not applicable in our case since we do not have paired data.
In the next section, we will show how our formulated problem is related to some variant of nonlinear ICA and how we can establish the identifiability of the changes across domains.
U NSUPERVISED J OINT D ISTRIBUTION L EARNING
In this section, we first provide the formulations of our conditional generative model and some additional conditioins, under which the true joint distribution is identifiable.
Then we provide a practical implementation based on conditional GAN to achieve unsupervised multi-domain image generation.
Finally, we propose a novel regularization technique to improve unpaired image-to-image translation.
3. I DENTIFIABILITY OF THE JOINT DISTRIBUTION
Given d marginal distributions { P θ ( x ( i ) ) } di =1 derived from the true but unknown joint distribution
P θ ( x (1) , ..., x ( d ) ) where θ ∈ Θ is a vector of parameters, we need to recover the true joint distribution to generate meaningful image tuples or translating images without content distribution.
To recover the true joint distribution, it needs to be identifiable.
Formally, the true joint distribution is identifiable if following hold:
[Equation]
That is, if another model with parameter θ
′ ∈ Θ matches the marginal distributions in each domain, then this would imply that the true joint distribution is also matched perfectly by the model with parameter θ ′ .
This is a well-known ill-posed problem: the joint distribution is not identifiable from marginal distributions without further assumptions.
Motivated by the multiple domain image generation and translation problems, we define the following data generation process using a latent variable model (we provide the graphical model in appendix C):
[Equation]
where z c is the common content and z ( i ) s is the style in the i -th domain.
For instance, in expression generation, z c represents the human identity information, and z s represents the expression.
Then a data point sampled from the joint distribution of our model would be one person with different expressions.
In practice, we may not have sample from the joint distribution; instead, we only have samples from the marginal distributions of P θ ( x (1) , ..., x ( d ) ) :
[Equation]
where u is the domain label and P θ ( z s |
u
= i ) =
P θ
( z ( i ) s ) .
To recover the true joint distribution, we first recover the true content z c and true style z s up to some transformation and then we establish the identifiability of the true joint distribtion.
Recovering z c and z s seems to be impossible since we only have the observations { x ( u ) } and domain label u .
Fortunately, recent advances on nonlinear ICA theory have shown that deep non-linear latent variable models are identifiable given auxiliary variable (e.g., domain label in our case)
(Khemakhem et al., 2020b;a; Von Kügelgen et al., 2021; Kong et al., 2022).
Specifically, we define
[Equation]
where f u is domain-specific component-wise strictly increasing transformation (i.e., in each domain, each dimension of z s is a strictly increasing function of the corresponding dimension of ˜ z s ) and | J f u | is the absolute value of determinant of the Jacobian matrix of function f u
P
(˜ z s ) is a prior distribution and we define it as N ( 0 , I ) .
Then we also define:
[Equation]
where g is the true generation function, δ ( . ) is the Dirac delta function and P ( z c ) is a prior distribution and we also define it as N ( 0 , I ) in our model.
We now have θ =
( f u , g ) and we can train a model with parameter θ ′
=
( ˆ f u , ˆ g ) to match the marginal distributions P θ ( x ( i ) ) .
As for the true variables ( z c , z s , x ( u ) ) , we also have the learned ones (ˆ z c , ˆ z s , ˆ x ( u ) ) .
Now we show that the true content z c and style z s are identifiable up to some transformations.
We first define z =
[ z c ; z s ] , n = dim ( z ) , n s = dim ( z s ) , n c = dim ( z c ) , Z ⊆ R n is the domain of latent variable z , Z c ⊆ R n c is the domain of latent variable z c , Z s ⊆ R n s is the domain of latent variable z s , U is the support of the distribution of u .
We say z s is component-wise identifiable if there exists a component-wise invertible transformation h s s.t.
ˆ z s =
h s ( z s ) for the recovered ˆ z s .
The content z c is block-wise identifiable means that there exists an invertible function h c s.t.
ˆ z c = h c ( z c ) for the recovered ˆ z c .
Lemma 3.1.
If the underlying data generation process is consistent with (3,4,5) and following assumptions hold:
• A1 (Smooth and Positive Density): The probability density function of latent variables is smooth (the second order derivative of the log density exists) and positive i.e. P ( z | u ) is smooth and P ( z | u ) > 0 for all z ∈ Z and u ∈ U .
• A2 (Conditional independence):
Conditioned on u , the components of z are mutually independent, which implies P ( z | u )
= (cid:81) ni P
z i | u ) .
• A3 (Linear independence): For any z s ∈
Z s ⊆ R n s , there exist 2 n s + 1 values of u , i.e., u j with
j = 0 , 1 , ..., 2 n s ,
such that
the 2 n s vectors w ( z s , u j ) − w ( z s , u 0 ) with j = 1 , ..., 2 n s , are linearly independent, where vector w ( s , u ) is defined as follows:
[Equation]
where q i ( z i , u ) = log P
( z i | u ) .
• A4 (Domain Variability): For any set A z ⊆
Z with the following two properties: (1) A z has nonzero probability measure, i.e. P ( { z ∈
A z }|{ u = u ′ } ) > 0 for any u ′ ∈ U .
A z cannot be expressed as B
z c × Z s for any set B z c ⊂ Z c .
∃ u 1 , u 2 ∈ U , such that (cid:82)
z
[Equation]
by matching the marginal distributions { P θ ( x ( i ) ) } di =1 of each domain, the component-wise identifiability of the style z s is ensured, z c is block-wise identifiable
We provide the proof and conditions in the supplementary.
Intuitively, assumptions A 3 and Arequire that the distribution P ( z | u ) varies sufficiently across domains such that the we have sufficient contrastive information to achieve the identifiability.
A3 requires that the changes in the probability density functions are complex enough such that they don’t always lie within ( 2 n s + 1 )-dimensional subspace.
Kong et al.
(2022) provide a similar result in the context of domain adaptation but it requires the dimensions of input and output of the generating function g to be the same.
If we use
GAN, the dimension of input noise and output image are obviously different, so our results are more general.
After recovering the true content z c with ˆ z c and true style z s with z s , we now proceed to address the joint distribution identifiability problem.
A main challenge is the indeterminacy of the recovered content z c and style z s caused by the unknown transformation h c and h s .
Fortunately, we show that this indeterminacy can be removed and the recovered joint distribution is the true one.
Theorem 3.2.
If 1) the underlying data generation process is consistent with (3,4,5), 2) assumptions
A1-A4 hold, and 3) the marginal distributions are matched, i.e., P θ
′ ( x ( i ) )
=
P θ ( x ( i ) ) for any domain i ∈ [ d ] , then the true joint distribution is identical to that produced by the model with parameter θ ′ , i.e., P θ ′
( x (1) , x (2) , ..., x ( d ) )
=
P θ ( x (1) , x (2) , ..., x ( d ) ) .
The proof is provided in appendix E. Unlike existing approaches, this theorem provides a guarantee that we are able to recover the true joint distribution under some conditions.
In other words, the tuples generated by the learned generative model with parameter θ ′ can also be viewed being sampled from the true generative model.
As a consequence, elements in the generated tuple ⟨ x (1) , ..., x ( d ) ⟩ have different styles but share the same content.
We can apply this model to address the challenging multi-domain image generation task directly.
As for unpaired image-to-image translation, we will show that we can also use the generated tuples to help improve the performance of image translation.
3. A PRACTICAL IMPLEMENTATION OF MULTI - DOMAIN IMAGE GENERATION
In this section, we provide a practical implementation of our conditional generative model and we can use it to achieve multi-domain image generation.
Given images from d domains, we would like to train a conditional GAN model such that the generated tuples ⟨ G ( ϵ , 1) , ..., G ( ϵ , d ) ⟩ share the content where G is the generator in GAN and ϵ is the random Gaussian noise and u ∼ { 1 , .., d } .
In order to generate meaningful tuples, we build our conditional GAN following (3,4,5).
Given random noise ϵ ∼ N ( 0 , I ) and domain label u , a naive way would be splitting the noise into two parts, i.e., ϵ =
[ˆ z c ;˜
z s ] and apply component-wise strictly increasing transformation ˆ f u on ˜ z s .
But the problem is that the true latent variables z c , z s are only identifiable when the dimensions match, i.e., dim (ˆ z c ) =
n c = dim ( z c ) and dim (ˆ z s ) =
n s = dim ( z s ) .
We usually do not have access to the true dimension n c and n s .
To address this problem, we have to assume the total dimension is matched, i.e., n s + n c = dim (ˆ z c ) + dim (ˆ z s ) .
Then we only need to determine n s .
We may treat n s as a hyper-parameter and sweep the possible values.
But it can be expensive since we have to determine the values for each dataset.
To address this issue, we propose a simple way to allow the network to learn the optimal dimension automatically with an additional regularization term.
The whole computation flow is shown in Fig.
Specifically, we apply component-wise strictly increasing transformation ˆ f u to all components of the input noise ϵ .
Then we multiply it with a trainable mask m and add it back to the input noise:
[Equation]
where the output ˆ z is the input to the generator G .
The mask m is of the same dimension as noise ϵ .
For any element i , if m i = 0 , ˆ z i only contains information from the shared ϵ and it belongs to ˆ z c .
Otherwise, ˆ z i contains the domain information u
and it belongs to ˆ z s .
In order to encourage the network determine the optimal dimension automatically, we apply L 1 loss on the mask,
[Equation]
Finally, we can proceed as normal conditional GAN method.
We introduce an conditional discriminator D and training objective is:
[Equation]
Our full objective for multi-domain image generation is
[Equation]
where λ controls the influence of domain u .
We found that λ = 0 .
1 works well across all datasets and is more stable than tuning the dimension n s in section 4.1.2.
Discussion Conditional GANs usually feed the concatenation of the input noise ϵ and domain label u into the generator G .
By contrast, we inject the domain influence to the noise ϵ through a componentwise strictly increasing transformation ˆ f u .
From a theoretic perspective, our architecture allows us to recover the true joint distribution as shown in section 3.1.
From an empirical perspective, we would like to reduce the influence of domain information in our generative model.
To generate images in each domain, the generator needs to utilize the input domain label u .
However, the influence of u can be very large if no constraint is applied.
If the influence of domain variable is unnecessarily large, the generator focuses on the domain variable u and pays little attention to the content variable z c .
As a consequence, the generated images in the tuple may lose correspondence (e.g., the generated animals have different poses on AFHQ dataset, Fig. 4).
An extreme case would be that the content is totally ignored by the generator.
So the generator still outputs images in different domains (because the input domain labels are different ) but all images in the same domain look the same (because the content variable z c is ignored) (e.g., the generated digits look the same on MNIST7 dataset, Fig. 4).
By contrast, we first use the simple transformation f u to inject the domain information into ϵ rather than concatenating it with ϵ .
Secondly, the sparsity loss L sparsity reduces the number of components affected by the domain label u .
Therefore, there are will only be necessary changes between the images in the generated tuples.
3. A PPLICATION : U NPAIRED I MAGE - TO -I MAGE T RANSLATION
Unpaired image-to-image translation aims to map input images to a target domain while preserving important content information.
This task can also be formulated as a joint distribution learning problem (Liu et al., 2017).
For example, given two domains x ( u 0 ) and x ( u 1 ) , image translation aims to learn a reasonable conditional distribution P θ ′
( x ( u 1 ) | x ( u 0 ) ) through a mapping function
F , which should be close to the true conditional P θ ( x ( u 1 )
| x ( u 0 ) ) .
Therefore, we can use our multi-domain image generation model to help find a proper conditional distribution.
The differences between two tasks are visualized in Figure.
We employ StarGAN-v2 (Choi et al., 2020) as our backbone method and other methods are also applicable.
StarGAN-v mainly consists of: the mapping function F , style encoder E .
The training loss is L stargan =
L adv + L cyc + L sty − λ div L div , where L adv , L cyc , L sty and L div are used for distribution matching , cycle consistency , style reconstruction and generation diversity , respectively.
For more details, we refer readers to the original paper or our appendix I.1.
After matching the marginal distributions, G ( ϵ , u ) allows us to sample meaningful tuples by changing the value of domain label u , e.g., ⟨ x ( u 0 )
=
G ( ϵ , u 0 ) , x ( u 1 ) =
G ( ϵ , u 1 ) ⟩ .
Then we can use them to further regularize the mapping function F as
[Equation]
where ˜ s
1 = E ( x ( u 1 ) , u 1 ) is the style code of domain u 1 .
Through L tuple , we are encouraging the mapping function F to reconstruct the corresponding image G ( ϵ , u 1 ) from the input image G ( ϵ , u 0 ) .
It means that the mapping function F is trained to preserve the correspondence between images of the generated tuples.
Since we are able to recover the true joint distribution, L tuple encourage the mapping function to produce the true conditional distribution, i.e., P θ ( x ( u 1 )
| x ( u 0 ) ) .
Our full objective for unpaired image translation is L translation =
L stargan + λ tuple L tuple , where λ tuple is the hyper-parameter to control the influence of our propose tuple regularization.
E XPERIMENTS
In this section, we first present results and analysis on multi-domain image generation task.
Then we provide the results on unpaired image translation.
4. M ULTI - DOMAIN I MAGE G ENERATION 4.1. E XPERIMENT S ETUP
Implementation We build our method based on the official pytorch implementation of StyleGAN2ADA (Karras et al., 2020a) and the hyper-parameters are selected automatically by the code.
We choose the deep sigmoid flow (DSF) (Huang et al., 2018a) to implement the domain transformation f u (Huang et al., 2018a) because DSF is designed to be component-wise strictly increasing.
We use the embedding of domain label to generate pseudo-parameters for the flow.
We only introduce one hyper-parameter: λ to control the sparsity of the mask.
We set λ = 0 .
1 for all experiments.
StyleGAN
[Equation]
ADA
[Equation]
Datasets We use five datasets to evaluate our method: CELEBA-HQ (Choi et al., 2020) contains female and male faces domains; AFHQ (Choi et al., 2020) contains 3 domains: cat, dog and wild life; ArtPhoto contains 4 domains: Cezanne, Monet, Photo and Ukiyoe; CelebA5 contains 5 domains:
Black Hair, Blonde Hair, Eyeglasses, Mustache and Pale Skin; MNIST7 contains 7 domains: blue, cyan, green, purple, red, white and yellow MNIST digits.
More information are in the appendix F.1.
Evaluation Metrics .
We evaluate our method using the Frechet inception distance (FID), which is a widely used metric for distribution divergence between the generated images and the real images.
lower FID is better.
As for the first four datasets, there is no pair data.
So, we use the domaininvariant perceptual distance (DIPD) to measure the semantic correspondence (Liu et al., 2019).
DIPD computes the distance between two instance-normalized Conv5 features of VGG network.
As
[Table]
[Figure]
F I D 
 F I D
[Figure]
for MNIST7, we have ground truth tuples, so we first compute inception features of images in the tuple, concatenate the features and reduce the dimension by variance thresholding.
Then we can compute the frechet distance between the features of ground truth and generated tuples.
We name it
Joint-FID as it computes the divergence between joint distributions.
Baselines .
Since our method is built on StyleGAN2-ADA (Karras et al., 2020a), we also run
StyleGAN2-ADA to verify the effectiveness of our introduced modules.
We also run the most recent conditional GAN model - TGAN
(Shahbazi et al., 2022).
TGAN observes that the result of conditional generation of StyleGAN2-ADA is unsatisfactory when the number of classes are large.
Therefore it starts as the unconditional StyeleGAN2-ADA and then gradually transits to the conditional training.
We reimplement CoGAN (Liu & Tuzel, 2016) based on the StyleGAN2-ADA architecture.
We let the generators share all synthesis blocks except the last one.
4.1. R ESULTS AND A NALYSIS
Comparison with Baselines We present the quantitative results in Table 3 and show samples generated by different methods in Fig. 4.
Images of each row are generated by the same Gaussian noise with different values of domain label u .
Our method achieves best FID on all datasets.
The significant improvement over StyleGAN2-ADA highlight the importance to consider the correspondence information across domains.
Our method also achieves lowest DIPD values on three datasets.
The low values of DIPD demonstrates that images in our method share more content than other methods.
In other words, our method is able to learn a proper joint distribution given only marginals.
The proposed sparsity loss reduces the influence of domain stably and help us avoid expensive hyper-parameter sweeping .
As we mentioned in section 3.2, a naive way to further reduce the influence of domain label u is to reducing the dimension of z s directly.
But the results can be sensitive to the dimension n s .
To verify this point, we sweep the n s in [256, 64,32,16,8,4] (and set λ = 0 ) and show the results in Fig. 5(a) (top two rows).
We observe that our sparsity constraint works well if λ is in the range [0,1], which is a common range for hyper-parameter.
However, tuning n s works well when n s = 16 , 32 .
We plot the valid number of ˆ z s by checking the value of the trainable mask m in
Fig.
5(a) (bottom left), it learns to decrease n s to around 50, which is close to the optimal values by tuning n s .
The samples in Fig. 5(b) also suggests that the generated tuples with sparsity loss share more content (when dim=32, it confuses between digit 3 and 5, second row).
The identifiability when the number of domain is small The identifiability of the latent variables requires 2 n s + 1 domains as shown in section 3.1.
Therefore, it would be interesting to see what happens when the number of domains is small.
We have shown that our method achieves the best result across different real world datasets in Table 3.
Now, we choose MNIST7 dataset and decrease the number of domains used in the training.
We show the results in Fig.
5 (a) (bottom right).
We only compute the Joint-FID of the first two domains to ensure the results are comparable.
We can observe a clear trend that the Joint-FID is improving as we increase the number of domains, which supports our theory.
We observe that the StyleGAN2-ADA achieves Joint-FID of 54 and our method achieves 22 when there are only 2 domains.
We also show the generated examples in Fig.5 (b), last panel.
StyleGAN2-ADA totally drops the correspondence between images in the generated tuples while our method is able to preserve the correspondence.
4. A PPLICATION : I MAGE - TO -I MAGE T RANSLATION
[Table]
MUNIT (Huang et al., 2018b)
[Table]
(Lee et al., 2018)
[Table]
MSGAN (Mao & Li, 2018)
[Table]
StarGAN-v2 (Choi et al., 2020)
[Table] [Table]
SmoothGAN (Liu et al., 2021)
[Table]
LETIT (Zhao & Chen, 2021)
[Table]
[Table]
StyleDis (Kim et al., 2022)
[Table]
Ours
[Table]
4.2. R ESULTS
We present the experiment setup in the appendix I.
We present the average results of 6 pairwise imageto-image translation tasks in Table 2.
We can observe significant improvements over StarGAN-V2 in both latent and reference based tasks.
The significant improvement of our method indicates that the generated tuples can help match the distribution as well as improving the diversity of the outputs.
We also visualize sample generated by StarGAN-V2 and our method in Fig.
We observe that our method generates higher quality images than StarGAN-V2 method.
We present more samples in the appendix I.
L IMITATION AND F UTURE W ORK
Our model is trained to learn the true joint distribution.
However, an essential assumption is that the content z c across domains are aligned.
For example, the female and male domains share the same human content.
For more complex data where the content are not aligned, our assumption may be violated.
For example, we find that Cezanne domain contains many fruit paintings while other domains contains landscape in the ArtPhoto dataset.
Although our method has achieved best quality as well as semantic correspondence compared to other methods, we still observe some failure cases.
As shown in Figure.
7, to match the distribution of Cezanne domain, the generator learns to generate the fruit painting (first column).
Although we can observe that our method still works on other three domains (the rest columns), we can observe content mismatch due to the unaligned training dataset.
Our proposed architecture may over-constrain the influence of domain label in this misalignment case.
We may also resort to some other quantitative measures of the influence to help address this challenging problem and we leave it as future work.
A E THICAL S TATEMENT
Generative models such as GAN used in our paper enable various applications and our model facilitates the technique and may reduce the manual labeling cost.
Unfortunately, as revealed by previous reports, it becomes easier to manipulate image data, such as the deepfakes.
In addition, the generative models may reveal the training data information.
How to address these negative impacts still remains an important problem.
All datasets we used are publicly available.
B R ELATED W ORK
Multi-domain Image Generation Conditional GAN aims to maximize the influence of conditioning variable to improve the diversity of the generated samples (Gong et al., 2019;
Brock et al., 2018;
Miyato & Koyama, 2018; Odena et al., 2017; Kang et al., 2021; Kang & Park, 2020; Tseng et al., 2021; Karras et al., 2020a; Miyato et al., 2018; Zhang et al., 2019a; Brock et al., 2018; Wu et al., 2019; Zhang et al., 2019b; Zhao et al., 2020).
Our task is also related to the conditional GAN problem if we regard the domain label as the conditioning information.
A major difference is that conditional
GAN mostly focusing on enlarging the influence of the condition class label and generate diverse images across classes (Kang et al., 2021) while our method is trying to reduce the influence of the condition domain label and generate meaningful tuples across domains.
Unpaired Image-to-Image Translation Image-to-image translation can also be viewed as a joint distribution learning problem between the source and the target image domain.
With pair data, pix2pix (Isola et al., 2017) applies conditional GAN to match the distribution of the target domain and penalize the distance of generated image to the ground truth image.
Unfortunately, paired data is usually difficult to collect.
Therefore, additional assumptions are made to address the unsupervised task, such as the cycle consistency (Zhu et al., 2017;
Kim et al., 2017; Yi et al., 2017; Choi et al., 2018; 2020; Liu et al., 2021; Kim et al., 2022), shared latent space (Liu et al., 2017; Huang et al., 2018b; Lee et al., 2018; Yu et al., 2019; Liu et al., 2018), mutual information maximization (Park et al., 2020; Han et al., 2021;
Wang et al., 2021; Cao et al., 2019).
We build our method based on
StarGAN-v2 (Choi et al., 2020), which relies on cycle consistency to preserve content.
C T HE G RAPHICAL M ODEL
To address the ill-posed problem, we assume the generation process follows following graphical model:
D P ROOF OF THE IDENTIFIABILITY OF LATENT VARIABLES
We show that the true content z c and style z s are identifiable in Lemma.
D. T HE IDENTIFIABILITY OF THE STYLE
We first provide the proof of the identifiability of the style variable z s .
Proof.
As we have matched marginal distributions P θ ′ (ˆ x | u ) =
P θ ( x | u ) , we have P (ˆ g (ˆ z ) | u ) =
P ( g ( z ) | u ) since ˆ x = ˆ g
ˆ z ) , x = g ( z ) .
Then we can apply same transformation ˆ g − 1 to the variables ˆ g (ˆ z ) and g ( z ) , which results in P (ˆ g − 1 ◦ ˆ g (ˆ z ) | u )
=
P (ˆ g − 1 ◦ g ( z ) | u ) ⇒ P
(ˆ z | u ) = P (
[Equation]
g − 1 ◦ g ( z ) | u ) .
We define h =
g − 1 ◦ ˆ g , then h −
= ˆ g − 1 ◦ g , we have
[Equation]
which suggests that h is the indeterminacy between the recovered latent variable ˆ z and the true latent z .
It is worth noting that we don’t need to assume that the dimension of z and x are same in order to compute the determinant of g − 1 .
We further define q u i = log P ( z i | u ) and ˆ q u i = log P
(ˆ z i | u ) .
With the conditional independence assumption in A2, we have
[Equation]
According to the change of variable rule, we can transform equation.
11 into
[Equation]
where J h − 1 is the absolute value of the determinant of the Jacobian matrix of h .
Since h is invertible and the input and output share the same number of dimension, we have
[Equation]
To simplify the notation, we define the following objects:
[Equation]
Differentiating Equation 12 twice w.r.t.
z k and z q where k, q ∈ [ n ] and k ̸ = q yields
[Equation]
Therefore, there are 2 n s + 1 equations corresponding to u = u 0 , . . .
, u 2 n s respectively.
We subtract equations associated with u 1 , . . .
, u 2 n s with the equation of u 0 , and we obtain the following 2 n s equations:
[Equation]
where j = 1 , . . .
2 n s .
Due to the invariance of ˜ z
c , we have P ( z c ) =
P ( z c | u ) .
Thus, we have η ′′ i (ˆ z i , u j ) =
η ′′
i (ˆ z i , u j ′ ) and
η ′ i (ˆ z i , u j ) =
η ′ i (ˆ z i , u j ′ ) , ∀ j, j ′ .
Hence only the style components i = n c + 1 , . . .
, n remain in the summation of each equation.
Under the linear independence condition in Assumption A3, the linear system is a 2 n s × 2 n s invertible.
Therefore, the only solution is h
i, ( k ) h
i, ( q ) = 0 and h ′′ i, ( k,q ) =
for i = n c + 1 , . . . , n and k, q ∈ [ n ] , k ̸ = q .
As h ( · ) is smooth over Z , its Jacobian can be written as:
[Equation]
Note that h ′ i, ( k ) h
i, ( q ) = 0 implies that for each i = n c + 1 , . . .
, n , h ′ i, ( k ) ̸
= 0 for at most one element k ∈ [ n ] .
Therefore, there is only at most one non-zero entry in each row indexed by i = n c +1 , . . .
, n in the Jacobian matrix J h − 1 .
Further, the invertibility of h ( · ) necessitates J h − 1 to be full-rank which implies that there is exactly one non-zero component in each row of matrices C and D .
Since for every i ∈ { n c + 1 , . . . , n } , ˆ z i has changing distributions over u and all z k ’s for i ∈ { 1 , . . . , n c } (i.e. z c ) have invariant distributions over u , we can deduce that C = 0 and the only non-zero entry ˆ z
i
z
k must reside in D with k ∈ { n c + 1 , . .
. , n } .
Therefore, for each estimated variable in the changing part ˆ z
i , i ∈ { n c + 1 , . . . , n } , there exists one true variable in the changing part z k , k ∈ { n c + 1 , . . . , n } such that ˆ z i
=
h ′ i ( z k ) .
Further, because J h − 1 is of full-rank ( h ( · ) being invertible) and C is a zero matrix, D must be of full-rank, which implies that h ′ i ( · ) is invertible for each i ∈ { n c + 1 , . . . , n } .
Thus, the changing components z s are identified up to permutation and component-wise invertible transformations.
D.
[Equation]
HE IDENTIFIABILITY OF THE CONTENT VARIABLE
Now we provide the proof for the block-identifiability of the content variable z c .
Proof.
The proof is presented in four steps as follows.
Step 1.
Due to assumption of the data generating process of the learned model, we can obtain the independence between the generating process ˆ z c and u .
Thus, it follows that for any
A z c ⊆
Z c ,
[Equation]
where ˆ g − 1 1: n c : X → Z c denotes the estimated transformation from the observation to the content variable and (ˆ g − 1 1: n c ) − 1 ( A z c ) ⊆
X is the pre-image set of A z c .
On account of the matching assumption, we are able to extend Equation 16 as follows:
[Equation]
Because g and ˆ g are smooth and injective, there exists a smooth and injective h
=
ˆ g − 1 ◦ g : Z → Z .
Expressing ˆ g − 1 = h ◦ g − 1 and h c ( · ) :
=
h 1: n c ( · ) :
Z → Z c in Equation 17 yields
[Equation]
⇐⇒
[Equation]
where h − 1 c ( A z c ) = { z ∈ Z : h c ( z ) ∈
A z c } is the pre-image of A z c , i.e. those latent variables containing content variables in A z c after the indeterminacy transformation h .
Based on the generating process, we can re-write Equation 18 as follows:
∀
A z c ⊆
Z c ,
[Equation]
Step 2.
In this step, we prove that z c :=
h c ([ z ⊤ c , z ⊤ s ] ⊤ ) does not depend on z s .
To this end, we first develop an equivalent statement (i.e. Statement 3 below) and prove it subsequently.
This enables us to leverage the full-supported density function assumption to avert technical issues.
• Statement 1: h c ([ z ⊤ c , z ⊤ s ] ⊤ ) does not depend on z s .
• Statement 2: ∀ z c ∈ Z c
, it follows that h − 1 c ( z c ) =
B
z c × Z s where B z c ̸ = ∅ and B z c ⊆
Z c .
• Statement 3: ∀ z c ∈ Z c , r ∈ R
+ , it follows that h − 1 c ( B r ( z c )) =
B + z c
×Z s where B r ( z c ) :
= { z ′ c ∈
Z c : || z ′ c − z c || 2 < r } , ¯ B z c ̸ = ∅ , and B + z c ⊆
Z c .
Statement 2 is a mathematical formulation of Statement 1.
Statement 3 generalizes singletons z c in
Statement 2 to open, non-empty balls B r ( z c ) .
Later, we show that under this generalization, ¯ B z c is necessarily of probability measure greater than 0 .
With this, we can proceed to show its contraction to Equation 19.
Leveraging the continuity of h c ( · ) , we show the equivalence between Statement 2 and
Statement 3 as follows.
We first show that Statement 2 implies Statement 3.
∀
z c ∈ Z c , r ∈ R + , h − 1 c (( B r ( z c )))
= ∪ z ′ c ∈B r ( z c ) h − 1 c ( z ′ c ) .
Statement 2 indicates that every participating sets in the union satisfies h − 1 c ( z ′ c )
=
B ′
z c × Z s , thus the union h − 1 c (( B r ( z c ))) also satisfies this property, which is Statement 3.
Then, we show that Statement 3 implies Statement 2 by contradiction.
Suppose that Statementis false, then ∃ ˆ z c ∈ Z c such that there exist ˆ z Bc ∈ { z 1: n c : z ∈ h − 1 c (ˆ z c ) } and ˆ z
Bs ∈
Z s resulting in h c (ˆ z B ) ̸
= ˆ z c where ˆ z B =
[(ˆ z Bc ) ⊤ , (ˆ z Bs )
⊤ ] ⊤ .
As h c ( · ) is continuous, there exists ˆ r ∈ R + such that h c (ˆ z B ) ̸∈ B
ˆ r
(ˆ z c ) .
That is, ˆ z B ̸∈ h − 1 c ( B ˆ r
(ˆ z c )) .
On the other hand, Statement 3 suggests that h − 1 c ( B ˆ r
(ˆ z c )) =
ˆ B z c × Z s .
By definition of ˆ z B , it is clear that ˆ z B 1: n c ∈
ˆ B z c .
However, the fact that ˆ z B ̸∈ h − 1 c ( B ˆ r (ˆ z c )) contradicts Statement 3.
Therefore, Statement 2 is true under the premise of Statement 3.
We have shown that Statement 3 implies Statement 2.
Consequently, Statement 2 and Statement 3 are equivalent, and therefore proving Statement 3 suffices to show Statement 1.
Step 3.
In this step, we prove Statement 3 by contradiction.
Intuitively, we show that if h c ( · ) depended on ˆ z s , the pre-image h − 1 c ( B r ( z c )) could be partitioned into two parts (i.e. B ∗ z and h − 1 c ( A ∗ z c ) \ B ∗ z defined below).
The dependency between h c ( · ) and ˆ z s is characterized by B ∗ z , which would not emerge otherwise.
In contrast, h − 1 c ( A ∗ z c ) \ B ∗ z also exists when h c ( · ) does not depend on ˆ z s .
We evaluate the invariance relation Equation 19 and show that the integral over h − 1 c ( A ∗ z c ) \ B ∗ z (i.e. T 1 ) is always 0 , however, the integral over B ∗ z (i.e. T 2 ) is necessarily non-zero, which leads to the contraction with Equation 19 and thus shows the h c ( · ) cannot depend on ˆ z s .
First, note that because B r ( z c ) is open and h c ( · ) is continuous, the pre-image h − 1 c ( B r ( z c )) is open.
In addition, the continuity of h ( · ) and the matched observation distributions ∀ u ′ ∈ U , { x ∈ A x }|{ u = u ′ } =
{ ˆ x ∈ A x }|{ u = u ′ } lead to h ( · ) being bijection as shown in (Klindt et al.
, 2020b),which implies that h − 1 c ( B r ( z c )) is non-empty.
Hence, h − 1 c ( B r ( z c )) is both non-empty and open.
Suppose that ∃ A ∗ z c := B r ∗ ( z ∗ c ) where z ∗ c ∈ Z c , r ∗ ∈ R + , such that
B ∗ z := { z ∈ Z : z ∈ h − 1 c ( A ∗ z c ) , { z 1: n c } ×
Z s ̸⊆ h − 1 c ( A ∗ z c ) } ̸ = ∅ .
Intuitively, B ∗ z contains the partition of the pre-image h − 1 c ( A ∗ z c ) that the style part z n c +1: n cannot take on any value in Z s .
Only certain values of the style part were able to produce specific outputs of indeterminacy h c ( · ) .
Clearly, this would suggest that h c ( · ) depends on z c .
To show contraction with Equation 19, we evaluate the LHS of Equation 19 with such a A ∗ z c :
[Equation]
We first look at the value of T 1 .
When h − 1 c ( A ∗ z c ) \ B ∗ z = ∅ , T 1 evaluates to 0 .
Otherwise, by definition we can rewrite h − 1 c ( A ∗ z c ) \ B ∗ z as C ∗ z
c × Z s where C ∗
z
c ̸ = ∅ and C ∗ z c ⊂ Z c .
With this expression, it follows that
[Equation]
Therefore, in both cases T 1 evaluates to 0 for A ∗ z c .
Now, we address T 2 .
As discussed above, h − 1 c ( A ∗ z c ) is open and non-empty.
Because of the continuity of h c ( · ) , ∀ z B ∈ B ∗ z , there exists r ( z B ) ∈ R + such that B r ( z B ) ( z B ) ⊆
B ∗ z .
As p z | u ( z | u ) > 0 over ( z , u ) , we have { z ∈ B ∗ z }|{ u = u ′ } ≥ { z ∈ B r ( z B ) ( z B ) |{ u = u ′ }} > 0 for any u ′ ∈ U .
Assumption A4 indicates that ∃ u ∗ 1 , u ∗ 2 , such that
[Equation]
Therefore, for such A ∗ z c , we would have T 1 + T 2 ̸ = 0 which leads to contradiction with Equation 19.
We have proved by contradiction that Statement 3 is true and hence Statement 1 holds, that is, h c ( · ) does not depend on the style variable z s .
Step 4.
With the knowledge that h c ( · ) does not depend on the style variable z s , we now show that there exists an invertible mapping between the true content variable z c and the estimated version ˆ z c .
As h ( · ) is smooth over Z , its Jacobian can written as:
[Equation]
where we use notation ˆ z c = h ( z ) 1: n c and ˆ z s = h ( z ) n c +1: n .
As we have shown that ˆ z c does not depend on the style variable z s , it follows B = 0 .
On the other hand, as h ( · ) is invertible over Z , J h is non-singular.
Therefore, A must be non-singular due to B = 0 .
Note that A is the Jacobian of the function h ′ c ( z c ) :
= h c ( z ) :
Z c → Z c , which takes only the content part z c of the input z into h c .
Also, note that the result of Theorem 3.1 implies that C = 0 .
Together with the invertibility of h , we can conclude that h ′ c is invertible.
Therefore, there exists an invertible function h ′ c between the estimated and the true content variables such that ˆ z c = h ′ c ( z c ) , which concludes the proof that z c is block-identifiable via ˆ g − 1 ( · ) .
E P ROOF OF THE IDENTIFIABILITY OF TRUE JOINT DISTRIBUTION
In this section, we provide the proof of theorem 3.2.
Proof.
Two domains We consider the case of two variables first, i.e., we prove that P θ ′ ( x (1) , x (2) ) =
P θ ( x (1) , x (2) ) .
We factorize the joint distribution P ( x (1) , x (2) )
=
P ( x (1) ) P ( x (2) | x (1) ) .
Since we have matched the marginal distributions for each domain, we already have P θ ′
( x (1) )
=
P θ ( x (1) ) .
So we now only need to prove P θ ′
( x (
[Equation] [Equation]
Given x = g ( z c , z s ) , we can identify the style and content through the inverse of the model, i.e., ˆ z c , ˆ z s =
ˆ g − 1 ( x ) .
According to lemma.
3.1, we have h c ( z c ) =
ˆ z c and h s ( z s )
=
ˆ z s , where h c is an invertible transformation and h s is component-wise invertible transformation.
Therefore, we have
[Equation] [Equation]
For the ease of notation, we denote c =
z c , s =
z s .
Given a pair of images ⟨ x (1) , x (2) ⟩ sampled from the true joint distribution, we have
[Equation]
Since we assume that the domain specific transformation is component-wise monotonic f u , f u is component-wise invertible.
We denote f 1 = f u =1 , f 2 = f u =2 , then we have
[Equation]
Similarly, the learned model ˆ f u is also component-wise invertible, we also have
[Equation] [Equation]
Given x (1) in the first domain, we have
[Equation]
Then we have
[Equation]
We now prove that ˆ s (2) is a function of the true s (2) .
According to our lemma, the function between ˆ s (2) and s (2) can only be h s .
Therefore, we have ˆ s (2) =
h s ( s (2) ) .
Then the output generated by our learned model with parameter θ ′ is
[Equation]
The results show that given a input x (1) , our learned generative model with parameter θ ′ outputs the same result as the true generative model with parameter θ .
In other words, P θ ′ ( x (2) | x (1) ) =
P θ ( x (2) | x (1) ) .
Generalization of the result with mathematical induction So far, we have proved that
[Equation]
=
P θ ( x (1) , x (2) ) .
Now we generalize the results into more domains with mathematical induction on the number of domains.
• Base Case When the number of domains is 2, we have proved that P θ ′
( x (1) , x (2) ) =
P θ ( x (1) , x (2) ) .
• Inductive Step
Suppose the true joint distribution is identifiable when the number of domains is d − 1 , i.e., P θ ′ ( x (1) , ..., x ( d − 1) )
=
P θ ( x (1) , ..., x ( d − 1) ) , now we prove that the true joint distribution is still identifiable when the number of domains is d , i.e., P θ ′ ( x (1) , ..., x ( d ) )
=
P θ ( x (1) , ..., x ( d ) ) .
In fact, we only need to prove
P
[Equation]
according to the induction assumption.
P
[Equation]
, ..., ) , we apply the invertible function g −
[Equation] [Equation]
[Equation]
)) , we apply the invertible transformations f −
[Equation]
[Equation] [Equation]
[Equation]
We can find that it becomes the two domain case, i.e., we just need to prove P θ ′ ( x ( d ) | x (1) ) =
P θ ( x ( d ) | x (1) ) , which already holds according to our results in two domains.
Therefore, the true joint distribution is identifiable.
F M ULTI -D OMAIN I MAGE G ENERATION F. D ATASET
We use five datasets to verify our model
• CELEBA-HQ (Choi et al., 2020) contains 2 domain: female and male.
We also use the training set to train our model.
Female domain contains 17943 images and male domain contains 10057 images.
We train the model at resolution 256 × 256.
• AFHQ (Choi et al., 2020) contains 3 domains: cat, dog and wild life (e
g., foxes, tigers and lions).
We use the training set to train our conditional GAN model.
Three domains contain 5153, 4739, 4738 images, respectively.
We train the model at resolution 256 × 256 .
• ArtPhoto contains 4 domains: Monet, Cezanne, Ukiyoe paintings and real photos (Zhu et al., 2017).
• CelebA5 contains 5 domains: Black Hair, Blonde Hair, Eyeglasses, Mustache and Pale Skin.
They are subsets of domain CelebA
(Liu et al., 2015).
We train them at 64 × 64 resolution.
• MNIST7 contains 7 domains: blue, cyan, green, purple, red, white and yellow MNIST digits.
We generate these digits using the training MNIST dataset (LeCun et al., 1998).
We train the model at resolution 32 × 32.
F. M ORE R ESULTS
We now provide more results of multi-domain image generation
. F. T -SNE OF REAL AND GENERATED SAMPLE G T WO V ERSIONS OF MASK MECHANISM
In our main paper, we propose to use z s = ϵ
+ m ⊙ f u ( ϵ ) to encourage the network select the optimal dimension of n s automatically.
Another possible version would be z 2 s =
(1 − m 2 ) ⊙ ϵ + m 2 ⊙ f u ( ϵ ) .
[Table]
The two versions are actually equivalent up to scale transformation, z (2) s
[Equation]
) can be reformulated as
[Equation]
For example, z
[Equation]
=
[Equation]
5 ϵ
[Equation]
5 f u ( ϵ ) when m 2 = 0 .
In our case, if m = 1 , we have z s =
ϵ
+ m ⊙ f u ( ϵ ) =
2 z (2) s .
There is a main implementation-related reason why we choose the first version: if we choose the second version, we have to wrap m as a value inside [0,1].
A common way is to use sigmoid function.
However, sigmoid is known for gradient vanishing (the gradient is very small when input is far from 0).
So, our sparsity penalty and the GAN loss may have little effect on the sigmoid mask, which leaves the influence of domain very large.
To testify the claim, we run experiments on AFHQ and CELEBA-HQ dataset with two versions in Table.
We set λ = 0 .
[Table]
MNIST
[Equation]
Version
[Equation]
[Table] [Table]
[Equation]
[Table]
[Table] [Table]
[Figure]
Ours
H T HE NECESSITY OF THE MASK MECHANISM I U NPAIRED I MAGE - TO -I MAGE T RANSLATION I. D ETAILS ABOUT S TAR GAN-V
As mentioned in section 3.3, we build our method based on StarGAN-V2 Choi et al.
Now we provide more details about the method.
StarGAN-v2 consists of four modules: mapping network
H ( ., . ) , style encoder E ( ., . ) , the shared generator F and the discriminator D .
The training loss is
[Equation]
35) where L adv , L cyc , L sty and L div are used for distribution matching , cycle consistency , style reconstruction and generation diversity , respectively.
StarGAN-V2 supports two kinds of tasks: latentbased image translation and reference-based image translation.
Given an input image, latent-based generates the style code ˜ s from the random noise ϵ with the mapping network H , i.e., ˜ s
= H ( ϵ, y ) ,
[Figure]
CoGAN λ
=λ =
[Figure]
[Figure]
CoGAN λ =λ
= 0 .
CoGAN and TGAN are slightly better in preserving but
StyleGAN2-ADA
TGAN
CoGAN λ =λ
= 0 .
[Figure] [Figure]
[Figure] [Figure]
where y is the target domain label.
As for the reference based, the style is extracted from an image xin
the target domain y , i.e., ˜ s
= E ( x 2 , y ) .
The shared generator takes an input image x
and the style code ˜ s and outputs an image from the domain y .
StarGAN-V2 concatenates multiple domain specific heads for each domain and we denote it as D y for domain y .
[Equation]
performs adversarial training between the generator and the discriminator.
[Equation]
37) encourages the network F contains the style information of ˜ s .
[Equation]
which encourages two output images to be different by maximizing this loss.
The final one is the cycle consistency (Zhu et al., 2017),
[Equation]
39) which encourages the network F to reconstruct the input from the translated one.
In other words, it encourages the mapping to be one-to-one.
I. O UR TUPLE LOSS
However, as shown in previous literature (Alami Mejjati et al., 2018; Kim et al., 2019), the cycle consistency is not enough and can still leads to large content distortion.
Hence, we introduce our loss
[Equation]
where G ( ϵ, u 0 ) , G ( ϵ, u 1 ) are pair data generated by our multi-domain image generation model.
As proved in section E, the tuples can be viewed as sampling from the true joint distribution.
Therefore, we are using L tuple to encourage the mapping network F to recover the second image from the first image.
In other words, by minimizing this tuple loss, the network F learns the correspondence relationship between our method.
Therefore, our tuple loss helps further regularize the mapping network F and avoid large content distortion.
I.2. S ETUP
Implementation We build on the official pytorch implementation of StarGAN-V2 (Choi et al., 2018).
We set λ tuple to 0.1.
We add our regularization loss in the every latent and reference iteration.
Datasets and Metrics .
We use the benchmark AFHQ dataset (Choi et al., 2020) for image-to-image translation.
It consists of three domains as stated before.
Unlike the image generation task, we now have 6 pair-wise image-to-image translation tasks since we have 3 domains: cat → dog, cat → wild, dog → cat, dog → wild, wild → cat and wild → dog.
We use the benchmark metrics: FID and LPIPS.
Baselines .
We compare the results with MUNIT (Huang et al., 2018b), DRIT (Lee et al., 2018),
MSGAN (Mao et al., 2019) and recent methods StarGAN-V2 (Choi et al., 2020), SmoothGAN (Liu et al., 2021), LETIT (Zhao & Chen, 2021) and StyleDis (Kim et al., 2022).
We cite the results of
MUNIT, DRIT, MSGAN and StarGAN-v2 from (Choi et al., 2020).
StyleDis only reports the FID of reference based task.
But it doesn’t support the latent-based generation defined in StarGAN-v2.