mlsanityData to 7 Oct 2026

Quantization of Generative Adversarial Networks for Efficient Inference: a Methodological Study

arXiv 2108.13996 ↗First posted 31 Aug 2021cs.AI cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Generative adversarial networks (GANs) have an enormous potential impact on digital content creation, e.g., photo-realistic digital avatars, semantic content editing, and quality enhancement of speech and images. However, the performance of modern GANs comes together with massive amounts of computations performed during the inference and high energy consumption. That complicates, or even makes impossible, their deployment on edge devices. The problem can be reduced with quantization -- a neural network compression technique that facilitates hardware-friendly inference by replacing floating-point computations with low-bit integer ones. While quantization is well established for discriminative models, the performance of modern quantization techniques in application to GANs remains unclear. GANs generate content of a more complex structure than discriminative models, and thus quantization of GANs is significantly more challenging. To tackle this problem, we perform an extensive experimental study of state-of-art quantization techniques on three diverse GAN architectures, namely StyleGAN, Self-Attention GAN, and CycleGAN. As a result, we discovered practical recipes that allowed us to successfully quantize these models for inference with 4/8-bit weights and 8-bit activations while preserving the quality of the original full-precision models.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 26 of its 33 references that are in the map. First posted on arXiv 31 Aug 2021.

Builds on

26 of 33 references.

References · 26

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  4. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  5. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  6. 2016Perceptual Losses for Real-Time Style Transfer and Super-Resolutioncited by 2,678
  7. 2018Large Scale GAN Training for High Fidelity Natural Image Synthesiscited by 2,609
  8. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  9. 2017Improved Training of Wasserstein GANscited by 2,223
  10. 2016Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoisingcited by 1,352
  11. 2016Least Squares Generative Adversarial Networkscited by 1,000
  12. 2018Self-Attention Generative Adversarial Networkscited by 809
14 more
  1. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  2. 2019Learned Step Size Quantizationcited by 604
  3. 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 600
  4. 2018Quantizing deep convolutional networks for efficient inference: A whitepapercited by 507
  5. 2021BRECQ: Pushing the Limit of Post-Training Quantization by Block Reconstructioncited by 464
  6. 2019Data-Free Quantization Through Weight Equalization and Bias Correctioncited by 328
  7. 2018LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networkscited by 272
  8. 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
  9. 2020Improving Post Training Neural Quantization: Layer-wise Calibration and Integer Programmingcited by 89
  10. 2019Trained Quantization Thresholds for Accurate and Efficient Fixed-Point Inference of Deep Neural Networkscited by 87
  11. 2020HAWQV3: Dyadic Neural Network Quantizationcited by 59
  12. 2018Value-aware Quantization for Training and Inference of Neural Networkscited by 49
  13. 2020GAN Slimming: All-in-One GAN Compression by A Unified Optimization Frameworkcited by 44
  14. 2019QGAN: Quantized Generative Adversarial Networkscited by 20

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 2.

4 papers.