Generative Adversarial Networks (GANs) logopeterindia.net
Knowledge Hub

Generative Adversarial Networks (GANs): Papers, Code, Architectures & Applications

Generative adversarial networks — the idea, landmark papers, implementations, applications and learning resources.

48 topics•6 categories•Updated October 2026

What Is a GAN?

7 entries

A generative adversarial network trains two networks against each other: a generator that turns random noise into samples, and a discriminator that tries to tell real data from generated data. The competition pushes the generator toward realistic output. GANs produce sharp images in a single forward pass, but training can be unstable, suffer mode collapse, and is harder to scale than diffusion, which has largely replaced GANs for text-to-image generation while GANs remain useful for fast generation and image-to-image tasks.

Landmark Papers

11 entries

The architectures that defined the field.

Applications: Translation, Super-Resolution & Restoration

6 entries

GANs for image-to-image tasks.

Code, Tutorials & Courses

11 entries

Build and train GANs.

Deepfakes & Content Provenance

3 entries

Risks and countermeasures.

Related Pages

10 entries

Neighbouring pages on this site.

Frequently Asked Questions

What is a GAN?

A generative model made of two networks, a generator and a discriminator, trained against each other so the generator learns to produce realistic samples.

GANs, VAEs or diffusion models?

GANs generate sharp samples in one pass but are harder to train; VAEs train stably and give a latent space; diffusion models give the best quality and diversity for text-to-image and video but need many sampling steps.

Are GANs still used?

Yes, for fast generation, super-resolution, face restoration, image-to-image translation and as perceptual components inside other systems, although diffusion dominates text-to-image generation.

Why are GANs hard to train?

The two networks must stay balanced; problems include mode collapse and unstable gradients, addressed by Wasserstein losses, gradient penalties, spectral normalisation and careful architecture choices.

How current is this list?

Links were checked in October 2026. Archived projects are labelled; sites that block automated checks are kept and may need a manual click.