Pith. sign in

REVIEW 4 major objections 6 minor 229 references

Generative Adversarial Networks Bridging Art and Machine Intelligence

T0 review · 4 major / 6 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This book presents GANs as one coherent arc, from the minimax game through modern architectures and applications.

desk verdict A competent, clearly organized GAN textbook with no new research claim; fix the unqualified convergence statements and the non-runnable code snippets before recommending it to students. read the letter →

arxiv 2502.04116 v2 pith:GCFOEF52 submitted 2025-02-06 cs.LG cs.CV

Junhao Song , Yichao Zhang , Ziqian Bi , Tianyang Wang , Keyu Chen , Ming Li , Qian Niu , Junyu Liu
show 20 more authors
Benji Peng Sen Zhang Ming Liu Jiawei Xu Xuanhe Pan Jinlang Wang Pohsun Feng Yizhu Wen Lawrence K.Q. Yan Hong-Ming Tseng Xinyuan Song Jintao Ren Silin Chen Yunze Wang Weiche Hsieh Bowen Jing Junjie Yang Jun Zhou Zheyu Yao Chia Xin Liang
This is my paper · ORCID
classification cs.LGcs.CV
keywords generativeadversarialnetworksGANtrainingstabilityminimaxgameWassersteinStyleimagegenerationdiffusionmodelsmachinelearningsurvey
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The book is a self-contained survey of generative adversarial networks, aimed at readers who want to understand the field from first principles. Its central claim is that the adversarial game between a generator and a discriminator provides a single thread that connects probability theory, game theory, loss design, architectural innovations, and creative applications. The book walks through the original minimax objective, classic variants such as conditional GANs and InfoGAN, training stabilizers like Wasserstein distance and gradient penalties, and high-resolution generators, then compares GANs with diffusion models. If the book is right, a newcomer can use it as a route from mathematical foundations to working PyTorch examples and to an informed view of where generative modeling is heading.

What carries the argument

The organizing mechanism is the two-player minimax game between the generator $G$ and discriminator $D$, with objective $$\min_G \max_D \mathbb{E}_{x\sim p_{\text{data}}}[\log D(x)] + \mathbb{E}_{z\sim p_z}[\log(1-D(G(z)))].$$ The book uses this objective as the lens for every variant: WGAN replaces the log-loss with the Wasserstein distance, WGAN-GP enforces the Lipschitz constraint with a gradient penalty, LSGAN swaps in a least-squares cost, and architectural work from DCGAN through StyleGAN modifies how $G$ and $D$ are built. The theoretical chapters define the ideal outcome as Nash equilibrium, where the discriminator outputs $D(x)=0.5$ for real and generated data alike.

What would settle it

Run the book's PyTorch examples in a fresh environment: the LAPGAN training loop in Section 3.6.1 calls an undefined get_real_images helper, and the Section 1.4.3 example feeds torch.randn(64, 784) as “real data” for an image-generation task, so executing the code as printed would fail. A second observation is that training a small GAN on a simple distribution and checking whether the discriminator actually settles near $D(x)=0.5$ would test the convergence claim, since in practice the generator and discriminator often oscillate instead of reaching the stated equilibrium.

Watch

Extended reading notes

Core claim

The book's central claim is pedagogical: GANs are best understood as an adversarial two-player game in which the generator tries to fool a discriminator that tries to stay one step ahead, and nearly every design decision in the field can be read as a modification of that game. On the book's own terms, the objective is to show that the minimax formulation with binary cross-entropy loss, the Nash-equilibrium ideal of $D(x)=0.5$, and the distribution-matching view of convergence make the later variants—WGAN, WGAN-GP, LSGAN, SNGAN, ProGAN, StyleGAN, CycleGAN, and others—natural responses to specific failures of the original game. The book also claims that the same thread extends to applications in image, video, text, speech, and medical domains, and that the rise of diffusion models is best understood as a competing answer to the same generation problem.

Load-bearing premise

The book's educational value depends on the assumption that the textbook GAN convergence story—an optimal discriminator, unlimited model capacity, and converged alternating updates—carries over to the practical training it demonstrates, and that its printed PyTorch snippets run as shown.

Editorial extensions

If this is right

  • A reader who follows the chapters in order can move from the minimax objective to working implementations of CGAN, WGAN, WGAN-GP, and LAPGAN without needing other references.
  • The survey's organization implies that GAN variants are best chosen by diagnosing a specific failure of the original game—mode collapse, vanishing gradients, or instability—rather than by brand name.
  • The comparison with diffusion models implies that GANs remain relevant where fast sampling and controlled style manipulation matter more than maximum diversity.
  • If the historical timeline is accurate, the practical trajectory of GANs is one of incremental stabilization and architectural control, not replacement by a single successor.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The book asserts convergence without reporting training curves, so an instructor using it would likely need to add evaluation metrics and data loaders to verify that the examples actually converge.
  • The same minimax framing could be extended to score-based and flow-based generative models, which the book only reaches through diffusion models; a reader could use the book's game-theoretic vocabulary to structure that comparison.
  • The undefined get_real_images helper suggests the code is illustrative rather than executable; a companion notebook with real data loaders would be a natural test of the book's pedagogical claim.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The manuscript is a lengthy tutorial-style book on Generative Adversarial Networks, organized in four parts: basic theories, classic variants and improved training methods, applications, and advanced research/future directions. It claims to provide a detailed introduction to GAN fundamentals, their mathematical and theoretical underpinnings (probability, statistics, game theory), a review of classic and modern variants (CGAN, DCGAN, InfoGAN, LAPGAN, WGAN, WGAN-GP, LSGAN, SNGAN, ProGAN, BigGAN, StyleGAN, Pix2Pix, CycleGAN, etc.), and a comparison with diffusion models, all illustrated with PyTorch code examples. The paper makes no claim of a new scientific result; its load-bearing assertion is that it is a comprehensive and accurate introductory survey suitable for beginners.

Significance. If the survey is accurate and the code examples are faithful, the book could serve as a useful introductory textbook for students and practitioners entering the GAN field. The organization is logical, the coverage of variants is broad, and the bibliography (when present) appears to cite the standard literature. The paper also has the merit of being a self-contained collection of known material, with no original derivations or fitted parameters, so the circularity risk is low. However, the pedagogical value depends on the correctness of the theoretical statements and the runnability of the printed code, and several aspects in both categories need repair before the book can be relied upon as a learning resource.

major comments (4)
  1. [§2.5.2, §2.6.1] The convergence claims are stated as unconditional facts. In §2.5.2 ("Convergence of GANs") the text says 'the generated distribution pg(x) converges to the real data distribution pdata(x)' and at that point the discriminator cannot tell real from fake; §2.6.1 ("Minimax Game and Nash Equilibrium") similarly states that at convergence the generator and discriminator reach a Nash equilibrium and the discriminator assigns D(x)=0.5 to both real and generated data. These statements are only true under idealizations that are not stated in the surrounding prose: the discriminator must be trained to optimality for each fixed generator (or the minimax game solved over probability distributions), both networks need unbounded capacity, and the alternating stochastic optimization must actually converge. The text does acknowledge practical difficulties later in the same sections, but it does not connect those difficulties to the missing hypotheses, so a reader is left with the impression that GAN training is guaranteed to converge to the equilibrium. Since the book advertises a rigorous treatment of the 'mathematical and theoretical underpinnings,' these statements need to be qualified with the standard assumptions (e.g., optimal discriminator, nonparametric limit, convergence of the minimax dynamics).
  2. [§1.4.3, §1.5.1, §2.5.2, §3.6.1, §4.7.1, §4.8.1] Several printed PyTorch examples are not runnable as presented, which undermines the book's stated goal of providing 'illustrative Python examples' for beginners. In §1.4.3, the training loop sets `real_data = torch.randn((64, 784))` and calls it a 'Batch of real data' for an image-generation example; the same placeholder appears in §1.5.1 and inside `train_gan` in §2.5.2, with no indication that this is random noise rather than actual data. More seriously, §3.6.1 (LAPGAN), §4.7.1 (PacGAN), and §4.8.1 (WGAN-GP) call a `get_real_images(...)` helper that is never defined in the text, and the LAPGAN example also uses undefined variables `batch_size`, `num_epochs`, and `generator`/`discriminator` names that do not match the models defined earlier. These are not mere typos: a beginner cannot reproduce the examples, and the code does not faithfully implement the algorithms as claimed. The authors should either provide complete, self-contained scripts or explicitly label the snippets as pseudocode and remove the undefined references.
  3. [§2.2.2] The discriminator objective in the game-theory section is written as `min_D E_{x~pdata}[log D(x)] + E_{z~pz}[log(1 - D(G(z)))]`. In the standard GAN formulation the discriminator maximizes this expression (equivalently minimizes its negative), and the immediately following paragraphs and the code in §2.6.2 use the correct sign convention. Presenting the minimization of the positive log-likelihood as the discriminator's objective is a sign error that confuses the theoretical foundation of the minimax game, especially for a reader new to the subject.
  4. [§2.6.2] The printed WGAN discriminator loss formula has the opposite sign from the code that accompanies it. The text states `LD = E_{x~pdata}[D(x)] - E_{z~pz}[D(G(z))]`, but the code computes `loss_D_real = -torch.mean(D(real_data))`, `loss_D_fake = torch.mean(D(fake_data.detach()))`, and `loss_D = loss_D_real + loss_D_fake`, which minimizes `-E[D(x)] + E[D(G(z))]`. Either the formula should be corrected to the negative, or the code should be adjusted to match the text. As printed, the theoretical explanation and the implementation disagree, which is a concrete accuracy problem in a chapter that promises to provide 'a solid framework' for understanding GAN objectives.
minor comments (6)
  1. [General] The arXiv version contains numbered citations but no reference list or bibliography. A comprehensive survey of this type should include a complete reference section, as the authors repeatedly refer the reader to [1], [4], [6], etc., which are currently unverifiable.
  2. [§1.1.2] The historical timeline lists WGAN as introduced in 2016, but the Wasserstein GAN paper (Arjovsky et al.) first appeared on arXiv in January 2017. Please verify and correct the year to avoid propagating a common misdating.
  3. [§2.6.2, Figure 2.1] The 'Comparison of Loss Functions in GAN Training' figure appears to be a synthetic illustration, but there is no caption or description of how the curves were produced. If the plot is not the result of an actual training run, please state that it is a schematic; if it is from a real run, provide the experimental setup.
  4. [§1.2.2] In the first PyTorch example, the generator uses a linear output layer with no activation function, while the discriminator uses a sigmoid. This is appropriate for a Gaussian-output demo, but the choice is never explained; a brief note would prevent confusion for readers who expect tanh or similar activations in GAN generators.
  5. [§3.6.1] The LAPGAN implementation example defines classes `GeneratorLevel0`, `GeneratorLevelN`, and `Discriminator`, but then instantiates models named `G0`, `G1`, `G2`, `D0`, `D1`, `D2` and later references `generator` and `discriminator` in the training loop. Please align the variable names to make the code internally consistent.
  6. [§2.3.3] The statement 'Once Nash Equilibrium is reached, the generator produces samples that closely match the real distribution, and the discriminator's accuracy drops to 50%' should be softened to note that this holds in the idealized nonparametric limit; in practice GANs often converge to a local equilibrium or none at all, a point the book itself makes in §2.3.2.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the survey's claims are borrowed from external literature rather than derived from its own fitted inputs.

full rationale

The paper is an expository survey of GANs. Its central claim is that it provides a comprehensive introduction to GAN principles, theory, variants, and applications. Every substantive theoretical statement, such as the minimax objective in §2.6.1, the Nash equilibrium characterization D(x)=0.5, and the claim that pg converges to pdata, is presented as a summary of the existing literature (e.g., Goodfellow et al. 2014) rather than as a new derivation from quantities fitted in this paper. No parameter is fitted to a subset of data and then renamed a prediction, no target result is built into the definition of an input quantity, and no load-bearing argument reduces to a self-citation chain or an imported uniqueness theorem. The over-brief statements about GAN convergence omit standard idealizing assumptions (optimal discriminator, unbounded capacity, convergence of alternating updates), but that is a correctness/rigor concern, not circularity, because the claims are not equivalent to their inputs by construction. The tutorial code snippets are illustrative; their incompleteness (e.g., an undefined get_real_images helper) does not create an input-output loop. Since the paper makes no original empirical or theoretical claim that depends on its own constructions, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The book introduces no new entities and fits no free parameters. Its central claim rests on standard mathematical background and on two unstated premises: the idealization behind GAN convergence guarantees, and the executability of its own code examples.

assumptions (3)
  • standard math Probability theory, statistics, and game theory provide the valid framework for describing GAN training and Nash equilibrium.
    Chapter 2 presents these as the mathematical foundation for GAN objectives and convergence.
  • domain assumption A GAN minimax game with an optimal discriminator converges to the true data distribution and D(x)=0.5.
    Stated in Sections 2.3.1 and 2.6.1 without flagging the infinite-capacity and optimal-discriminator idealizations that make the standard result true.
  • ad hoc to paper The printed PyTorch code examples faithfully implement the algorithms and can be run by readers.
    The didactic claim depends on code quality; however several snippets are incomplete or use random tensors as real data (Sections 1.4.3, 3.6.1).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Generative Adversarial Networks Bridging Art and Machine Intelligence." pith.science (2026). https://pith.science/paper/GCFOEF52

@misc{pith2026250204116,
  author       = {Pith},
  title        = {Pith review of: Generative Adversarial Networks Bridging Art and Machine Intelligence},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GCFOEF52}},
  note         = {Machine review of arXiv:2502.04116}
}
read the original abstract

Generative Adversarial Networks (GAN) have greatly influenced the development of computer vision and artificial intelligence in the past decade and also connected art and machine intelligence together. This book begins with a detailed introduction to the fundamental principles and historical development of GANs, contrasting them with traditional generative models and elucidating the core adversarial mechanisms through illustrative Python examples. The text systematically addresses the mathematical and theoretical underpinnings including probability theory, statistics, and game theory providing a solid framework for understanding the objectives, loss functions, and optimisation challenges inherent to GAN training. Subsequent chapters review classic variants such as Conditional GANs, DCGANs, InfoGAN, and LAPGAN before progressing to advanced training methodologies like Wasserstein GANs, GANs with gradient penalty, least squares GANs, and spectral normalisation techniques. The book further examines architectural enhancements and task-specific adaptations in generators and discriminators, showcasing practical implementations in high resolution image generation, artistic style transfer, video synthesis, text to image generation and other multimedia applications. The concluding sections offer insights into emerging research trends, including self-attention mechanisms, transformer-based generative models, and a comparative analysis with diffusion models, thus charting promising directions for future developments in both academic and applied settings.

Figures

Figures reproduced from arXiv: 2502.04116 by the authors.

Figure 1.1
Figure 1.1. Evolution of GAN performance from 2014 to 2018 and 2024. The results for 2014 to 2018 [PITH_FULL_IMAGE:figures/full_fig_p013_1_1.png] view at source ↗
Figure 1.2
Figure 1.2. The basic architecture of a Generative Adversarial Network (GAN). The Generator creates [PITH_FULL_IMAGE:figures/full_fig_p022_1_2.png] view at source ↗
Figure 2.1
Figure 2.1. Comparison of Loss Functions in GAN Training. [PITH_FULL_IMAGE:figures/full_fig_p040_2_1.png] view at source ↗
Figures from the paper (8 more)
Figure 3.1
Figure 3.1. Figure 3.1: The basic architecture of a Conditional GAN (CGAN). [PITH_FULL_IMAGE:figures/full_fig_p044_3_1.png]
Figure 5.1
Figure 5.1. Figure 5.1: Example images and their projected and re-synthesized counterparts. For each configu [PITH_FULL_IMAGE:figures/full_fig_p086_5_1.png]
Figure 6.1
Figure 6.1. Figure 6.1: Example images from Pix2Pix official website [ [PITH_FULL_IMAGE:figures/full_fig_p092_6_1.png]
Figure 6.2
Figure 6.2. Figure 6.2: Example resolution from SRGAN. 6.3.1 Techniques for Super-Resolution Image Generation Super-resolution is the process of reconstructing a high-resolution image from a low-resolution coun￾terpart [151]. This is a challenging task because increasing the resolution of a…
Figure 6.3
Figure 6.3. Figure 6.3: Qualitative results of single image 3D reconstruction from 3DGAN paper [ [PITH_FULL_IMAGE:figures/full_fig_p101_6_3.png]
Figure 10.1
Figure 10.1. Figure 10.1: The illustration of SeqGAN. Left: D is trained over the real data and the generated data by G. Right: G is trained by policy gradient where the final reward signal is provided by D and is passed back to the intermediate action value via Monte Carlo search [188]. The…
Figure 10.2
Figure 10.2. Figure 10.2: DCGAN uses small (5x5), twodimensional filters while WaveGAN uses longer (length-25), [PITH_FULL_IMAGE:figures/full_fig_p139_10_2.png]
Figure 10.3
Figure 10.3. Figure 10.3: At each layer of the WaveGAN discriminator, the phase shuffle operation perturbs the [PITH_FULL_IMAGE:figures/full_fig_p139_10_3.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

229 extracted references · 50 canonical work pages

  1. [1]

    Generative adversarial networks,

    I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y . Bengio, “Generative adversarial networks,”Advances in neural information processing systems, vol. 27, 2014

    2014

  2. [2]

    Generative adversarial networks: An overview,

    A. Creswell, T . White, V . Dumoulin, K. Arulkumaran, B. Sengupta, and A. A. Bharath, “Generative adversarial networks: An overview,” IEEE signal processing magazine , vol. 35, no. 1, pp. 53–65, 2018

    2018

  3. [3]

    Unrolled generative adversarial networks,

    L. Metz, B. Poole, D. Pfau, and J. Sohl-Dickstein, “Unrolled generative adversarial networks,” arXiv preprint arXiv:1611.02163, 2016

    arXiv 2016

  4. [4]

    Unsupervised representation learning with deep convolutional generative adversar- ial networks,

    A. Radford, “Unsupervised representation learning with deep convolutional generative adversar- ial networks,” arXiv preprint arXiv:1511.06434, 2015

    arXiv 2015

  5. [5]

    Coupled generative adversarial networks,

    M.-Y . Liu and O. Tuzel, “Coupled generative adversarial networks,”Advances in neural information processing systems, vol. 29, 2016

    2016

  6. [6]

    Progressive growing of gans for improved quality, stability, and variation,

    T . Karras, “Progressive growing of gans for improved quality, stability, and variation,” arXiv preprint arXiv:1710.10196, 2017

    arXiv 2017

  7. [7]

    A style-based generator architecture for generative adversarial networks,

    T . Karras, S. Laine, and T . Aila, “A style-based generator architecture for generative adversarial networks,” inProceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 4401–4410, 2019

    2019

  8. [8]

    Isfb-gan: Interpretable semantic face beautification with generative adversarial network,

    T . Peng, M. Li, F . Chen, Y . Xu, Y . Xie, Y . Sun, and D. Zhang, “Isfb-gan: Interpretable semantic face beautification with generative adversarial network,” Expert Systems with Applications , vol. 236, p. 121131, 2024

    2024

Show all 229 references
  1. [9]

    Generative adversarial networks: introduction and outlook,

    K. Wang, C. Gou, Y . Duan, Y . Lin, X. Zheng, and F .-Y . Wang, “Generative adversarial networks: introduction and outlook,” IEEE/CAA Journal of Automatica Sinica , vol. 4, no. 4, pp. 588–598, 2017

    2017

  2. [10]

    Generative adversarial network: An overview of theory and applications,

    A. Aggarwal, M. Mittal, and G. Battineni, “Generative adversarial network: An overview of theory and applications,” International Journal of Information Management Data Insights , vol. 1, no. 1, p. 100004, 2021

    2021

  3. [11]

    A review on generative adversarial networks: Algorithms, theory, and applications,

    J. Gui, Z. Sun, Y . Wen, D. Tao, and J. Ye, “A review on generative adversarial networks: Algorithms, theory, and applications,” IEEE transactions on knowledge and data engineering , vol. 35, no. 4, pp. 3313–3332, 2021

    2021

  4. [12]

    Wasserstein generative adversarial networks,

    M. Arjovsky, S. Chintala, and L. Bottou, “Wasserstein generative adversarial networks,” in Inter- national conference on machine learning , pp. 214–223, PMLR, 2017. 193 194 BIBLIOGRAPHY

    2017

  5. [13]

    Semantic image synthesis with spatially-adaptive normalization,

    T . Park, M.-Y . Liu, T .-C. Wang, and J.-Y . Zhu, “Semantic image synthesis with spatially-adaptive normalization,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recog- nition, pp. 2337–2346, 2019

    2019

  6. [14]

    Large scale gan training for high fidelity natural image synthesis,

    A. Brock, “Large scale gan training for high fidelity natural image synthesis,” arXiv preprint arXiv:1809.11096, 2018

    2018 arXiv

  7. [15]

    Analyzing and improving the image quality of stylegan,

    T . Karras, S. Laine, M. Aittala, J. Hellsten, J. Lehtinen, and T . Aila, “Analyzing and improving the image quality of stylegan,” 2020

    2020

  8. [16]

    Alias-free genera- tive adversarial networks,

    T . Karras, M. Aittala, S. Laine, E. Härkönen, J. Hellsten, J. Lehtinen, and T . Aila, “Alias-free genera- tive adversarial networks,” Advances in neural information processing systems, vol. 34, pp. 852– 863, 2021

    2021

  9. [17]

    Scaling up gans for text-to-image synthesis,

    M. Kang, J.-Y . Zhu, R. Zhang, J. Park, E. Shechtman, S. Paris, and T . Park, “Scaling up gans for text-to-image synthesis,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 10124–10134, 2023

    2023

  10. [18]

    Sparse-gan: Sparsity- constrained generative adversarial network for anomaly detection in retinal oct image,

    K. Zhou, S. Gao, J. Cheng, Z. Gu, H. Fu, Z. Tu, J. Yang, Y . Zhao, and J. Liu, “Sparse-gan: Sparsity- constrained generative adversarial network for anomaly detection in retinal oct image,” in 2020 IEEE 17th International Symposium on Biomedical Imaging (ISBI) , pp. 1227–1231,...

    2020

  11. [19]

    Auto-encoding variational bayes,

    D. P . Kingma, “Auto-encoding variational bayes,” arXiv preprint arXiv:1312.6114, 2013

    2013 arXiv

  12. [20]

    An introduction to variational autoencoders,

    D. P . Kingma, M. Welling, et al., “An introduction to variational autoencoders,” Foundations and Trends® in Machine Learning, vol. 12, no. 4, pp. 307–392, 2019

    2019

  13. [21]

    A learning algorithm for boltzmann machines,

    D. H. Ackley, G. E. Hinton, and T . J. Sejnowski, “A learning algorithm for boltzmann machines,” Cognitive science, vol. 9, no. 1, pp. 147–169, 1985

    1985

  14. [22]

    Rectified linear units improve restricted boltzmann machines,

    V . Nair and G. E. Hinton, “Rectified linear units improve restricted boltzmann machines,” in Pro- ceedings of the 27th international conference on machine learning (ICML-10) , pp. 807–814, 2010

    2010

  15. [23]

    A probability distribution and its uses in fitting data,

    J. S. Ramberg, E. J. Dudewicz, P . R. Tadikamalla, and E. F . Mykytka, “A probability distribution and its uses in fitting data,” Technometrics, vol. 21, no. 2, pp. 201–214, 1979

    1979

  16. [24]

    Dimensionality reduction: A com- parative review,

    L. Van Der Maaten, E. O. Postma, H. J. Van Den Herik, et al., “Dimensionality reduction: A com- parative review,” Journal of machine learning research , vol. 10, no. 66-71, p. 13, 2009

    2009

  17. [25]

    Why does unsupervised pre-training help deep learning?,

    D. Erhan, A. Courville, Y . Bengio, and P . Vincent, “Why does unsupervised pre-training help deep learning?,” in Proceedings of the thirteenth international conference on artificial intelligence and statistics, pp. 201–208, JMLR Workshop and Conference Proceedings, 2010

    2010

  18. [26]

    Elbo surgery: yet another way to carve up the variational evidence lower bound,

    M. D. Hoffman and M. J. Johnson, “Elbo surgery: yet another way to carve up the variational evidence lower bound,” in Workshop in Advances in Approximate Bayesian Inference, NIPS, vol. 1, 2016

    2016

  19. [27]

    Statistical analysis based on a certain multivariate complex gaussian distribu- tion (an introduction),

    N. R. Goodman, “Statistical analysis based on a certain multivariate complex gaussian distribu- tion (an introduction),” The Annals of mathematical statistics , vol. 34, no. 1, pp. 152–177, 1963

    1963

  20. [28]

    Latent space approaches to social network analy- sis,

    P . D. Hoff, A. E. Raftery, and M. S. Handcock, “Latent space approaches to social network analy- sis,” Journal of the american Statistical association , vol. 97, no. 460, pp. 1090–1098, 2002. BIBLIOGRAPHY 195

    2002

  21. [29]

    Gans for medical image analysis,

    S. Kazeminia, C. Baur, A. Kuijper, B. van Ginneken, N. Navab, S. Albarqouni, and A. Mukhopadhyay, “Gans for medical image analysis,” Artificial intelligence in medicine , vol. 109, p. 101938, 2020

    2020

  22. [30]

    Pytorch: An imperative style, high-performance deep learning library,

    A. Paszke, S. Gross, F . Massa, A. Lerer, J. Bradbury, G. Chanan, T . Killeen, Z. Lin, N. Gimelshein, L. Antiga, et al., “Pytorch: An imperative style, high-performance deep learning library,” Advances in neural information processing systems , vol. 32, 2019

    2019

  23. [31]

    Stevens, L

    E. Stevens, L. Antiga, and T . Viehmann, Deep learning with PyTorch. Manning Publications, 2020

    2020

  24. [32]

    Kottwitz, LaTeX Graphics with TikZ: A practitioner’s guide to drawing 2D and 3D images, dia- grams, charts, and plots

    S. Kottwitz, LaTeX Graphics with TikZ: A practitioner’s guide to drawing 2D and 3D images, dia- grams, charts, and plots . Packt Publishing Ltd, 2023

    2023

  25. [33]

    The real-world-weight cross-entropy loss function: Modeling the costs of mislabeling,

    Y . Ho and S. Wookey, “The real-world-weight cross-entropy loss function: Modeling the costs of mislabeling,” IEEE access, vol. 8, pp. 4806–4813, 2019

    2019

  26. [34]

    Approximations to the log-likelihood function in the nonlinear mixed-effects model,

    J. C. Pinheiro and D. M. Bates, “Approximations to the log-likelihood function in the nonlinear mixed-effects model,” Journal of computational and Graphical Statistics , vol. 4, no. 1, pp. 12–35, 1995

    1995

  27. [35]

    An analysis of edge detection by using the jensen-shannon divergence,

    J. F . Gómez-Lopera, J. Martínez-Aroza, A. M. Robles-Pérez, and R. Román-Roldán, “An analysis of edge detection by using the jensen-shannon divergence,” Journal of Mathematical Imaging and Vision, vol. 13, pp. 35–56, 2000

    2000

  28. [36]

    Approximating the kullback leibler divergence between gaus- sian mixture models,

    J. R. Hershey and P . A. Olsen, “Approximating the kullback leibler divergence between gaus- sian mixture models,” in 2007 IEEE International Conference on Acoustics, Speech and Signal Processing-ICASSP’07, vol. 4, pp. IV–317, IEEE, 2007

    2007

  29. [37]

    Veegan: Reducing mode collapse in gans using implicit variational learning,

    A. Srivastava, L. Valkov, C. Russell, M. U. Gutmann, and C. Sutton, “Veegan: Reducing mode collapse in gans using implicit variational learning,” Advances in neural information processing systems, vol. 30, 2017

    2017

  30. [38]

    Catastrophic forgetting and mode collapse in gans,

    H. Thanh-Tung and T . Tran, “Catastrophic forgetting and mode collapse in gans,” in 2020 inter- national joint conference on neural networks (ijcnn) , pp. 1–10, IEEE, 2020

    2020

  31. [39]

    The vanishing gradient problem during learning recurrent neural nets and problem solutions,

    S. Hochreiter, “The vanishing gradient problem during learning recurrent neural nets and problem solutions,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 6, no. 02, pp. 107–116, 1998

    1998

  32. [40]

    Which neural net architectures give rise to exploding and vanishing gradients?,

    B. Hanin, “Which neural net architectures give rise to exploding and vanishing gradients?,” Ad- vances in neural information processing systems , vol. 31, 2018

    2018

  33. [41]

    When does label smoothing help?,

    R. Müller, S. Kornblith, and G. E. Hinton, “When does label smoothing help?,” Advances in neural information processing systems, vol. 32, 2019

    2019

  34. [42]

    How does batch normalization help optimiza- tion?,

    S. Santurkar, D. Tsipras, A. Ilyas, and A. Madry, “How does batch normalization help optimiza- tion?,” Advances in neural information processing systems , vol. 31, 2018

    2018

  35. [43]

    Understanding batch normalization,

    N. Bjorck, C. P . Gomes, B. Selman, and K. Q. Weinberger, “Understanding batch normalization,” Advances in neural information processing systems , vol. 31, 2018

    2018

  36. [44]

    Learning with a wasserstein loss,

    C. Frogner, C. Zhang, H. Mobahi, M. Araya, and T . A. Poggio, “Learning with a wasserstein loss,” Advances in neural information processing systems , vol. 28, 2015. 196 BIBLIOGRAPHY

    2015

  37. [45]

    Probgan: Towards probabilistic gan with theoretical guarantees,

    H. He, H. Wang, G.-H. Lee, and Y . Tian, “Probgan: Towards probabilistic gan with theoretical guarantees,” in International conference on learning representations , 2018

    2018

  38. [46]

    Seeing what a gan cannot generate,

    D. Bau, J.-Y . Zhu, J. Wulff, W. Peebles, H. Strobelt, B. Zhou, and A. Torralba, “Seeing what a gan cannot generate,” in Proceedings of the IEEE/CVF international conference on computer vision , pp. 4502–4511, 2019

    2019

  39. [47]

    Must-gan: Multi-level statistics transfer for self-driven person image generation,

    T . Ma, B. Peng, W. Wang, and J. Dong, “Must-gan: Multi-level statistics transfer for self-driven person image generation,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 13622–13631, 2021

    2021

  40. [48]

    Fudenberg and J

    D. Fudenberg and J. Tirole, Game theory. MIT press, 1991

    1991

  41. [49]

    The complexity of computing a nash equilibrium,

    C. Daskalakis, P . W. Goldberg, and C. H. Papadimitriou, “The complexity of computing a nash equilibrium,” Communications of the ACM , vol. 52, no. 2, pp. 89–97, 2009

    2009

  42. [50]

    Gans trained by a two time-scale update rule converge to a local nash equilibrium,

    M. Heusel, H. Ramsauer, T . Unterthiner, B. Nessler, and S. Hochreiter, “Gans trained by a two time-scale update rule converge to a local nash equilibrium,” Advances in neural information processing systems, vol. 30, 2017

    2017

  43. [51]

    Do gans always have nash equilibria?,

    F . Farnia and A. Ozdaglar, “Do gans always have nash equilibria?,” in International Conference on Machine Learning, pp. 3029–3039, PMLR, 2020

    2020

  44. [52]

    On estimation of a probability density function and mode,

    E. Parzen, “On estimation of a probability density function and mode,” The annals of mathemati- cal statistics, vol. 33, no. 3, pp. 1065–1076, 1962

    1962

  45. [53]

    Bayesian gan,

    Y . Saatci and A. G. Wilson, “Bayesian gan,” Advances in neural information processing systems , vol. 30, 2017

    2017

  46. [54]

    Kuipers and H

    L. Kuipers and H. Niederreiter, Uniform distribution of sequences . Courier Corporation, 2012

    2012

  47. [55]

    The jensen-shannon divergence,

    M. L. Menéndez, J. Pardo, L. Pardo, and M. Pardo, “The jensen-shannon divergence,” Journal of the Franklin Institute, vol. 334, no. 2, pp. 307–318, 1997

    1997

  48. [56]

    Jensen-shannon divergence and hilbert space embedding,

    B. Fuglede and F . Topsoe, “Jensen-shannon divergence and hilbert space embedding,” in Inter- national symposium onInformation theory, 2004. ISIT 2004. Proceedings. , p. 31, IEEE, 2004

    2004

  49. [57]

    Work and life: The end of the zero-sum game,

    S. D. Friedman, P . Christensen, and J. DeGroot, “Work and life: The end of the zero-sum game,” Harvard business review, vol. 76, pp. 119–130, 1998

    1998

  50. [58]

    Quiñonero-Candela, M

    J. Quiñonero-Candela, M. Sugiyama, A. Schwaighofer, and N. D. Lawrence, Dataset shift in ma- chine learning. Mit Press, 2022

    2022

  51. [59]

    Gradient-based learning applied to document recognition,

    Y . LeCun, L. Bottou, Y . Bengio, and P . Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998

    1998

  52. [60]

    Binary cross entropy with deep learning technique for image classi- fication,

    U. Ruby and V . Yendapalli, “Binary cross entropy with deep learning technique for image classi- fication,” Int. J. Adv. Trends Comput. Sci. Eng , vol. 9, no. 10, 2020

    2020

  53. [61]

    The earth mover’s distance as a metric for image re- trieval,

    Y . Rubner, C. Tomasi, and L. J. Guibas, “The earth mover’s distance as a metric for image re- trieval,” International journal of computer vision , vol. 40, pp. 99–121, 2000. BIBLIOGRAPHY 197

    2000

  54. [62]

    Dimension-wise importance sampling weight clipping for sample-efficient reinforcement learning,

    S. Han and Y . Sung, “Dimension-wise importance sampling weight clipping for sample-efficient reinforcement learning,” inInternational Conference on Machine Learning, pp. 2586–2595, PMLR, 2019

    2019

  55. [63]

    Weight clipping for deep continual and rein- forcement learning,

    M. Elsayed, Q. Lan, C. Lyle, and A. R. Mahmood, “Weight clipping for deep continual and rein- forcement learning,” arXiv preprint arXiv:2407.01704, 2024

    2024 arXiv

  56. [64]

    Preventing gradient attenua- tion in lipschitz constrained convolutional networks,

    Q. Li, S. Haque, C. Anil, J. Lucas, R. B. Grosse, and J.-H. Jacobsen, “Preventing gradient attenua- tion in lipschitz constrained convolutional networks,” Advances in neural information processing systems, vol. 32, 2019

    2019

  57. [65]

    Linear hinge loss and average margin,

    C. Gentile and M. K. Warmuth, “Linear hinge loss and average margin,” Advances in neural infor- mation processing systems, vol. 11, 1998

    1998

  58. [66]

    Classification with a reject option using a hinge loss.,

    P . L. Bartlett and M. H. Wegkamp, “Classification with a reject option using a hinge loss.,”Journal of Machine Learning Research , vol. 9, no. 8, 2008

    2008

  59. [67]

    Self-attention generative adversarial net- works,

    H. Zhang, I. Goodfellow, D. Metaxas, and A. Odena, “Self-attention generative adversarial net- works,” in International conference on machine learning , pp. 7354–7363, PMLR, 2019

    2019

  60. [68]

    Conditional generative adversarial nets,

    M. Mirza, “Conditional generative adversarial nets,” arXiv preprint arXiv:1411.1784, 2014

    2014 arXiv

  61. [69]

    High-resolution image syn- thesis and semantic manipulation with conditional gans,

    T .-C. Wang, M.-Y . Liu, J.-Y . Zhu, A. Tao, J. Kautz, and B. Catanzaro, “High-resolution image syn- thesis and semantic manipulation with conditional gans,” in Proceedings of the IEEE conference on computer vision and pattern recognition , pp. 8798–8807, 2018

    2018

  62. [70]

    Gan compression: Efficient architectures for interactive conditional gans,

    M. Li, J. Lin, Y . Ding, Z. Liu, J.-Y . Zhu, and S. Han, “Gan compression: Efficient architectures for interactive conditional gans,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 5284–5294, 2020

    2020

  63. [71]

    On the evaluation of conditional gans,

    T . DeVries, A. Romero, L. Pineda, G. W. Taylor, and M. Drozdzal, “On the evaluation of conditional gans,” arXiv preprint arXiv:1907.08175, 2019

    1907 arXiv

  64. [72]

    The mnist database of handwritten digit images for machine learning research [best of the web],

    L. Deng, “The mnist database of handwritten digit images for machine learning research [best of the web],” IEEE signal processing magazine , vol. 29, no. 6, pp. 141–142, 2012

    2012

  65. [73]

    Robustness of conditional gans to noisy labels,

    K. K. Thekumparampil, A. Khetan, Z. Lin, and S. Oh, “Robustness of conditional gans to noisy labels,” Advances in neural information processing systems , vol. 31, 2018

    2018

  66. [74]

    Cvae-gan: fine-grained image generation through asymmetric training,

    J. Bao, D. Chen, F . Wen, H. Li, and G. Hua, “Cvae-gan: fine-grained image generation through asymmetric training,” in Proceedings of the IEEE international conference on computer vision , pp. 2745–2754, 2017

    2017

  67. [75]

    Multi-scale multi-class conditional generative ad- versarial network for handwritten character generation,

    J. Liu, C. Gu, J. Wang, G. Youn, and J.-U. Kim, “Multi-scale multi-class conditional generative ad- versarial network for handwritten character generation,” The Journal of Supercomputing, vol. 75, pp. 1922–1940, 2019

    1922

  68. [76]

    Dualgan: Unsupervised dual learning for image-to-image translation,

    Z. Yi, H. Zhang, P . Tan, and M. Gong, “Dualgan: Unsupervised dual learning for image-to-image translation,” in Proceedings of the IEEE international conference on computer vision , pp. 2849– 2857, 2017. 198 BIBLIOGRAPHY

    2017

  69. [77]

    A case study of conditional deep convolutional generative adversarial networks in machine fault diagnosis,

    J. Luo, J. Huang, and H. Li, “A case study of conditional deep convolutional generative adversarial networks in machine fault diagnosis,”Journal of Intelligent Manufacturing, vol. 32, no. 2, pp. 407– 425, 2021

    2021

  70. [78]

    Deep learning,

    Y . LeCun, Y . Bengio, and G. Hinton, “Deep learning,”nature, vol. 521, no. 7553, pp. 436–444, 2015

    2015

  71. [79]

    An introduction to convolutional neural networks,

    K. O’Shea, “An introduction to convolutional neural networks,” arXiv preprint arXiv:1511.08458 , 2015

    2015 arXiv

  72. [80]

    Comparative study of convolution neural networkâĂŹs relu and leaky- relu activation functions,

    A. K. Dubey and V . Jain, “Comparative study of convolution neural networkâĂŹs relu and leaky- relu activation functions,” in Applications of Computing, Automation and Wireless Systems in Electrical Engineering: Proceedings of MARC 2018 , pp. 873–880, Springer, 2019

    2018

  73. [81]

    P . A. Jansson, Deconvolution of images and spectra . Courier Corporation, 2012

    2012

  74. [82]

    Infogan: Interpretable representation learning by information maximizing generative adversarial nets,

    X. Chen, Y . Duan, R. Houthooft, J. Schulman, I. Sutskever, and P . Abbeel, “Infogan: Interpretable representation learning by information maximizing generative adversarial nets,” Advances in neural information processing systems , vol. 29, 2016

    2016

  75. [83]

    Learning plannable representations with causal infogan,

    T . Kurutach, A. Tamar, G. Yang, S. J. Russell, and P . Abbeel, “Learning plannable representations with causal infogan,” Advances in Neural Information Processing Systems , vol. 31, 2018

    2018

  76. [84]

    Dpd-infogan: Differentially private distributed infogan,

    V . Mugunthan, V . Gokul, L. Kagal, and S. Dubnov, “Dpd-infogan: Differentially private distributed infogan,” in Proceedings of the 1st Workshop on Machine Learning and Systems , pp. 1–6, 2021

    2021

  77. [85]

    Deep generative image models using aï£ij laplacian pyramid of adversarial networks,

    E. L. Denton, S. Chintala, R. Fergus, et al., “Deep generative image models using aï£ij laplacian pyramid of adversarial networks,” Advances in neural information processing systems , vol. 28, 2015

    2015

  78. [86]

    Hierarchical generation of molecular graphs using structural motifs,

    W. Jin, R. Barzilay, and T . Jaakkola, “Hierarchical generation of molecular graphs using structural motifs,” in International conference on machine learning , pp. 4839–4848, PMLR, 2020

    2020

  79. [87]

    Photographic text-to-image synthesis with a hierarchically-nested adversarial network,

    Z. Zhang, Y . Xie, and L. Yang, “Photographic text-to-image synthesis with a hierarchically-nested adversarial network,” inProceedings of the IEEE conference on computer vision and pattern recog- nition, pp. 6199–6208, 2018

    2018

  80. [88]

    Grarep: Learning graph representations with global structural informa- tion,

    S. Cao, W. Lu, and Q. Xu, “Grarep: Learning graph representations with global structural informa- tion,” in Proceedings of the 24th ACM international on conference on information and knowledge management, pp. 891–900, 2015

    2015

  81. [89]

    Fast and accurate image super-resolution with deep laplacian pyramid networks,

    W.-S. Lai, J.-B. Huang, N. Ahuja, and M.-H. Yang, “Fast and accurate image super-resolution with deep laplacian pyramid networks,” IEEE transactions on pattern analysis and machine in- telligence, vol. 41, no. 11, pp. 2599–2613, 2018

    2018

  82. [90]

    Which training methods for gans do actually con- verge?,

    L. Mescheder, A. Geiger, and S. Nowozin, “Which training methods for gans do actually con- verge?,” in International conference on machine learning , pp. 3481–3490, PMLR, 2018

    2018

  83. [91]

    Instability and local minima in gan training with kernel discriminators,

    E. Becker, P . Pandit, S. Rangan, and A. K. Fletcher, “Instability and local minima in gan training with kernel discriminators,” Advances in Neural Information Processing Systems , vol. 35, pp. 20300– 20312, 2022

    2022

  84. [92]

    Combating mode collapse in gan training: An empirical analysis using hessian eigenvalues,

    R. Durall, A. Chatzimichailidis, P . Labus, and J. Keuper, “Combating mode collapse in gan training: An empirical analysis using hessian eigenvalues,” arXiv preprint arXiv:2012.09673, 2020. BIBLIOGRAPHY 199

    2012 arXiv

  85. [93]

    Take a close look at mode collapse and vanishing gradient in gan,

    Z. Ding, S. Jiang, and J. Zhao, “Take a close look at mode collapse and vanishing gradient in gan,” in 2022 IEEE 2nd International Conference on Electronic Technology, Communication and Information (ICETCI), pp. 597–602, IEEE, 2022

    2022

  86. [94]

    Mode collapse in generative adversarial networks: An overview,

    Y . Kossale, M. Airaj, and A. Darouichi, “Mode collapse in generative adversarial networks: An overview,” in2022 8th International Conference on Optimization and Applications (ICOA), pp. 1–6, IEEE, 2022

    2022

  87. [95]

    Banach wasserstein gan,

    J. Adler and S. Lunz, “Banach wasserstein gan,” Advances in neural information processing sys- tems, vol. 31, 2018

    2018

  88. [96]

    Improved training of wasser- stein gans,

    I. Gulrajani, F . Ahmed, M. Arjovsky, V . Dumoulin, and A. C. Courville, “Improved training of wasser- stein gans,” Advances in neural information processing systems , vol. 30, 2017

    2017

  89. [97]

    Least squares generative adversarial networks,

    X. Mao, Q. Li, H. Xie, R. Y . Lau, Z. Wang, and S. Paul Smolley, “Least squares generative adversarial networks,” in Proceedings of the IEEE international conference on computer vision , pp. 2794– 2802, 2017

    2017

  90. [98]

    Sorting out lipschitz function approximation,

    C. Anil, J. Lucas, and R. Grosse, “Sorting out lipschitz function approximation,” in International Conference on Machine Learning , pp. 291–301, PMLR, 2019

    2019

  91. [99]

    Least squares generative adversarial networks-based anomaly detection,

    C.-K. Lee, Y .-J. Cheon, and W.-Y . Hwang, “Least squares generative adversarial networks-based anomaly detection,” IEEE Access, vol. 10, pp. 26920–26930, 2022

    2022

  92. [100]

    Spectral normalization for generative adver- sarial networks,

    T . Miyato, T . Kataoka, M. Koyama, and Y . Yoshida, “Spectral normalization for generative adver- sarial networks,” arXiv preprint arXiv:1802.05957, 2018

    2018 arXiv

  93. [101]

    Why spectral normalization stabilizes gans: Analysis and improve- ments,

    Z. Lin, V . Sekar, and G. Fanti, “Why spectral normalization stabilizes gans: Analysis and improve- ments,” Advances in neural information processing systems , vol. 34, pp. 9625–9638, 2021

    2021

  94. [102]

    Generalizable adversarial training via spectral normalization,

    F . Farnia, J. M. Zhang, and D. Tse, “Generalizable adversarial training via spectral normalization,” arXiv preprint arXiv:1811.07457, 2018

    2018 arXiv

  95. [103]

    Towards deeper deep reinforcement learning with spectral normalization,

    N. Bjorck, C. P . Gomes, and K. Q. Weinberger, “Towards deeper deep reinforcement learning with spectral normalization,” Advances in neural information processing systems , vol. 34, pp. 8242– 8255, 2021

    2021

  96. [104]

    Modeling the conditional distribution of co-speech upper body gesture jointly using conditional-gan and unrolled-gan,

    B. Wu, C. Liu, C. T . Ishi, and H. Ishiguro, “Modeling the conditional distribution of co-speech upper body gesture jointly using conditional-gan and unrolled-gan,” Electronics, vol. 10, no. 3, p. 228, 2021

    2021

  97. [105]

    Unrolled gan-based oversampling of credit card dataset for fraud detec- tion,

    J. Wang and L. Yao, “Unrolled gan-based oversampling of credit card dataset for fraud detec- tion,” in 2022 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA), pp. 858–861, IEEE, 2022

    2022

  98. [106]

    Unsupervised deep unrolling networks for phase unwrapping,

    Z. Chen, Y . Quan, and H. Ji, “Unsupervised deep unrolling networks for phase unwrapping,” inPro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 25182– 25192, 2024

    2024

  99. [107]

    Pacgan: The power of two samples in generative adver- sarial networks,

    Z. Lin, A. Khetan, G. Fanti, and S. Oh, “Pacgan: The power of two samples in generative adver- sarial networks,” Advances in neural information processing systems , vol. 31, 2018. 200 BIBLIOGRAPHY

    2018

  100. [108]

    Machine learning methods for small data challenges in molecular science,

    B. Dou, Z. Zhu, E. Merkurjev, L. Ke, L. Chen, J. Jiang, Y . Zhu, J. Liu, B. Zhang, and G.-W. Wei, “Machine learning methods for small data challenges in molecular science,” Chemical Reviews, vol. 123, no. 13, pp. 8736–8780, 2023

    2023

  101. [109]

    On the convergence and mode collapse of gan,

    Z. Zhang, M. Li, and J. Yu, “On the convergence and mode collapse of gan,” in SIGGRAPH Asia 2018 Technical Briefs, pp. 1–4, ACM, 2018

    2018

  102. [110]

    Data augmentation in fault diagnosis based on the wasserstein generative adversarial network with gradient penalty,

    X. Gao, F . Deng, and X. Yue, “Data augmentation in fault diagnosis based on the wasserstein generative adversarial network with gradient penalty,” Neurocomputing, vol. 396, pp. 487–494, 2020

    2020

  103. [111]

    Memory replay gans: Learning to generate new categories without forgetting,

    C. Wu, L. Herranz, X. Liu, J. Van De Weijer, B. Raducanu, et al., “Memory replay gans: Learning to generate new categories without forgetting,”Advances in neural information processing systems, vol. 31, 2018

    2018

  104. [112]

    Understanding noise injection in gans,

    R. Feng, D. Zhao, and Z.-J. Zha, “Understanding noise injection in gans,” in international confer- ence on machine learning , pp. 3284–3293, PMLR, 2021

    2021

  105. [113]

    Why gradient clipping accelerates training: A theoret- ical justification for adaptivity,

    J. Zhang, T . He, S. Sra, and A. Jadbabaie, “Why gradient clipping accelerates training: A theoret- ical justification for adaptivity,” arXiv preprint arXiv:1905.11881, 2019

    1905 arXiv

  106. [114]

    Gansim: Conditional facies simulation using an improved pro- gressive growing of generative adversarial networks (gans),

    S. Song, T . Mukerji, and J. Hou, “Gansim: Conditional facies simulation using an improved pro- gressive growing of generative adversarial networks (gans),” Mathematical Geosciences, pp. 1– 32, 2021

    2021

  107. [115]

    Progressive augmentation of gans,

    D. Zhang and A. Khoreva, “Progressive augmentation of gans,” Advances in Neural Information Processing Systems, vol. 32, 2019

    2019

  108. [116]

    An exploratory study on fade-in versus fade-out scaffold- ing for novice programmers in online collaborative programming settings,

    L. Zheng, Y . Zhen, J. Niu, and L. Zhong, “An exploratory study on fade-in versus fade-out scaffold- ing for novice programmers in online collaborative programming settings,”Journal of Computing in Higher Education, vol. 34, no. 2, pp. 489–516, 2022

    2022

  109. [117]

    Efficient super resolution for large-scale images using attentional gan,

    H. N. Pathak, X. Li, S. Minaee, and B. Cowan, “Efficient super resolution for large-scale images using attentional gan,” in 2018 IEEE International Conference on Big Data (Big Data) , pp. 1777– 1786, IEEE, 2018

    2018

  110. [118]

    Texture features and learning similarity,

    W.-Y . Ma and B. S. Manjunath, “Texture features and learning similarity,” in Proceedings CVPR IEEE computer society conference on computer vision and pattern recognition, pp. 425–430, IEEE, 1996

    1996

  111. [119]

    Fine detailed texture learning for 3d meshes with generative models,

    A. Dundar, J. Gao, A. Tao, and B. Catanzaro, “Fine detailed texture learning for 3d meshes with generative models,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2023

    2023

  112. [120]

    Large scale adversarial representation learning,

    J. Donahue and K. Simonyan, “Large scale adversarial representation learning,” Advances in neu- ral information processing systems , vol. 32, 2019

    2019

  113. [121]

    Imagenet: A large-scale hierarchical image database,

    J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in 2009 IEEE conference on computer vision and pattern recognition , pp. 248– 255, Ieee, 2009

    2009

  114. [122]

    A comprehensive survey on pretrained foundation models: A history from bert to chatgpt,

    C. Zhou, Q. Li, C. Li, J. Yu, Y . Liu, G. Wang, K. Zhang, C. Ji, Q. Yan, L. He, et al., “A comprehensive survey on pretrained foundation models: A history from bert to chatgpt,” International Journal of Machine Learning and Cybernetics , pp. 1–65, 2024. BIBLIOGRAPHY 201

    2024

  115. [123]

    Attentive normalization for conditional image generation,

    Y . Wang, Y .-C. Chen, X. Zhang, J. Sun, and J. Jia, “Attentive normalization for conditional image generation,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recog- nition, pp. 5094–5103, 2020

    2020

  116. [124]

    Deep multimodal hashing with orthogonal regularization,

    D. Wang, P . Cui, M. Ou, and W. Zhu, “Deep multimodal hashing with orthogonal regularization,” in Twenty-fourth international joint conference on artificial intelligence , 2015

    2015

  117. [125]

    Attention is all you need,

    A. Vaswani, “Attention is all you need,” Advances in Neural Information Processing Systems, 2017

    2017

  118. [126]

    An adaptive control algorithm for stable training of generative adversarial networks,

    X. Ma, R. Jin, K.-A. Sohn, J.-Y . Paik, and T .-S. Chung, “An adaptive control algorithm for stable training of generative adversarial networks,” IEEE Access, vol. 7, pp. 184103–184114, 2019

    2019

  119. [127]

    A survey on data-efficient algorithms in big data era,

    A. Adadi, “A survey on data-efficient algorithms in big data era,” Journal of Big Data , vol. 8, no. 1, p. 24, 2021

    2021

  120. [128]

    Transformers in vision: A survey,

    S. Khan, M. Naseer, M. Hayat, S. W. Zamir, F . S. Khan, and M. Shah, “Transformers in vision: A survey,” ACM computing surveys (CSUR) , vol. 54, no. 10s, pp. 1–41, 2022

    2022

  121. [129]

    Deep generative modelling: A compar- ative review of vaes, gans, normalizing flows, energy-based and autoregressive models,

    S. Bond-Taylor, A. Leach, Y . Long, and C. G. Willcocks, “Deep generative modelling: A compar- ative review of vaes, gans, normalizing flows, energy-based and autoregressive models,” IEEE transactions on pattern analysis and machine intelligence , vol. 44, no. 11, pp. 7327–7347, 2021

    2021

  122. [130]

    Image2stylegan: How to embed images into the stylegan latent space?,

    R. Abdal, Y . Qin, and P . Wonka, “Image2stylegan: How to embed images into the stylegan latent space?,” in Proceedings of the IEEE/CVF international conference on computer vision , pp. 4432– 4441, 2019

    2019

  123. [131]

    Arbitrary style transfer in real-time with adaptive instance normal- ization,

    X. Huang and S. Belongie, “Arbitrary style transfer in real-time with adaptive instance normal- ization,” in Proceedings of the IEEE international conference on computer vision , pp. 1501–1510, 2017

    2017

  124. [132]

    Transfer learning from synthetic to real-noise de- noising with adaptive instance normalization,

    Y . Kim, J. W. Soh, G. Y . Park, and N. I. Cho, “Transfer learning from synthetic to real-noise de- noising with adaptive instance normalization,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 3482–3492, 2020

    2020

  125. [133]

    Dynamic instance normalization for arbitrary style transfer,

    Y . Jing, X. Liu, Y . Ding, X. Wang, E. Ding, M. Song, and S. Wen, “Dynamic instance normalization for arbitrary style transfer,” inProceedings of the AAAI conference on artificial intelligence, vol. 34, pp. 4369–4376, 2020

    2020

  126. [134]

    Styleswin: Transformer- based gan for high-resolution image generation,

    B. Zhang, S. Gu, B. Zhang, J. Bao, D. Chen, F . Wen, Y . Wang, and B. Guo, “Styleswin: Transformer- based gan for high-resolution image generation,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 11304–11314, 2022

    2022

  127. [135]

    Deep feature interpolation for image content changes,

    P . Upchurch, J. Gardner, G. Pleiss, R. Pless, N. Snavely, K. Bala, and K. Weinberger, “Deep feature interpolation for image content changes,” in Proceedings of the IEEE conference on computer vision and pattern recognition , pp. 7064–7073, 2017

    2017

  128. [136]

    State-of-the-art in the architecture, methods and applications of stylegan,

    A. H. Bermano, R. Gal, Y . Alaluf, R. Mokady, Y . Nitzan, O. Tov, O. Patashnik, and D. Cohen-Or, “State-of-the-art in the architecture, methods and applications of stylegan,” inComputer Graphics Forum, vol. 41, pp. 591–611, Wiley Online Library, 2022

    2022

  129. [137]

    Hyperstyle: Stylegan inversion with hyper- networks for real image editing,

    Y . Alaluf, O. Tov, R. Mokady, R. Gal, and A. Bermano, “Hyperstyle: Stylegan inversion with hyper- networks for real image editing,” in Proceedings of the IEEE/CVF conference on computer Vision and pattern recognition, pp. 18511–18521, 2022. 202 BIBLIOGRAPHY

    2022

  130. [138]

    Styleclip: Text-driven manipu- lation of stylegan imagery,

    O. Patashnik, Z. Wu, E. Shechtman, D. Cohen-Or, and D. Lischinski, “Styleclip: Text-driven manipu- lation of stylegan imagery,” inProceedings of the IEEE/CVF international conference on computer vision, pp. 2085–2094, 2021

    2021

  131. [139]

    Gan-based facial attribute manipulation,

    Y . Liu, Q. Li, Q. Deng, Z. Sun, and M.-H. Yang, “Gan-based facial attribute manipulation,” IEEE transactions on pattern analysis and machine intelligence , 2023

    2023

  132. [140]

    Content and style disentanglement for artistic style transfer,

    D. Kotovenko, A. Sanakoyeu, S. Lang, and B. Ommer, “Content and style disentanglement for artistic style transfer,” in Proceedings of the IEEE/CVF international conference on computer vi- sion, pp. 4422–4431, 2019

    2019

  133. [141]

    Generative adversarial networks (gans): In- troduction, taxonomy, variants, limitations, and applications,

    P . Sharma, M. Kumar, H. K. Sharma, and S. M. Biju, “Generative adversarial networks (gans): In- troduction, taxonomy, variants, limitations, and applications,”Multimedia Tools and Applications, pp. 1–48, 2024

    2024

  134. [142]

    Image-to-image translation with conditional adversar- ial networks,

    P . Isola, J.-Y . Zhu, T . Zhou, and A. A. Efros, “Image-to-image translation with conditional adversar- ial networks,” in Proceedings of the IEEE conference on computer vision and pattern recognition , pp. 1125–1134, 2017

    2017

  135. [143]

    Enhanced pix2pix dehazing network,

    Y . Qu, Y . Chen, J. Huang, and Y . Xie, “Enhanced pix2pix dehazing network,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 8160–8168, 2019

    2019

  136. [144]

    Cyclegan, a master of steganography,

    C. Chu, A. Zhmoginov, and M. Sandler, “Cyclegan, a master of steganography,” arXiv preprint arXiv:1712.02950, 2017

    2017 arXiv

  137. [145]

    Image-to-image translation: Methods and applications,

    Y . Pang, J. Lin, T . Qin, and Z. Chen, “Image-to-image translation: Methods and applications,”IEEE Transactions on Multimedia, vol. 24, pp. 3859–3881, 2021

    2021

  138. [146]

    Transformation consistency regularization–a semi-supervised paradigm for image-to-image translation,

    A. Mustafa and R. K. Mantiuk, “Transformation consistency regularization–a semi-supervised paradigm for image-to-image translation,” in Computer Vision–ECCV 2020: 16th European Con- ference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XVIII 16 , pp. 599–615, Springer, 2020

    2020

  139. [147]

    Zero-reference deep curve estima- tion for low-light image enhancement,

    C. Guo, C. Li, J. Guo, C. C. Loy, J. Hou, S. Kwong, and R. Cong, “Zero-reference deep curve estima- tion for low-light image enhancement,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 1780–1789, 2020

    2020

  140. [148]

    U-net: Convolutional networks for biomedical image seg- mentation,

    O. Ronneberger, P . Fischer, and T . Brox, “U-net: Convolutional networks for biomedical image seg- mentation,” in Medical image computing and computer-assisted intervention–MICCAI 2015: 18th international conference, Munich, Germany, October 5-9, 2015, proceedings, part III 1...

    2015

  141. [149]

    U-net v2: Rethinking the skip connections of u-net for medical image segmentation,

    Y . Peng, M. Sonka, and D. Z. Chen, “U-net v2: Rethinking the skip connections of u-net for medical image segmentation,” arXiv preprint arXiv:2311.17791, 2023

    2023 arXiv

  142. [150]

    Unpaired image-to-image translation using cycle- consistent adversarial networks,

    J.-Y . Zhu, T . Park, P . Isola, and A. A. Efros, “Unpaired image-to-image translation using cycle- consistent adversarial networks,” in Proceedings of the IEEE international conference on com- puter vision, pp. 2223–2232, 2017

    2017

  143. [151]

    Photo-realistic single image super-resolution using a generative adversarial net- work. arxiv 2016,

    C. Ledig, L. Theis, F . Huszar, J. Caballero, A. Cunningham, A. Acosta, A. Aitken, A. Tejani, J. Totz, Z. Wang, et al., “Photo-realistic single image super-resolution using a generative adversarial net- work. arxiv 2016,” arXiv preprint arXiv:1609.04802, 2016. BIBLIOGRAPHY 203

    2016 arXiv

  144. [152]

    Improved srgan for remote sensing image super-resolution across locations and sensors,

    Y . Xiong, S. Guo, J. Chen, X. Deng, L. Sun, X. Zheng, and W. Xu, “Improved srgan for remote sensing image super-resolution across locations and sensors,” Remote Sensing, vol. 12, no. 8, p. 1263, 2020

    2020

  145. [153]

    Very deep convolutional networks for large-scale image recognition,

    K. Simonyan, “Very deep convolutional networks for large-scale image recognition,”arXiv preprint arXiv:1409.1556, 2014

    2014 arXiv

  146. [154]

    Deep residual learning for image recognition,

    K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition , pp. 770–778, 2016

    2016

  147. [155]

    Esrgan: Enhanced super-resolution generative adversarial networks,

    X. Wang, K. Yu, S. Wu, J. Gu, Y . Liu, C. Dong, Y . Qiao, and C. Change Loy, “Esrgan: Enhanced super-resolution generative adversarial networks,” in Proceedings of the European conference on computer vision (ECCV) workshops , pp. 0–0, 2018

    2018

  148. [156]

    Learning a probabilistic latent space of object shapes via 3d generative-adversarial modeling,

    J. Wu, C. Zhang, T . Xue, B. Freeman, and J. Tenenbaum, “Learning a probabilistic latent space of object shapes via 3d generative-adversarial modeling,” Advances in neural information process- ing systems, vol. 29, 2016

    2016

  149. [157]

    Improved adversarial systems for 3d object generation and recon- struction,

    E. J. Smith and D. Meger, “Improved adversarial systems for 3d object generation and recon- struction,” in Conference on Robot Learning , pp. 87–96, PMLR, 2017

    2017

  150. [158]

    Efficient geometry-aware 3d generative adversarial networks,

    E. R. Chan, C. Z. Lin, M. A. Chan, K. Nagano, B. Pan, S. De Mello, O. Gallo, L. J. Guibas, J. Tremblay, S. Khamis, et al., “Efficient geometry-aware 3d generative adversarial networks,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 1...

    2022

  151. [159]

    Neural sparse voxel fields,

    L. Liu, J. Gu, K. Zaw Lin, T .-S. Chua, and C. Theobalt, “Neural sparse voxel fields,” Advances in Neural Information Processing Systems , vol. 33, pp. 15651–15663, 2020

    2020

  152. [160]

    Optimal decisions from probabilistic models: the intersection-over-union case,

    S. Nowozin, “Optimal decisions from probabilistic models: the intersection-over-union case,” in Proceedings of the IEEE conference on computer vision and pattern recognition , pp. 548–555, 2014

    2014

  153. [161]

    tempogan: A temporally coherent, volumetric gan for super-resolution fluid flow,

    Y . Xie, E. Franz, M. Chu, and N. Thuerey, “tempogan: A temporally coherent, volumetric gan for super-resolution fluid flow,” ACM Transactions on Graphics (TOG), vol. 37, no. 4, pp. 1–15, 2018

    2018

  154. [162]

    Generative adversarial text to image synthesis,

    S. Reed, Z. Akata, X. Yan, L. Logeswaran, B. Schiele, and H. Lee, “Generative adversarial text to image synthesis,” in International conference on machine learning , pp. 1060–1069, PMLR, 2016

    2016

  155. [163]

    Stackgan: Text to photo- realistic image synthesis with stacked generative adversarial networks,

    H. Zhang, T . Xu, H. Li, S. Zhang, X. Wang, X. Huang, and D. N. Metaxas, “Stackgan: Text to photo- realistic image synthesis with stacked generative adversarial networks,” in Proceedings of the IEEE international conference on computer vision , pp. 5907–5915, 2017

    2017

  156. [164]

    Attngan: Fine-grained text to image generation with attentional generative adversarial networks,

    T . Xu, P . Zhang, Q. Huang, H. Zhang, Z. Gan, X. Huang, and X. He, “Attngan: Fine-grained text to image generation with attentional generative adversarial networks,” 2017

    2017

  157. [165]

    Coarse-to-fine latent diffusion for pose-guided person image synthesis,

    Y . Lu, M. Zhang, A. J. Ma, X. Xie, and J. Lai, “Coarse-to-fine latent diffusion for pose-guided person image synthesis,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 6420–6429, 2024

    2024

  158. [166]

    Temporal generative adversarial nets with singular value clipping,

    M. Saito, E. Matsumoto, and S. Saito, “Temporal generative adversarial nets with singular value clipping,” inProceedings of the IEEE international conference on computer vision, pp. 2830–2839, 2017. 204 BIBLIOGRAPHY

    2017

  159. [167]

    Mocogan: Decomposing motion and content for video generation,

    S. Tulyakov, M.-Y . Liu, X. Yang, and J. Kautz, “Mocogan: Decomposing motion and content for video generation,” 2017

    2017

  160. [168]

    A survey on long video generation: Challenges, methods, and prospects,

    C. Li, D. Huang, Z. Lu, Y . Xiao, Q. Pei, and L. Bai, “A survey on long video generation: Challenges, methods, and prospects,” arXiv preprint arXiv:2403.16407, 2024

    2024 arXiv

  161. [169]

    Energy-based generative adversarial network,

    J. Zhao, “Energy-based generative adversarial network,” arXiv preprint arXiv:1609.03126, 2016

    2016 arXiv

  162. [170]

    Adversarial autoencoders,

    A. Makhzani, J. Shlens, N. Jaitly, I. Goodfellow, and B. Frey, “Adversarial autoencoders,” arXiv preprint arXiv:1511.05644, 2015

    2015 arXiv

  163. [171]

    Adversarial feature learning,

    J. Donahue, P . Krähenbühl, and T . Darrell, “Adversarial feature learning,” arXiv preprint arXiv:1605.09782, 2016

    2016 arXiv

  164. [172]

    Tutorial on variational autoencoders,

    C. Doersch, “Tutorial on variational autoencoders,” arXiv preprint arXiv:1606.05908, 2016

    2016 arXiv

  165. [173]

    Cross-domain image classification through neural-style transfer data aug- mentation,

    Y . Xu and A. Goel, “Cross-domain image classification through neural-style transfer data aug- mentation,” arXiv preprint arXiv:1910.05611, 2019

    1910 arXiv

  166. [174]

    Neural style transfer: A review,

    Y . Jing, Y . Yang, Z. Feng, J. Ye, Y . Yu, and M. Song, “Neural style transfer: A review,”IEEE transac- tions on visualization and computer graphics , vol. 26, no. 11, pp. 3365–3385, 2019

    2019

  167. [175]

    Videogigagan: Towards detail-rich video super-resolution,

    Y . Xu, T . Park, R. Zhang, Y . Zhou, E. Shechtman, F . Liu, J.-B. Huang, and D. Liu, “Videogigagan: Towards detail-rich video super-resolution,” arXiv preprint arXiv:2404.12388, 2024

    2024 arXiv

  168. [176]

    Coherent online video style transfer,

    D. Chen, J. Liao, L. Yuan, N. Yu, and G. Hua, “Coherent online video style transfer,” in Proceedings of the IEEE International Conference on Computer Vision , pp. 1105–1114, 2017

    2017

  169. [177]

    Video generative adversarial net- works: a review,

    N. Aldausari, A. Sowmya, N. Marcus, and G. Mohammadi, “Video generative adversarial net- works: a review,” ACM Computing Surveys (CSUR) , vol. 55, no. 2, pp. 1–25, 2022

    2022

  170. [178]

    Generating long videos of dynamic scenes,

    T . Brooks, J. Hellsten, M. Aittala, T .-C. Wang, T . Aila, J. Lehtinen, M.-Y . Liu, A. Efros, and T . Kar- ras, “Generating long videos of dynamic scenes,” Advances in Neural Information Processing Systems, vol. 35, pp. 31769–31781, 2022

    2022

  171. [179]

    Wavegan: Frequency-aware gan for high-fidelity few-shot image generation,

    M. Yang, Z. Wang, Z. Chi, and W. Feng, “Wavegan: Frequency-aware gan for high-fidelity few-shot image generation,” in European Conference on Computer Vision , pp. 1–17, Springer, 2022

    2022

  172. [180]

    A survey on text generation using generative adversarial networks,

    G. H. De Rosa and J. P . Papa, “A survey on text generation using generative adversarial networks,” Pattern Recognition, vol. 119, p. 108098, 2021

    2021

  173. [181]

    Advances in natural language processing,

    J. Hirschberg and C. D. Manning, “Advances in natural language processing,” Science, vol. 349, no. 6245, pp. 261–266, 2015

    2015

  174. [182]

    Audio engineering and psychoacoustics: Matching signals to the final receiver, the human auditory system,

    E. Zwicker and U. T . Zwicker, “Audio engineering and psychoacoustics: Matching signals to the final receiver, the human auditory system,”Journal of the Audio Engineering Society, vol. 39, no. 3, pp. 115–126, 1991

    1991

  175. [183]

    Reliable federated learning with gan model for robust and resilient future healthcare system,

    A. Murmu, P . Kumar, N. R. Moparthi, S. Namasudra, and P . Lorenz, “Reliable federated learning with gan model for robust and resilient future healthcare system,” IEEE Transactions on Network and Service Management, 2024. BIBLIOGRAPHY 205

    2024

  176. [184]

    Commongen: A constrained text generation challenge for generative commonsense reasoning,

    B. Y . Lin, W. Zhou, M. Shen, P . Zhou, C. Bhagavatula, Y . Choi, and X. Ren, “Commongen: A constrained text generation challenge for generative commonsense reasoning,” arXiv preprint arXiv:1911.03705, 2019

    1911 arXiv

  177. [185]

    Seqgan: Sequence generative adversarial nets with policy gradient,

    L. Yu, W. Zhang, J. Wang, and Y . Yu, “Seqgan: Sequence generative adversarial nets with policy gradient,” in Proceedings of the AAAI conference on artificial intelligence , vol. 31, 2017

    2017

  178. [186]

    Adversarial feature matching for text generation,

    Y . Zhang, Z. Gan, K. Fan, Z. Chen, R. Henao, D. Shen, and L. Carin, “Adversarial feature matching for text generation,” inInternational conference on machine learning, pp. 4006–4015, PMLR, 2017

    2017

  179. [187]

    Reinforcement learning: A survey,

    L. P . Kaelbling, M. L. Littman, and A. W. Moore, “Reinforcement learning: A survey,” Journal of artificial intelligence research, vol. 4, pp. 237–285, 1996

    1996

  180. [188]

    A survey of monte carlo tree search methods,

    C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P . I. Cowling, P . Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton, “A survey of monte carlo tree search methods,” IEEE Transactions on Computational Intelligence and AI in games , vol. 4, no. 1, pp. 1–43, 2012

    2012

  181. [189]

    Integrated visual transformer and flash attention for lip-to- speech generation gan,

    Q. Yang, Y . Bai, F . Liu, and W. Zhang, “Integrated visual transformer and flash attention for lip-to- speech generation gan,” Scientific Reports, vol. 14, no. 1, p. 4525, 2024

    2024

  182. [190]

    Adversarial audio synthesis,

    C. Donahue, J. McAuley, and M. Puckette, “Adversarial audio synthesis,” arXiv preprint arXiv:1802.04208, 2018

    2018 arXiv

  183. [191]

    Melgan: Generative adversarial networks for conditional waveform synthe- sis,

    K. Kumar, R. Kumar, T . De Boissiere, L. Gestin, W. Z. Teoh, J. Sotelo, A. De Brebisson, Y . Bengio, and A. C. Courville, “Melgan: Generative adversarial networks for conditional waveform synthe- sis,” Advances in neural information processing systems , vol. 32, 2019

    2019

  184. [192]

    Deep learning for medical image processing: Overview, chal- lenges and the future,

    M. I. Razzak, S. Naz, and A. Zaib, “Deep learning for medical image processing: Overview, chal- lenges and the future,” Classification in BioApps: Automation of decision making , pp. 323–350, 2018

    2018

  185. [193]

    Pseudo training data generation for unsupervised cell membrane segmentation in immunohistochemistry images,

    X. Long, T . Wang, Y . Kan, Y . Wang, S. Chen, A. Zhou, X. Hou, and J. Liu, “Pseudo training data generation for unsupervised cell membrane segmentation in immunohistochemistry images,” in IEEE International Conference on Bioinformatics and Biomedicine 2024 , 2024

    2024

  186. [194]

    Challenges of medical image processing,

    I. Scholl, T . Aach, T . M. Deserno, and T . Kuhlen, “Challenges of medical image processing,”Com- puter science-Research and development , vol. 26, pp. 5–13, 2011

    2011

  187. [195]

    Ct super- resolution gan constrained by the identical, residual, and cycle learning ensemble (gan-circle),

    C. You, G. Li, Y . Zhang, X. Zhang, H. Shan, M. Li, S. Ju, Z. Zhao, Z. Zhang, W. Cong, et al., “Ct super- resolution gan constrained by the identical, residual, and cycle learning ensemble (gan-circle),” IEEE transactions on medical imaging , vol. 39, no. 1, pp. 188–203, 2019

    2019

  188. [196]

    Do 2d gans know 3d shape? unsupervised 3d shape reconstruction from 2d image gans,

    X. Pan, B. Dai, Z. Liu, C. C. Loy, and P . Luo, “Do 2d gans know 3d shape? unsupervised 3d shape reconstruction from 2d image gans,” arXiv preprint arXiv:2011.00844, 2020

    2011 arXiv

  189. [197]

    A novel alzheimerâĂŹs disease detection approach using gan-based brain slice image enhancement,

    T . Bai, M. Du, L. Zhang, L. Ren, L. Ruan, Y . Yang, G. Qian, Z. Meng, L. Zhao, and M. J. Deen, “A novel alzheimerâĂŹs disease detection approach using gan-based brain slice image enhancement,” Neurocomputing, vol. 492, pp. 353–369, 2022

    2022

  190. [198]

    Gan-based anomaly detection: A review,

    X. Xia, X. Pan, N. Li, X. He, L. Ma, X. Zhang, and N. Ding, “Gan-based anomaly detection: A review,” Neurocomputing, vol. 493, pp. 497–535, 2022. 206 BIBLIOGRAPHY

    2022

  191. [199]

    Semantic-aware grad-gan for virtual-to-real urban scene adaption,

    P . Li, X. Liang, D. Jia, and E. P . Xing, “Semantic-aware grad-gan for virtual-to-real urban scene adaption,” arXiv preprint arXiv:1801.01726, 2018

    2018 arXiv

  192. [200]

    Sp-gan: Sphere-guided 3d shape generation and manipula- tion,

    R. Li, X. Li, K.-H. Hui, and C.-W. Fu, “Sp-gan: Sphere-guided 3d shape generation and manipula- tion,” ACM Transactions on Graphics (TOG), vol. 40, no. 4, pp. 1–12, 2021

    2021

  193. [201]

    Vox2vox: 3d-gan for brain tumour segmentation,

    M. D. Cirillo, D. Abramian, and A. Eklund, “Vox2vox: 3d-gan for brain tumour segmentation,” in Brainlesion: Glioma, Multiple Sclerosis, Stroke and Traumatic Brain Injuries: 6th International Workshop, BrainLes 2020, Held in Conjunction with MICCAI 2020, Lima, Peru, October 4, ...

    2020

  194. [202]

    3d gan inversion with pose optimization,

    J. Ko, K. Cho, D. Choi, K. Ryoo, and S. Kim, “3d gan inversion with pose optimization,” in Proceed- ings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pp. 2967–2976, 2023

    2023

  195. [203]

    Realistic and textured terrain generation using gans,

    r. r. spick and j. walker, “Realistic and textured terrain generation using gans,” in Proceedings of the 16th ACM SIGGRAPH European Conference on Visual Media Production , pp. 1–10, 2019

    2019

  196. [204]

    A gan-like approach for physics-based imitation learning and inter- active character control,

    P . Xu and I. Karamouzas, “A gan-like approach for physics-based imitation learning and inter- active character control,” Proceedings of the ACM on Computer Graphics and Interactive Tech- niques, vol. 4, no. 3, pp. 1–22, 2021

    2021

  197. [205]

    Research on role modeling and behavior control of virtual reality animation interactive system in internet of things,

    B. Gan, C. Zhang, Y . Chen, and Y .-C. Chen, “Research on role modeling and behavior control of virtual reality animation interactive system in internet of things,” Journal of Real-Time Image Processing, vol. 18, no. 4, pp. 1069–1083, 2021

    2021

  198. [206]

    Compositional transformers for scene generation,

    D. Arad Hudson and L. Zitnick, “Compositional transformers for scene generation,” Advances in neural information processing systems , vol. 34, pp. 9506–9520, 2021

    2021

  199. [207]

    Local attention pyramid for scene image genera- tion,

    S.-H. Shim, S. Hyun, D. Bae, and J.-P . Heo, “Local attention pyramid for scene image genera- tion,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 7774–7782, 2022

    2022

  200. [208]

    Self-supervised learning: Gener- ative or contrastive,

    X. Liu, F . Zhang, Z. Hou, L. Mian, Z. Wang, J. Zhang, and J. Tang, “Self-supervised learning: Gener- ative or contrastive,”IEEE transactions on knowledge and data engineering, vol. 35, no. 1, pp. 857– 876, 2021

    2021

  201. [209]

    A very preliminary analysis of dall-e 2,

    G. Marcus, E. Davis, and S. Aaronson, “A very preliminary analysis of dall-e 2,” arXiv preprint arXiv:2204.13807, 2022

    2022 arXiv

  202. [210]

    Learning transferable visual models from natural language supervision,

    A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, G. Sastry, A. Askell, P . Mishkin, J. Clark, et al., “Learning transferable visual models from natural language supervision,” in Inter- national conference on machine learning , pp. 8748–8763, PMLR, 2021

    2021

  203. [211]

    Language models are few-shot learners,

    T . Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P . Dhariwal, A. Neelakantan, P . Shyam, G. Sastry, A. Askell, et al., “Language models are few-shot learners,” Advances in neural informa- tion processing systems, vol. 33, pp. 1877–1901, 2020

    1901

  204. [212]

    Generative adversarial networks (gans) challenges, solutions, and future directions,

    D. Saxena and J. Cao, “Generative adversarial networks (gans) challenges, solutions, and future directions,” ACM Computing Surveys (CSUR) , vol. 54, no. 3, pp. 1–42, 2021

    2021

  205. [213]

    Recent progress on generative adversarial networks (gans): A survey,

    Z. Pan, W. Yu, X. Yi, A. Khan, F . Yuan, and Y . Zheng, “Recent progress on generative adversarial networks (gans): A survey,” IEEE access, vol. 7, pp. 36322–36333, 2019. BIBLIOGRAPHY 207

    2019

  206. [214]

    Privacy-protective-gan for privacy preserving face de- identification,

    Y . Wu, F . Yang, Y . Xu, and H. Ling, “Privacy-protective-gan for privacy preserving face de- identification,” Journal of Computer Science and Technology , vol. 34, pp. 47–60, 2019

    2019

  207. [215]

    Subverting privacy-preserving gans: Hiding secrets in sanitized im- ages,

    K. Liu, B. Tan, and S. Garg, “Subverting privacy-preserving gans: Hiding secrets in sanitized im- ages,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, pp. 14849–14856, 2021

    2021

  208. [216]

    Communication-efficient learning of deep networks from decentralized data,

    B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Artificial intelligence and statistics , pp. 1273–1282, PMLR, 2017

    2017

  209. [217]

    A survey on federated learning,

    C. Zhang, Y . Xie, H. Bai, B. Yu, W. Li, and Y . Gao, “A survey on federated learning,”Knowledge-Based Systems, vol. 216, p. 106775, 2021

    2021

  210. [218]

    Progressive distillation for fast sampling of diffusion models,

    T . Salimans and J. Ho, “Progressive distillation for fast sampling of diffusion models,” arXiv preprint arXiv:2202.00512, 2022

    2022 arXiv

  211. [219]

    Reinforcement learning: An introduction 1st edition,

    R. Sutton and A. Barto, “Reinforcement learning: An introduction 1st edition,” Exp. Psychol. Learn. Mem. Cogn, vol. 30, pp. 1302–1321, 1998

    1998

  212. [220]

    R. S. Sutton and A. G. Barto, Reinforcement learning: An introduction . MIT press, 2018

    2018

  213. [221]

    Reinforcement learning,

    M. A. Wiering and M. Van Otterlo, “Reinforcement learning,” Adaptation, learning, and optimiza- tion, vol. 12, no. 3, p. 729, 2012

    2012

  214. [222]

    Rl-gan-net: A reinforcement learning agent controlled gan network for real-time point cloud shape completion,

    M. Sarmad, H. J. Lee, and Y . M. Kim, “Rl-gan-net: A reinforcement learning agent controlled gan network for real-time point cloud shape completion,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 5898–5907, 2019

    2019

  215. [223]

    Diffusion models in vision: A survey,

    F .-A. Croitoru, V . Hondru, R. T . Ionescu, and M. Shah, “Diffusion models in vision: A survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 9, pp. 10850–10869, 2023

    2023

  216. [224]

    Diffusion models: A comprehensive survey of methods and applications,

    L. Yang, Z. Zhang, Y . Song, S. Hong, R. Xu, Y . Zhao, W. Zhang, B. Cui, and M.-H. Yang, “Diffusion models: A comprehensive survey of methods and applications,”ACM Computing Surveys, vol. 56, no. 4, pp. 1–39, 2023

    2023

  217. [225]

    Variational diffusion models,

    D. Kingma, T . Salimans, B. Poole, and J. Ho, “Variational diffusion models,” Advances in neural information processing systems, vol. 34, pp. 21696–21707, 2021

    2021

  218. [226]

    Denoising diffusion probabilistic models,

    J. Ho, A. Jain, and P . Abbeel, “Denoising diffusion probabilistic models,” Advances in neural in- formation processing systems, vol. 33, pp. 6840–6851, 2020

    2020

  219. [227]

    Diffused heads: Diffusion models beat gans on talking-face generation,

    M. Stypułkowski, K. Vougioukas, S. He, M. Zięba, S. Petridis, and M. Pantic, “Diffused heads: Diffusion models beat gans on talking-face generation,” in Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pp. 5091–5100, 2024

    2024

  220. [228]

    Video diffusion models,

    J. Ho, T . Salimans, A. Gritsenko, W. Chan, M. Norouzi, and D. J. Fleet, “Video diffusion models,” Advances in Neural Information Processing Systems , vol. 35, pp. 8633–8646, 2022

    2022

  221. [229]

    High-resolution image synthesis with latent diffusion models,

    R. Rombach, A. Blattmann, D. Lorenz, P . Esser, and B. Ommer, “High-resolution image synthesis with latent diffusion models,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 10684–10695, 2022

    2022

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.