Information-Theoretic GAN Compression with Variational Energy-based Model
Abstract
We propose an information-theoretic knowledge distillation approach for the compression of generative adversarial networks, which aims to maximize the mutual information between teacher and student networks via a variational optimization based on an energy-based model.
Because the direct computation of the mutual information in continuous domains is intractable, our approach alternatively optimizes the student network by maximizing the variational lower bound of the mutual information.
To achieve a tight lower bound, we introduce an energy-based model relying on a deep neural network to represent a ﬂexible variational distribution that deals with high-dimensional images and consider spatial dependencies between pixels, effectively.
Since the proposed method is a generic optimization algorithm, it can be conveniently incorporated into arbitrary generative adversarial networks and even dense prediction networks, e.g., image enhancement models.
We demonstrate that the proposed algorithm achieves outstanding performance in model compression of generative adversarial networks consistently when combined with several existing models.
Introduction
Generative adversarial networks (GANs) [1] have accomplished impressive achievements on various computer vision tasks including image synthesis [2–5], image-to-image translation [6–9], video prediction [10–12], and many others.
However, despite the outstanding performance, their applicability to resource-hungry systems, e g ., edge or mobile devices, is limited due to high computational costs.
To deal with this issue, GAN compression, a task reducing the size of generator networks, has recently drawn the attention of many machine learning researchers.
The straightforward way to compress generators is to directly employ traditional network compression techniques such as low-rank approximation [13–15], network quantization [16–19], pruning [20– 25], and knowledge distillation [26–30].
However, the compression of generative models typically involves a higher-dimensional output space and requires matching the output distributions between the original and compressed models instead of the output instances given by the two models.
Hence, as reported in [31–33], the synthesized images obtained from the compressed generators via the channel pruning [34, 23, 24] are often suboptimal—producing images with artifacts and suffering from image quality degradation, which implies that a naïve application of the methods designed for discriminative models is not effective for GAN compressions.
Existing approaches for compressing GANs [31, 35, 32, 36–38, 33, 39] often utilize knowledge distillation and manage to achieve competitive accuracy of student models.
Speciﬁcally, these methods transfer the knowledge of a teacher network to a student model via intermediate representations, ﬁnal outputs, and embedded features [40, 41].
To this end, the existing algorithms employ (cid:96) 1 or (cid:96)norms to compute the difference between the representations of the two networks, but they are not necessarily effective for minimizing the distance between the two distributions.
We propose to compress GAN models by maximizing the mutual information for knowledge distillation between the outputs of a teacher and a student.
For the compression of generative models, the use of the mutual information between two random variables makes more sense than the direct pixel-wise comparison between two outputs, which is the standard way to transfer knowledge from a teacher to a student in discriminative models.
However, because the computation of the mutual information is generally intractable in the continuous domain, we employ a variational approach [42], where the lower bound of the mutual information is alternatively optimized using a variational distribution, an approximation for the conditional distribution of the teacher output given the student output.
We further adopt an energy-based model for the ﬂexible representation of the variational distribution and tighten the lower bound for effective knowledge transfer.
Note that the proposed energy-based model is a convenient way to deal with high-dimensional data (images) and an effective tool to handle spatial dependency between pixels within an image.
Combined with the existing approaches, our framework achieves substantial performance improvement on GAN compression tasks.
The main contributions of our work are summarized below:
• We propose a novel energy-based framework of GAN compression for knowledge distillation, which maximizes the mutual information between a teacher and a student.
• The proposed energy-based approach is effective for representing a ﬂexible variational distribution and can be incorporated into many GAN compression methods thanks to its generality.
• Experimental results verify that the proposed method improves performance consistently when combined with the existing methods.
The rest of the paper is organized as follows.
Section 2 discusses the related work to GAN compression.
The details of our approach are described in Section 3 and 4, and the experimental results are presented in Section 5.
Finally, we conclude this paper in Section 6.
Related Work 2.1 Generative Adversarial Networks
Generative Adversarial Networks (GANs) [1] consist of two components, a generator and a discriminator, and train the models using an adversarial loss; the generator aims to fool the discriminator by synthesizing realistic images from random noise samples while the discriminator attempts to distinguish the real data from the fake ones.
Unlike the vanilla GANs, conditional GANs [43, 6, 7] can control the image generation conditioned on inputs such as a class label [43] or an image translated into another image [6, 7] ( e . g ., Horse → Zebra).
The conditional GANs are not conﬁned to the conditional image generation tasks, but applied to various areas such as super-resolution [44], text-to-image [45], and image inpainting [46].
Since the size of the conditional GANs is typically large in terms of FLOPs, the proposed GAN compression algorithm is mainly tested on them but we also verify the effectiveness of our approach on the unconditional counterpart.
2.2 Knowledge Distillation
Knowledge distillation techniques aim to transfer knowledge from a powerful network ( i .
e ., teacher) to a compact network ( i .
e ., student) by matching logits [47], output distributions [26], intermediate activations [48], or attention maps [27].
Speciﬁcally, Hinton et al .
[26] learn the representation of the student by minimizing the relative entropy from its normalized softmax output to the teacher’s one while [47, 48] minimize the mean squared error between the representations of the teacher and student networks.
Both Variational Information Distillation (VID) [49] and Contrastive Representation Distillation (CRD) [50] employ the mutual information between the teacher and student to estimate the similarity of the representations from the two networks.
The former relies on a variational approach [42] for the tractable computation of mutual information between the two networks.
On the other hand, the latter derives an InfoNCE [51]-like loss function from the lower bound of the mutual information to learn the representation of the student.
However, VID maximizes the variational lower bound using a strong assumption about the variational distribution, a fully factorized Gaussian distribution, and CRD is difﬁcult to be employed to generative models due to its contrastive learning objective, which is prone to be trivial in image generation tasks without semantic attribute annotations, e .
g ., class labels.
Our algorithm is related to VID and CRD since they all attempt to maximize the mutual information between the teacher and student networks, but has clear advantage over them in terms of the ﬂexibility of the variational distribution and the applicability to generative models.
2.3 GAN Compression
GAN compression algorithms typically target to reduce the size of the generator without considering that of the discriminator since it is not employed for inference.
Co-Evolution [31] utilizes an evolutionary algorithm [52] to reduce the channel size in the generator of CycleGAN [7] based on a ﬁtness formulated based on FLOPs and the mean squared reconstruction error between the original uncompressed and pruned generators.
GAN-Compression [35] employs a once-for-all network training scheme [53] combined with the reconstruction loss as well as the intermediate feature distillation loss [48], and selects the best performing subnetwork given a target budget.
Compression and Teaching (CAT)
[38] designs an efﬁcient building block for the generator, and prunes the network using the magnitude-based channel pruning method [24] while maximizing the similarity between the two networks based on centered kernel alignment [54].
Content-Aware GAN Compression (CAGC)
[33] uses the feature distillation and reconstruction loss based only on the object part of the generated image while additionally considering LPIPS [41] as a perceptual distance for the synthesized one.
On the contrary, Online Multi-Granularity Distillation (OMGD) [39] iteratively trains teacher networks with original conditional GAN objectives and a student network using the total variation loss [55] for spatial smoothness and a distillation loss that makes the student mimic the ﬁnal outputs and channel-wise attention weights for the intermediate feature maps of the teacher networks.
Generator-discriminator Cooperative Compression (GCC) [56] also adopts the online distillation scheme while selecting channels in the original discriminator to match the reduced capacity of the student generator at each iteration.
To validate the effectiveness of our framework, we present how the proposed algorithm can improve performance via the combinations with existing methods such as GCC, OMGD, CAGC, CAT, and GAN-Compression.
Variational GAN Compression with Energy-based Model
Our goal is to compress generators in GANs through knowledge distillation.
Let S and T be random variables of the outputs from a student, G s ( · ; φ s ) :
X → Y and a teacher, G t ( · ; φ t ) :
X → Y , respectively, where φ s and φ t are their model parameters.
For knowledge transfer from the teacher to the student, we maximize the mutual information between T and S , I ( T ; S ) , which is given by
[Equation]
where D KL ( ·||· ) denotes the Kullback-Leibler (KL) divergence and H ( · ) means the entropy function.
Note that all the expectations are taken over the joint data distribution, p ( t , s ) , where t and s indicate realizations of the teacher and student output distributions, respectively.
A practical challenge in this objective is that the computation of the mutual information for multivariate continuous random variables is typically intractable.
To tackle this issue, we adopt a variational method [42], where we derive the lower bound of the mutual information, ˜ I
( T ; S ) , using a variational distribution, q ( t | s ) , which is given by
[Equation]
To maximize the mutual information, we increase the lower bound by minimizing the KL-divergence between the true and variational distributions, which is deﬁned as
[Equation]
Variational Information Distillation (VID) [49] optimizes the variational lower bound by employing the fully factorized Gaussian distribution as the variational distribution q ( t | s ) .
However, as noted in [57], the statistics of the natural images usually exhibit non-Gaussian properties.
Furthermore, optimizing the lower bound using the fully factorized distribution encourages the student to generate blurry outputs [58, 46, 59].
To the contrary, we employ an energy-based model as a ﬂexible distribution for the variational distribution, which is given by
[Equation]
where E θ ( t , s ) :
Y × Y → R is the energy function deﬁned by a deep neural network parametrized with θ and Z θ ( s ) is the partition function.
The variational distribution given by the energy-based model is effective for the student model to maximize the variational lower bound.
In addition, differentiated from VID [49], our approach employs the variational distribution that considers the spatial dependency among pixels in t and s .
Overall, we optimize the energy-based model, the student network, and the teacher network, which is achieved by the following iterative procedure:
Fix { φ s , φ t } and optimize θ .
Under the ﬁxed parameters { φ s , φ t } , minimize the objective in (3) with respect to θ .
Fix { θ, φ t } and optimize φ s .
Under the ﬁxed parameters { θ, φ t } , maximize the objective in (2) while minimizing the standard knowledge distillation losses with respect to φ s
Optimize φ t .
Minimize the standard conditional GAN loss [6, 7] with respect to φ t using a training dataset.
This step is only required for online knowledge distillation.
Otherwise, the teacher model should be learned ofﬂine in advance.
These three steps are repeated until convergence.
Training Procedures
This section describes the optimization procedure of our approach for knowledge distillation, which iteratively maximizes the mutual information between a teacher and a student using the energy-based model.
4.1 Optimization of Energy-based Model
The ﬁrst step of the iterative procedure is the optimization of the energy-based model for minimizing E s [ D KL ( p ( t | s ) ||
q θ ( t | s ))] with respect to θ given the ﬁxed model parameters { φ s , φ t } .
4.1.1 Objective
Since the conditional data distribution p ( t | s ) is constant with respect to the model parameter θ , the energy-based model minimizes the following objective:
[Equation]
To optimize the energy-based model using the standard stochastic gradient descent method, we derive the gradient of the objective in (5), which is given by
[Equation] [Equation]
where the second expectation of the right-hand side requires sampling from q θ ( t | s ) via a Markov Chain Monte Carlo (MCMC) method, for example, Gibbs sampling.
[Figure] 4.1.2 Improved MCMC sampling
The main drawback of the MCMC methods is the high computational cost, so we rely on the Langevin dynamics, which leads to the following recursive sample generation:
[Equation]
where w k is a sample drawn from N (0 , λI ) and λ is a ﬁxed step size.
Theoretically, ˜ t k becomes identical to a sample drawn from q θ ( t | s ) as k → ∞ and λ → 0 [60].
Following Short-Run
MCMC [61], we also run K -step MCMC starting from an initial distribution, q 0 , to approximate samples from q θ ( t | s ) , where K is the number of MCMC steps.
4.1.3 Initial distribution
We initialize ˜ t 0 as the output of the student network for the acceleration of the MCMC optimization via the Langevin sampling process.
This initialization is a good approximation to the model distribution; intuitively, since the student model is supposed to mimic the samples drawn from the data distribution, the optimization of q θ ( t | s ) towards the data distribution p ( t | s ) from the current student output would be more efﬁcient.
As a result, the proposed initialization strategy often results in improved performance of student models compared to the existing methods [61–65] even with a small number of MCMC steps.
On the contrary, we can naturally adopt the data distributions of teacher networks, which are static in Contrastive Divergence (CD) [62] and dynamic in Persistent Contrastive Divergence (PCD) [63, 64], for setting q 0 while Short-Run MCMC [61] can initialize the variational distribution using the uniform noise distribution.
Since the data distribution is prone to induce bias in the CD estimate [65] and the random uniform distribution is far from the data distribution, the existing methods require many steps of MCMC and consequently increase training time [61].
In addition, PCD updates all samples in the memory buffer, which leads to signiﬁcantly increased memory overhead especially for generation tasks.
4.1.4 Inference
In contrast to the previous approaches for energy-based models [61, 65, 64], we do not require any
MCMC sampling for inference but generate images via a single forward process of the student generator.
Therefore, the proposed algorithm incurs no extra computational cost at inference time.
4.2 Optimization of Student Generator 4.2.1 Loss for mutual information
The student generator learns to maximize the variational lower bound ˜
I ( T ; S ) in (2) with respect to φ s , where the objective function is formally given by
[Equation]
[Table] and the objective is equivalent to maximize the expected log likelihood as shown in the above equation.
Since the joint distribution p ( t , s ) depends on φ s , we employ a reparameterization trick using the function G s .
Then, the gradient of the objective function in (8) with respect to φ s is derived as follows:
[Equation]
Note that we do not need to run MCMC additionally to obtain the samples from q θ ( t | G sφ s ( x )) because they are already available from the training procedure for the energy-based model.
Figure 1 illustrates the overview of our framework for maximizing the mutual information.
4.2.2 Algorithm-speciﬁc loss
The proposed variational lower bound maximization framework using the energy-based model is incorporated into knowledge distillation methods such as OMGD [39], GCC [56], GAN-Compression [35],
CAT [38], and CAGC [33].
The brief descriptions about these methods are presented in Section 2.3, and we discuss the details of the algorithm-speciﬁc losses in the supplementary document.
4.2.3 Combined loss
The full objective function for the student network is given by
[Equation]
(10) where L algo is the algorithm-speciﬁc loss and ˜ I
( T ; S ) is the variational lower bound deﬁned in (8) while λ MI is a hyperparameter balancing the two terms.
4.3 Optimization of Teacher Generator
The teacher generator is trained by the standard method of the corresponding GAN algorithm, e . g .,
Pix2Pix [6] and CycleGAN [7]. Optionally, the teacher model learns to minimize the (cid:96) 1 distance between the generated image and the ground-truth when the ground-truth is available.
In the case of the unsupervised image-to-image translation tasks, the cycle consistency loss [7] based on the (cid:96)distance may enforce the instance mapping between two domains.
To sum up, the teacher network is optimized by the adversarial loss, denoted by the GAN loss, L GAN , and the reconstruction loss, L 1 , as follows:
[Equation]
(11) where λ 1 is a hyperparameter to balance the two loss terms.
Note that, for unconditional GANs, there is nothing to reconstruct and we train the network based only on the GAN loss. [Table] [Table]
Experiments
To validate the effectiveness of the proposed compression algorithm based on the variational energybased model [Table] denoted by VEM [Table]
we conduct extensive experiments on the standard datasets using various architectures.
5.1 Datasets and Models
Image-to-image translation We adopt Pix2Pix [6] on Edges → Shoes [67] and Cityscapes [68] datasets while taking CycleGAN [7] on Horse → Zebra [7] and Summer → Winter [7].
Note that
Pix2Pix is the image-to-image translation network for paired datasets while CycleGAN is mainly proposed for unpaired image-to-image translation tasks.
Following the original models [6, 7], we employ a U-Net-based generator [69] for Pix2Pix and a ResNet-based generator [70] for CycleGAN.
For all the datasets, images are resized to 256 × 256 before feeding them into the models.
Image generation To evaluate the performance of our approach for unconditional GANs, we employ StyleGAN2 [66] on Flickr-Faces-HQ (FFHQ) [71] and Self-Attention GAN (SAGAN) [4] on CelebA [72].
For image preprocessing, we resize images to 64 × 64 for CelebA and 256 ×for FFHQ.
5.2 Evaluation Metrics
Following the protocol of the previous approaches, we report Fréchet Inception Distance (FID) [73] scores on Edges → Shoes, Horse → Zebra, Summer →
Winter, CelebA, and FFHQ while the mean Intersection over Union (mIoU) is selected for Cityscapes.
The FID score is widely utilized for assessing the quality of the generated images by measuring the distance between the distributions of embedding features extracted from generated images and real images, which are given by the Inception V3 model [74] pretrained on ImageNet.
In the case of the Cityscapes, we adopt DRN-D105 [75] as a segmentation model to derive the mIoU scores for the generated images.
5.3 Implementation Details
The proposed algorithm is implemented in PyTorch [76] based on the publicly available code 1 .
Additionally, we incorporate the proposed mutual information maximization framework into existing approaches by using the ofﬁcial codes of GAN-Compression 2 [35], CAT 3 [38], CAGC (ContentAware GAN Compression) 4 [33], and GCC (Generator-discriminator Cooperative Compression) 5 [56] to validate its beneﬁt and generality.
For fair comparisons, we do not modify either experimental settings or network structures of the compared algorithms.
Speciﬁcally, we set the batch size tofor Pix2Pix, 1 for CycleGAN, 64 for SAGAN, and 16 for StyleGAN2 while we adopt the Adam optimizer with an initial learning rate of 0.0002, which is linearly decayed to zero.
When we train our energy-based model, we employ the Adam optimizer with a learning rate of 0.0001.
Note that we only run 10 steps of Langevin dynamics to draw samples from the energy-based model to save training time.
We set the standard deviation of random noise to 0.005 and use a step size of 100 for each gradient step of Langevin dynamics for all datasets except for the Cityscapes and FFHQ datasets.
For these two datasets, we use a step size of 50 instead.
Details about the hyperparameter settings are provided in the supplementary document.
In the case of the paired datasets such as Edges → Shoes and Cityscapes, we maximize the mutual information between the outputs given by the student model and the real outputs instead of the teacher outputs.
5.4 Results
Pix2Pix Table 1 presents the results from Pix2Pix on Edges → Shoes and Cityscapes by the proposed algorithm using the U-Net backbone in comparison to the original network and recent methods including OMGD [39] and OMGD [39] + VID [49].
As shown in the table, OMGD + VEM achieves the best performance in terms of FID and MAC among all compared algorithms on Edges → Shoes.
On Cityscapes, OMGD + VEM presents the highest mIoU by large margins even with the highest compression rate.
Note that we report the results from OMGD based on our reproduction using the ofﬁcial code, which are denoted by asterisks (*) in all tables.
CycleGAN We test our compression algorithm using CycleGAN on Horse → Zebra and Summer → Winter.
As shown in Table 2, OMGD
+ VEM outperforms all the compared methods on the both datasets, especially by large margins in Horse → Zebra.
Unconditional GANs We compress SAGAN and StyleGAN2 using GCC [56] and CAGC [33], respectively.
Table 3 illustrates the proposed method is also effective to improve performance of the unconditional GAN compression techniques.
In particular, our approach also works well with a large-scale generator such as StyleGAN2.
5.5 Ablation Study about Mutual Information Maximization Techniques
For maximizing mutual information between the teacher and student networks, one can use a fullyfactorized Gaussian distribution for the variational distribution followed by VID [49] or CRD [50] employing InfoNCE-like contrastive loss.
To validate the effectiveness of our energy-based models compared with VID and CRD, we perform an ablation study to combine with the state-of-the-art
GAN compression approaches such as OMGD [39], GAN-Compression [35], CAT [38], GCC [56] and CAGC [33].
Table 4 demonstrates that VEM consistently outperforms VID and CRD in all the tested algorithms. This is because, compared to VID, we derive a tighter lower bound of the mutual information [Table]
[Table] [Table] theoretically and consider spatial dependencies among pixels thanks to the more ﬂexible variational distribution based on the energy function.
Also, note that the application of CRD to generative models is not effective since the instance-level contrastive loss is prone to be trivial due to large gaps between positive and negative pairs. 5.6 Effect of λ MI for Mutual Information
We analyze the effect of balancing term λ MI for maximizing the variational lower bound on mutual information on the Cityscapes dataset using Pix2Pix under U-Net backbone by varying λ MI .
As shown in Table 5, VEM is not sensitive to the hyperparameter.
5.7 Qualitative Results
Figure 2 visualizes generated images given by the original uncompressed backbones and the compressed counterparts given by OMGD and OMGD + VEM for Pix2Pix and CycleGAN on Horse →
Zebra, Summer → Winter, Edges → Shoes [Table] and Cityscapes datasets.
The presented images imply that our approach is effective to enhance the generation quality.
For example, OMGD often produces unusual artifacts in the background in Cityscapes while OMGD + VEM is successful.
Figuredepicts generation results given by unconditional GANs on CelebA and FFHQ datasets.
Compared with the uncompressed versions, the proposed method preserves or often improves the generation [Figure] [Figure] quality even with large compression ratios.
Also, our approach synthesizes visually improved images compared to the previous GAN compression methods such as GCC and CAGC when combined with them.
Conclusion
We presented a novel GAN compression approach via knowledge distillation based on the mutual information, which maximizes the variational lower bound by incorporating an energy-based variational distribution.
Our energy-based model is straightforward to be incorporated into various existing model compression algorithms for generative models.
It provides a more ﬂexible variational distribution, which leads to theoretically tighter lower bounds and facilitates the consideration of the dependency between pixels.
The proposed algorithm demonstrates outstanding performance in various GAN compression scenarios on multiple datasets compared to the state-of-the-art algorithms. Acknowledgments This work was supported by SAIT, Samsung Electronics Co., Ltd, the Bio &
Medical Technology Development Program of the National Research Foundation (NRF) funded by the Korea government (MSIT)
[No. 2021M3A9E4080782], and Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT)
[No. 2021-0-01343, No. 2022-0-00959].
Checklist
For all authors...
(a) Do the main claims made in the abstract and introduction accurately reﬂect the paper’s contributions and scope?
[Yes] See the abstract and Section 1.
(b) Did you describe the limitations of your work?
[Yes] See Section A.4 in the the supplemental material.
(c) Did you discuss any potential negative societal impacts of your work?
[N/A] (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
[Yes] we have read the guidelines and ensured that our paper conforms to them.
If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
[N/A] (b) Did you include complete proofs of all theoretical results?
[N/A] 3.
If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
[Yes] We will attach the code and instructions in the supplemental material.
(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?
[Yes] See Section 5.
(c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?
[No] We ran one time.
(d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?
[No] We did not include them.
If you are using existing assets (e
g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
[Yes] See Section 5.
(b) Did you mention the license of the assets?
[No] We did not mention the license.
(c) Did you include any new assets either in the supplemental material or as a URL?
[No] No we did not introduce any new assets.
(d) Did you discuss whether and how consent was obtained from people whose data you’re using/curating?
[Yes] See Section 5.
(e) Did you discuss whether the data you are using/curating contains personally identiﬁable information or offensive content?
[No] No we did not.
If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
[N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable? [N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
[N/A]
This document ﬁrstly describes the objective function for knowledge distillation employed in GAN compression algorithms [35, 38, 33, 39, 56] which VEM is combined to validate its beneﬁt and generality. Secondly, we explain the implementation details of VEM about the architecture design of energy-based models. Finally, we present the additional qualitative results of VEM compared with the state-of-the-art methods.
To validate the beneﬁt and generality of VEM, we optimize the student generator using the algorithmspeciﬁc objective function, L algo , depending on the previous works while we train the network by maximizing the mutual information. In the previous methods, OMGD [39] and GCC [56] are online distillation algorithms while GAN-Compression [35], CAT [38], and CAGC [33] are ofﬂine ones. A.1.1 OMGD [39]
L algo is deﬁned as follows:
[Equation]
where λ CD , λ TV are hyperparameters while L TV , L OMGD-KD , and L CD are the total variation loss and distillation losses for intermediate and ﬁnal outputs, respectively.
OMGD [39] employs the channel distillation loss [77, 78] for the intermediate feature maps, which encourages the student network to mimic the channel-wise attention maps in the intermediate layers of the teacher.
To accomplish this goal, the channel distillation loss, L CD , is given by
[Equation]
[Equation]
where G t(cid:96) ( · ; φ t ) and G s(cid:96) ( · ; φ s ) are the intermediate feature maps of the (cid:96) th selected layer in the teacher and student networks, and f (cid:96) ( · ) denotes the 1x1 convolution operator to match the dimensionality of the two feature maps.
The attention loss, L atten ( · , · ) , is given by
[Equation]
(14) where GAP ( · ) is an average pooling function over the spatial dimension and C is the number of channels in p and q , which should be same.
For the output distillation loss, OMGD [39] deﬁnes L OMGD-KD as
[Equation]
where L MSSIM and L PL denote the mean of structural similarity loss (SSIM) [79] and the perceptual loss [40], respectively, while λ SSIM and λ PL are hyperparameters to control the balance between the two terms.
L OMGD-KD is commonly used in the previous approaches for GAN compression [80, 32, 36, 37, 39, 56] to quantify the perceptual difference between two outputs given by the teacher and student.
Speciﬁcally, the mean structure similarity loss is an average of L SSIM , the structure similarity between t i and s i , i th patches in t and s , over all local windows in the images, which is denoted using constant C 1 and C 2 for numerical stability by
[Equation]
In Eq.
(16), µ x and σ 2 x is a mean and variance to measure for luminance and contrast while σ x , y is a covariance between x and y used for structural comparison.
Therefore, the mean structure similarity loss is deﬁned by
[Equation]
where M is the number of local windows in the output.
The perceptual loss penalizes the feature reconstruction loss, L feat , and the style loss, L style , which encourage the student output to mimic the content and the style ( e .
g ., color, textures, and common patterns) of the teacher output using a pre-trained 16-layer of VGGNet [81], F ( · ) .
L feat is calculated as follows:
[Equation]
where F ij ( · ) and N are the i th element for the activations of the j th layer in the VGGNet and the number of the elements in the activations, respectively.
Also, L style is denoted by
[Equation]
where Gram ( X ) and (cid:107) Y (cid:107) 1 , 1 are the Gram matrix of X and the (cid:96) 1 norm of vectorized of Y .
A.1.2 GCC [56]
L algo is deﬁned as follows:
[Equation]
where L cGAN is the adversarial loss for generators and discriminators while L GCC-KD is a distillation loss for generated and intermediate outputs, which is given by
L GCC-KD =
[Equation]
Here, D tk ( · ; ψ t ) are the intermediate feature maps of the k th selected layer in the teacher discriminator and d ( · , · ) is a combination of the squared Frobenius norm of the two inputs and the Gram matrices of them.
A.1.3 GAN-Compression
L algo is deﬁned as follows:
[Equation]
where λ recon and λ distill are hyperparameters while L recon and L distill are deﬁned as follows:
[Equation]
for paired cGANs
[Equation]
for unpaired
[Equation]
In the above equation, f (cid:96) ( · ) denotes the 1x1 convolution operator to match the dimensionality of the two feature maps, and (cid:107) · (cid:107) F denotes the Frobenius norm .
A.1.4 CAT [38]
L algo is deﬁned as follows:
[Equation]
where λ KA is a hyperparameter and L KA is given by
[Equation]
Here, ρ ( · ) is a reshape operator, which transforms a 4D tensor ( ∈ R n × c × h × w ) into a 2D matrix ( ∈ R n × chw ) .
A.1.5 CAGC [33]
L algo is deﬁned as follows:
[Equation]
where λ recon , λ distill , and λ LPIPS are hyperparameters while L maskrecon , L maskdistill , and L maskLPIPS are denoted as
[Equation]
M is a spatial mask whose element is a binary value, and represents whether the corresponding pixel is located at the content of the image.
Also, LPIPS ( · , · ) is a learned perceptual image patch similarity metric [41] to attempt to measure the difference between the generated images of the teacher and student
A.2 More Implementation Details
Figure 4 illustrates the architecture design of the energy-based models which are parameterized with convolutional neural networks.
In the ﬁgure 4, we set C , the number of channels in intermediate feature maps, to 8 for the Horse → Zebra dataset while setting C to 32 for other datasets.
“ConvBlock" consists of a convolution using a kernel size of 3 and the LeakyReLU activation function while “ResBlock" is composed of two convolutional layers with a kernel size of 3 and the activation ones together with a residual connection [70].
Following [64], we also add spectral normalization layers [3] to the weights in all convolutional and linear layers in order to alleviate the training instability about sharp changes in gradient space of energy-based models.
Furthermore, we additionally minimize the value of the squared output from the energy-based models as a regularization term during training since the output is not bounded, which may cause the training instability.
Without the regularization term, we empirically observe that the output becomes numerically unstable values.
As a result, these techniques are helpful to improve the training stability.
inputs 3x3 Avg Pooling (stride=2)
ConvBlock, C
ResBlock, 2 × C
ResBlock, 4 × C
ResBlock, 4 × C
ResBlock, 4 × C
ResBlock, 4 × C
ResBlock, 4 × C
ResBlock, 4 × C
ReLU Activation
Global Average Pooling
Linear layer,
[Table]
A.3 Limitation
Although VEM incurs an extra training cost due to additionally running short-run MCMC steps
[Table]
the proposed method quantitatively and qualitatively improves the performance when combined with existing GAN compression approaches.
A.4 Additional Qualitative Results
We additionally present more qualitative results of VEM and the state-of-the-art methods including the original model in Figure 5, 6, 7, 8, 9, 10,
[Table]
and 12 which demonstrate the effectiveness of VEM
[Table]
B Code
We attached the source code to facilitate understanding and reproduction of our algorithm.
Please check “README.md" in the supplementary material folder which contains how to run VEM.
(cid:27)(cid:28)(cid:17)(cid:77)(cid:83)(cid:74) (cid:24)(cid:20)(cid:17)(cid:77)(cid:83)(cid:74) (cid:22)(cid:21)(cid:17)(cid:77)(cid:83)(cid:74) (cid:25)(cid:23)(cid:17)(cid:77)(cid:83)(cid:74) (cid:25)(cid:25)(cid:17)(cid:77)(cid:83)(cid:74) (cid:20)(cid:26)(cid:22)(cid:17)(cid:77)(cid:83)(cid:74)
[Figure]
[Figure]
[Figure]
(cid:50)(cid:48)(cid:42)(cid:39) (cid:50)(cid:48)(cid:42)(cid:39)(cid:3)(cid:14)(cid:3)(cid:57)(cid:44)(cid:39) (cid:50)(cid:85)(cid:76)(cid:74)(cid:76)(cid:81)(cid:68)(cid:79) (cid:20)(cid:21)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:20)(cid:20)(cid:20)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:23)(cid:24)(cid:22)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:20)(cid:20)(cid:25)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:22)(cid:22)(cid:22)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:28)(cid:21)(cid:25)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:50)(cid:48)(cid:42)(cid:39)(cid:3)(cid:14)(cid:3)(cid:57)(cid:40)(cid:48) (cid:16)(cid:33)(cid:3)(cid:24)(cid:20)(cid:19)
(cid:44)(cid:81)(cid:83)(cid:88)(cid:87) (cid:38)(cid:36)(cid:55) (cid:38)(cid:36)(cid:55)(cid:3)(cid:14)(cid:3)(cid:57)(cid:44)(cid:39) (cid:50)(cid:85)(cid:76)(cid:74)(cid:76)(cid:81)(cid:68)(cid:79) (cid:20)(cid:21)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:20)(cid:20)(cid:20)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:23)(cid:24)(cid:22)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:20)(cid:20)(cid:25)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:22)(cid:22)(cid:22)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:28)(cid:21)(cid:25)(cid:19)(cid:17)(cid:77)(cid:83)(cid:74) (cid:38)(cid:36)(cid:55)(cid:3)(cid:14)(cid:3)(cid:57)(cid:40)(cid:48)
[Table]
[Figure]
OMGD +
[Figure]
2011-06-29 20/57/51.png 2011-07-12 09/31/30.png 2011-09-13 23/03/31.png 2012-07-27 04/56/41.png 2013-06-25 19/25/21.png
(cid:50)(cid:88)(cid:85)(cid:86)(cid:24)(cid:28)(cid:25)(cid:15)(cid:3)(cid:25)(cid:20)(cid:22)(cid:15)(cid:3)(cid:25)(cid:20)(cid:27)(cid:15)(cid:3)(cid:20)(cid:19)(cid:22)(cid:20)(cid:15)(cid:3) (cid:20)(cid:19)(cid:25)(cid:21)(cid:15)(cid:3)(cid:20)(cid:20)(cid:23)(cid:26)(cid:15)(cid:3)(cid:20)(cid:22)(cid:21)(cid:25)(cid:20)(cid:15)(cid:3)
[Table]
[Figure]
[Figure]
(cid:50)(cid:88)(cid:85)(cid:86)(cid:19)(cid:15)(cid:21)(cid:15)(cid:3) (cid:23)(cid:15)(cid:3)(cid:25)(cid:15)(cid:3)(cid:20)(cid:27)(cid:15)(cid:3)(cid:21)(cid:22)(cid:15)(cid:3)(cid:21)(cid:28)(cid:15)(cid:3)(cid:22)(cid:20)(cid:15)(cid:3)(cid:22)(cid:22)(cid:15)(cid:3) (cid:22)(cid:25)(cid:16)(cid:33)(cid:23)(cid:27) (cid:15)(cid:3) (cid:22)(cid:26)(cid:15)(cid:3)(cid:23)(cid:25)