Shortcuts

DCGAN Tutorial

Author: Nathan Inkawhich Introduction ————

This tutorial will give an introduction to DCGANs through an example. We will train a generative adversarial network (GAN) to generate new celebrities after showing it pictures of many real celebrities. Most of the code here is from the dcgan implementation in pytorch/examples, and this document will give a thorough explanation of the implementation and shed light on how and why this model works. But don’t worry, no prior knowledge of GANs is required, but it may require a first-timer to spend some time reasoning about what is actually happening under the hood. Also, for the sake of time it will help to have a GPU, or two. Lets start from the beginning.

Generative Adversarial Networks

What is a GAN?

GANs are a framework for teaching a DL model to capture the training data’s distribution so we can generate new data from that same distribution. GANs were invented by Ian Goodfellow in 2014 and first described in the paper Generative Adversarial Nets. They are made of two distinct models, a generator and a discriminator. The job of the generator is to spawn ‘fake’ images that look like the training images. The job of the discriminator is to look at an image and output whether or not it is a real training image or a fake image from the generator. During training, the generator is constantly trying to outsmart the discriminator by generating better and better fakes, while the discriminator is working to become a better detective and correctly classify the real and fake images. The equilibrium of this game is when the generator is generating perfect fakes that look as if they came directly from the training data, and the discriminator is left to always guess at 50% confidence that the generator output is real or fake.

Now, lets define some notation to be used throughout tutorial starting with the discriminator. Let \(x\) be data representing an image. \(D(x)\) is the discriminator network which outputs the (scalar) probability that \(x\) came from training data rather than the generator. Here, since we are dealing with images, the input to \(D(x)\) is an image of CHW size 3x64x64. Intuitively, \(D(x)\) should be HIGH when \(x\) comes from training data and LOW when \(x\) comes from the generator. \(D(x)\) can also be thought of as a traditional binary classifier.

For the generator’s notation, let \(z\) be a latent space vector sampled from a standard normal distribution. \(G(z)\) represents the generator function which maps the latent vector \(z\) to data-space. The goal of \(G\) is to estimate the distribution that the training data comes from (\(p_{data}\)) so it can generate fake samples from that estimated distribution (\(p_g\)).

So, \(D(G(z))\) is the probability (scalar) that the output of the generator \(G\) is a real image. As described in Goodfellow’s paper, \(D\) and \(G\) play a minimax game in which \(D\) tries to maximize the probability it correctly classifies reals and fakes (\(logD(x)\)), and \(G\) tries to minimize the probability that \(D\) will predict its outputs are fake (\(log(1-D(G(z)))\)). From the paper, the GAN loss function is

\[\underset{G}{\text{min}} \underset{D}{\text{max}}V(D,G) = \mathbb{E}_{x\sim p_{data}(x)}\big[logD(x)\big] + \mathbb{E}_{z\sim p_{z}(z)}\big[log(1-D(G(z)))\big] \]

In theory, the solution to this minimax game is where \(p_g = p_{data}\), and the discriminator guesses randomly if the inputs are real or fake. However, the convergence theory of GANs is still being actively researched and in reality models do not always train to this point.

What is a DCGAN?

A DCGAN is a direct extension of the GAN described above, except that it explicitly uses convolutional and convolutional-transpose layers in the discriminator and generator, respectively. It was first described by Radford et. al. in the paper Unsupervised Representation Learning With Deep Convolutional Generative Adversarial Networks. The discriminator is made up of strided convolution layers, batch norm layers, and LeakyReLU activations. The input is a 3x64x64 input image and the output is a scalar probability that the input is from the real data distribution. The generator is comprised of convolutional-transpose layers, batch norm layers, and ReLU activations. The input is a latent vector, \(z\), that is drawn from a standard normal distribution and the output is a 3x64x64 RGB image. The strided conv-transpose layers allow the latent vector to be transformed into a volume with the same shape as an image. In the paper, the authors also give some tips about how to setup the optimizers, how to calculate the loss functions, and how to initialize the model weights, all of which will be explained in the coming sections.

from __future__ import print_function
#%matplotlib inline
import argparse
import os
import random
import torch
import torch.nn as nn
import torch.nn.parallel
import torch.backends.cudnn as cudnn
import torch.optim as optim
import torch.utils.data
import torchvision.datasets as dset
import torchvision.transforms as transforms
import torchvision.utils as vutils
import numpy as np
import matplotlib.pyplot as plt
import matplotlib.animation as animation
from IPython.display import HTML

# Set random seed for reproducibility
manualSeed = 999
#manualSeed = random.randint(1, 10000) # use if you want new results
print("Random Seed: ", manualSeed)
random.seed(manualSeed)
torch.manual_seed(manualSeed)

Out:

Random Seed:  999

Inputs

Let’s define some inputs for the run:

  • dataroot - the path to the root of the dataset folder. We will talk more about the dataset in the next section
  • workers - the number of worker threads for loading the data with the DataLoader
  • batch_size - the batch size used in training. The DCGAN paper uses a batch size of 128
  • image_size - the spatial size of the images used for training. This implementation defaults to 64x64. If another size is desired, the structures of D and G must be changed. See here for more details
  • nc - number of color channels in the input images. For color images this is 3
  • nz - length of latent vector
  • ngf - relates to the depth of feature maps carried through the generator
  • ndf - sets the depth of feature maps propagated through the discriminator
  • num_epochs - number of training epochs to run. Training for longer will probably lead to better results but will also take much longer
  • lr - learning rate for training. As described in the DCGAN paper, this number should be 0.0002
  • beta1 - beta1 hyperparameter for Adam optimizers. As described in paper, this number should be 0.5
  • ngpu - number of GPUs available. If this is 0, code will run in CPU mode. If this number is greater than 0 it will run on that number of GPUs
# Root directory for dataset
dataroot = "data/celeba"

# Number of workers for dataloader
workers = 2

# Batch size during training
batch_size = 128

# Spatial size of training images. All images will be resized to this
#   size using a transformer.
image_size = 64

# Number of channels in the training images. For color images this is 3
nc = 3

# Size of z latent vector (i.e. size of generator input)
nz = 100

# Size of feature maps in generator
ngf = 64

# Size of feature maps in discriminator
ndf = 64

# Number of training epochs
num_epochs = 5

# Learning rate for optimizers
lr = 0.0002

# Beta1 hyperparam for Adam optimizers
beta1 = 0.5

# Number of GPUs available. Use 0 for CPU mode.
ngpu = 1

Data

In this tutorial we will use the Celeb-A Faces dataset which can be downloaded at the linked site, or in Google Drive. The dataset will download as a file named img_align_celeba.zip. Once downloaded, create a directory named celeba and extract the zip file into that directory. Then, set the dataroot input for this notebook to the celeba directory you just created. The resulting directory structure should be:

/path/to/celeba
    -> img_align_celeba
        -> 188242.jpg
        -> 173822.jpg
        -> 284702.jpg
        -> 537394.jpg
           ...

This is an important step because we will be using the ImageFolder dataset class, which requires there to be subdirectories in the dataset’s root folder. Now, we can create the dataset, create the dataloader, set the device to run on, and finally visualize some of the training data.

# We can use an image folder dataset the way we have it setup.
# Create the dataset
dataset = dset.ImageFolder(root=dataroot,
                           transform=transforms.Compose([
                               transforms.Resize(image_size),
                               transforms.CenterCrop(image_size),
                               transforms.ToTensor(),
                               transforms.Normalize((0.5, 0.5, 0.5), (0.5, 0.5, 0.5)),
                           ]))
# Create the dataloader
dataloader = torch.utils.data.DataLoader(dataset, batch_size=batch_size,
                                         shuffle=True, num_workers=workers)

# Decide which device we want to run on
device = torch.device("cuda:0" if (torch.cuda.is_available() and ngpu > 0) else "cpu")

# Plot some training images
real_batch = next(iter(dataloader))
plt.figure(figsize=(8,8))
plt.axis("off")
plt.title("Training Images")
plt.imshow(np.transpose(vutils.make_grid(real_batch[0].to(device)[:64], padding=2, normalize=True).cpu(),(1,2,0)))
../_images/sphx_glr_dcgan_faces_tutorial_001.png

Implementation

With our input parameters set and the dataset prepared, we can now get into the implementation. We will start with the weight initialization strategy, then talk about the generator, discriminator, loss functions, and training loop in detail.

Weight Initialization

From the DCGAN paper, the authors specify that all model weights shall be randomly initialized from a Normal distribution with mean=0, stdev=0.02. The weights_init function takes an initialized model as input and reinitializes all convolutional, convolutional-transpose, and batch normalization layers to meet this criteria. This function is applied to the models immediately after initialization.

# custom weights initialization called on netG and netD
def weights_init(m):
    classname = m.__class__.__name__
    if classname.find('Conv') != -1:
        nn.init.normal_(m.weight.data, 0.0, 0.02)
    elif classname.find('BatchNorm') != -1:
        nn.init.normal_(m.weight.data, 1.0, 0.02)
        nn.init.constant_(m.bias.data, 0)

Generator

The generator, \(G\), is designed to map the latent space vector (\(z\)) to data-space. Since our data are images, converting \(z\) to data-space means ultimately creating a RGB image with the same size as the training images (i.e. 3x64x64). In practice, this is accomplished through a series of strided two dimensional convolutional transpose layers, each paired with a 2d batch norm layer and a relu activation. The output of the generator is fed through a tanh function to return it to the input data range of \([-1,1]\). It is worth noting the existence of the batch norm functions after the conv-transpose layers, as this is a critical contribution of the DCGAN paper. These layers help with the flow of gradients during training. An image of the generator from the DCGAN paper is shown below.

dcgan_generator

Notice, how the inputs we set in the input section (nz, ngf, and nc) influence the generator architecture in code. nz is the length of the z input vector, ngf relates to the size of the feature maps that are propagated through the generator, and nc is the number of channels in the output image (set to 3 for RGB images). Below is the code for the generator.

# Generator Code

class Generator(nn.Module):
    def __init__(self, ngpu):
        super(Generator, self).__init__()
        self.ngpu = ngpu
        self.main = nn.Sequential(
            # input is Z, going into a convolution
            nn.ConvTranspose2d( nz, ngf * 8, 4, 1, 0, bias=False),
            nn.BatchNorm2d(ngf * 8),
            nn.ReLU(True),
            # state size. (ngf*8) x 4 x 4
            nn.ConvTranspose2d(ngf * 8, ngf * 4, 4, 2, 1, bias=False),
            nn.BatchNorm2d(ngf * 4),
            nn.ReLU(True),
            # state size. (ngf*4) x 8 x 8
            nn.ConvTranspose2d( ngf * 4, ngf * 2, 4, 2, 1, bias=False),
            nn.BatchNorm2d(ngf * 2),
            nn.ReLU(True),
            # state size. (ngf*2) x 16 x 16
            nn.ConvTranspose2d( ngf * 2, ngf, 4, 2, 1, bias=False),
            nn.BatchNorm2d(ngf),
            nn.ReLU(True),
            # state size. (ngf) x 32 x 32
            nn.ConvTranspose2d( ngf, nc, 4, 2, 1, bias=False),
            nn.Tanh()
            # state size. (nc) x 64 x 64
        )

    def forward(self, input):
        return self.main(input)

Now, we can instantiate the generator and apply the weights_init function. Check out the printed model to see how the generator object is structured.

# Create the generator
netG = Generator(ngpu).to(device)

# Handle multi-gpu if desired
if (device.type == 'cuda') and (ngpu > 1):
    netG = nn.DataParallel(netG, list(range(ngpu)))

# Apply the weights_init function to randomly initialize all weights
#  to mean=0, stdev=0.02.
netG.apply(weights_init)

# Print the model
print(netG)

Out:

Generator(
  (main): Sequential(
    (0): ConvTranspose2d(100, 512, kernel_size=(4, 4), stride=(1, 1), bias=False)
    (1): BatchNorm2d(512, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (2): ReLU(inplace=True)
    (3): ConvTranspose2d(512, 256, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (4): BatchNorm2d(256, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (5): ReLU(inplace=True)
    (6): ConvTranspose2d(256, 128, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (7): BatchNorm2d(128, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (8): ReLU(inplace=True)
    (9): ConvTranspose2d(128, 64, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (10): BatchNorm2d(64, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (11): ReLU(inplace=True)
    (12): ConvTranspose2d(64, 3, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (13): Tanh()
  )
)

Discriminator

As mentioned, the discriminator, \(D\), is a binary classification network that takes an image as input and outputs a scalar probability that the input image is real (as opposed to fake). Here, \(D\) takes a 3x64x64 input image, processes it through a series of Conv2d, BatchNorm2d, and LeakyReLU layers, and outputs the final probability through a Sigmoid activation function. This architecture can be extended with more layers if necessary for the problem, but there is significance to the use of the strided convolution, BatchNorm, and LeakyReLUs. The DCGAN paper mentions it is a good practice to use strided convolution rather than pooling to downsample because it lets the network learn its own pooling function. Also batch norm and leaky relu functions promote healthy gradient flow which is critical for the learning process of both \(G\) and \(D\).

Discriminator Code

class Discriminator(nn.Module):
    def __init__(self, ngpu):
        super(Discriminator, self).__init__()
        self.ngpu = ngpu
        self.main = nn.Sequential(
            # input is (nc) x 64 x 64
            nn.Conv2d(nc, ndf, 4, 2, 1, bias=False),
            nn.LeakyReLU(0.2, inplace=True),
            # state size. (ndf) x 32 x 32
            nn.Conv2d(ndf, ndf * 2, 4, 2, 1, bias=False),
            nn.BatchNorm2d(ndf * 2),
            nn.LeakyReLU(0.2, inplace=True),
            # state size. (ndf*2) x 16 x 16
            nn.Conv2d(ndf * 2, ndf * 4, 4, 2, 1, bias=False),
            nn.BatchNorm2d(ndf * 4),
            nn.LeakyReLU(0.2, inplace=True),
            # state size. (ndf*4) x 8 x 8
            nn.Conv2d(ndf * 4, ndf * 8, 4, 2, 1, bias=False),
            nn.BatchNorm2d(ndf * 8),
            nn.LeakyReLU(0.2, inplace=True),
            # state size. (ndf*8) x 4 x 4
            nn.Conv2d(ndf * 8, 1, 4, 1, 0, bias=False),
            nn.Sigmoid()
        )

    def forward(self, input):
        return self.main(input)

Now, as with the generator, we can create the discriminator, apply the weights_init function, and print the model’s structure.

# Create the Discriminator
netD = Discriminator(ngpu).to(device)

# Handle multi-gpu if desired
if (device.type == 'cuda') and (ngpu > 1):
    netD = nn.DataParallel(netD, list(range(ngpu)))

# Apply the weights_init function to randomly initialize all weights
#  to mean=0, stdev=0.2.
netD.apply(weights_init)

# Print the model
print(netD)

Out:

Discriminator(
  (main): Sequential(
    (0): Conv2d(3, 64, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (1): LeakyReLU(negative_slope=0.2, inplace=True)
    (2): Conv2d(64, 128, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (3): BatchNorm2d(128, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (4): LeakyReLU(negative_slope=0.2, inplace=True)
    (5): Conv2d(128, 256, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (6): BatchNorm2d(256, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (7): LeakyReLU(negative_slope=0.2, inplace=True)
    (8): Conv2d(256, 512, kernel_size=(4, 4), stride=(2, 2), padding=(1, 1), bias=False)
    (9): BatchNorm2d(512, eps=1e-05, momentum=0.1, affine=True, track_running_stats=True)
    (10): LeakyReLU(negative_slope=0.2, inplace=True)
    (11): Conv2d(512, 1, kernel_size=(4, 4), stride=(1, 1), bias=False)
    (12): Sigmoid()
  )
)

Loss Functions and Optimizers

With \(D\) and \(G\) setup, we can specify how they learn through the loss functions and optimizers. We will use the Binary Cross Entropy loss (BCELoss) function which is defined in PyTorch as:

\[\ell(x, y) = L = \{l_1,\dots,l_N\}^\top, \quad l_n = - \left[ y_n \cdot \log x_n + (1 - y_n) \cdot \log (1 - x_n) \right] \]

Notice how this function provides the calculation of both log components in the objective function (i.e. \(log(D(x))\) and \(log(1-D(G(z)))\)). We can specify what part of the BCE equation to use with the \(y\) input. This is accomplished in the training loop which is coming up soon, but it is important to understand how we can choose which component we wish to calculate just by changing \(y\) (i.e. GT labels).

Next, we define our real label as 1 and the fake label as 0. These labels will be used when calculating the losses of \(D\) and \(G\), and this is also the convention used in the original GAN paper. Finally, we set up two separate optimizers, one for \(D\) and one for \(G\). As specified in the DCGAN paper, both are Adam optimizers with learning rate 0.0002 and Beta1 = 0.5. For keeping track of the generator’s learning progression, we will generate a fixed batch of latent vectors that are drawn from a Gaussian distribution (i.e. fixed_noise) . In the training loop, we will periodically input this fixed_noise into \(G\), and over the iterations we will see images form out of the noise.

# Initialize BCELoss function
criterion = nn.BCELoss()

# Create batch of latent vectors that we will use to visualize
#  the progression of the generator
fixed_noise = torch.randn(64, nz, 1, 1, device=device)

# Establish convention for real and fake labels during training
real_label = 1.
fake_label = 0.

# Setup Adam optimizers for both G and D
optimizerD = optim.Adam(netD.parameters(), lr=lr, betas=(beta1, 0.999))
optimizerG = optim.Adam(netG.parameters(), lr=lr, betas=(beta1, 0.999))

Training

Finally, now that we have all of the parts of the GAN framework defined, we can train it. Be mindful that training GANs is somewhat of an art form, as incorrect hyperparameter settings lead to mode collapse with little explanation of what went wrong. Here, we will closely follow Algorithm 1 from Goodfellow’s paper, while abiding by some of the best practices shown in ganhacks. Namely, we will “construct different mini-batches for real and fake” images, and also adjust G’s objective function to maximize \(logD(G(z))\). Training is split up into two main parts. Part 1 updates the Discriminator and Part 2 updates the Generator.

Part 1 - Train the Discriminator

Recall, the goal of training the discriminator is to maximize the probability of correctly classifying a given input as real or fake. In terms of Goodfellow, we wish to “update the discriminator by ascending its stochastic gradient”. Practically, we want to maximize \(log(D(x)) + log(1-D(G(z)))\). Due to the separate mini-batch suggestion from ganhacks, we will calculate this in two steps. First, we will construct a batch of real samples from the training set, forward pass through \(D\), calculate the loss (\(log(D(x))\)), then calculate the gradients in a backward pass. Secondly, we will construct a batch of fake samples with the current generator, forward pass this batch through \(D\), calculate the loss (\(log(1-D(G(z)))\)), and accumulate the gradients with a backward pass. Now, with the gradients accumulated from both the all-real and all-fake batches, we call a step of the Discriminator’s optimizer.

Part 2 - Train the Generator

As stated in the original paper, we want to train the Generator by minimizing \(log(1-D(G(z)))\) in an effort to generate better fakes. As mentioned, this was shown by Goodfellow to not provide sufficient gradients, especially early in the learning process. As a fix, we instead wish to maximize \(log(D(G(z)))\). In the code we accomplish this by: classifying the Generator output from Part 1 with the Discriminator, computing G’s loss using real labels as GT, computing G’s gradients in a backward pass, and finally updating G’s parameters with an optimizer step. It may seem counter-intuitive to use the real labels as GT labels for the loss function, but this allows us to use the \(log(x)\) part of the BCELoss (rather than the \(log(1-x)\) part) which is exactly what we want.

Finally, we will do some statistic reporting and at the end of each epoch we will push our fixed_noise batch through the generator to visually track the progress of G’s training. The training statistics reported are:

  • Loss_D - discriminator loss calculated as the sum of losses for the all real and all fake batches (\(log(D(x)) + log(1 - D(G(z)))\)).
  • Loss_G - generator loss calculated as \(log(D(G(z)))\)
  • D(x) - the average output (across the batch) of the discriminator for the all real batch. This should start close to 1 then theoretically converge to 0.5 when G gets better. Think about why this is.
  • D(G(z)) - average discriminator outputs for the all fake batch. The first number is before D is updated and the second number is after D is updated. These numbers should start near 0 and converge to 0.5 as G gets better. Think about why this is.

Note: This step might take a while, depending on how many epochs you run and if you removed some data from the dataset.

# Training Loop

# Lists to keep track of progress
img_list = []
G_losses = []
D_losses = []
iters = 0

print("Starting Training Loop...")
# For each epoch
for epoch in range(num_epochs):
    # For each batch in the dataloader
    for i, data in enumerate(dataloader, 0):

        ############################
        # (1) Update D network: maximize log(D(x)) + log(1 - D(G(z)))
        ###########################
        ## Train with all-real batch
        netD.zero_grad()
        # Format batch
        real_cpu = data[0].to(device)
        b_size = real_cpu.size(0)
        label = torch.full((b_size,), real_label, dtype=torch.float, device=device)
        # Forward pass real batch through D
        output = netD(real_cpu).view(-1)
        # Calculate loss on all-real batch
        errD_real = criterion(output, label)
        # Calculate gradients for D in backward pass
        errD_real.backward()
        D_x = output.mean().item()

        ## Train with all-fake batch
        # Generate batch of latent vectors
        noise = torch.randn(b_size, nz, 1, 1, device=device)
        # Generate fake image batch with G
        fake = netG(noise)
        label.fill_(fake_label)
        # Classify all fake batch with D
        output = netD(fake.detach()).view(-1)
        # Calculate D's loss on the all-fake batch
        errD_fake = criterion(output, label)
        # Calculate the gradients for this batch, accumulated (summed) with previous gradients
        errD_fake.backward()
        D_G_z1 = output.mean().item()
        # Compute error of D as sum over the fake and the real batches
        errD = errD_real + errD_fake
        # Update D
        optimizerD.step()

        ############################
        # (2) Update G network: maximize log(D(G(z)))
        ###########################
        netG.zero_grad()
        label.fill_(real_label)  # fake labels are real for generator cost
        # Since we just updated D, perform another forward pass of all-fake batch through D
        output = netD(fake).view(-1)
        # Calculate G's loss based on this output
        errG = criterion(output, label)
        # Calculate gradients for G
        errG.backward()
        D_G_z2 = output.mean().item()
        # Update G
        optimizerG.step()

        # Output training stats
        if i % 50 == 0:
            print('[%d/%d][%d/%d]\tLoss_D: %.4f\tLoss_G: %.4f\tD(x): %.4f\tD(G(z)): %.4f / %.4f'
                  % (epoch, num_epochs, i, len(dataloader),
                     errD.item(), errG.item(), D_x, D_G_z1, D_G_z2))

        # Save Losses for plotting later
        G_losses.append(errG.item())
        D_losses.append(errD.item())

        # Check how the generator is doing by saving G's output on fixed_noise
        if (iters % 500 == 0) or ((epoch == num_epochs-1) and (i == len(dataloader)-1)):
            with torch.no_grad():
                fake = netG(fixed_noise).detach().cpu()
            img_list.append(vutils.make_grid(fake, padding=2, normalize=True))

        iters += 1

Out:

Starting Training Loop...
[0/5][0/1583]   Loss_D: 1.6264  Loss_G: 5.5242  D(x): 0.5733    D(G(z)): 0.5501 / 0.0065
[0/5][50/1583]  Loss_D: 0.1412  Loss_G: 17.6137 D(x): 0.9143    D(G(z)): 0.0000 / 0.0000
[0/5][100/1583] Loss_D: 0.2880  Loss_G: 6.7394  D(x): 0.8846    D(G(z)): 0.0878 / 0.0026
[0/5][150/1583] Loss_D: 0.4586  Loss_G: 7.4970  D(x): 0.9435    D(G(z)): 0.2832 / 0.0010
[0/5][200/1583] Loss_D: 0.6494  Loss_G: 6.0636  D(x): 0.8154    D(G(z)): 0.2535 / 0.0058
[0/5][250/1583] Loss_D: 0.6236  Loss_G: 6.3242  D(x): 0.8373    D(G(z)): 0.2382 / 0.0037
[0/5][300/1583] Loss_D: 0.9665  Loss_G: 4.9564  D(x): 0.4994    D(G(z)): 0.0038 / 0.0184
[0/5][350/1583] Loss_D: 0.3642  Loss_G: 4.9775  D(x): 0.8363    D(G(z)): 0.0928 / 0.0135
[0/5][400/1583] Loss_D: 0.4451  Loss_G: 5.0242  D(x): 0.9028    D(G(z)): 0.2493 / 0.0147
[0/5][450/1583] Loss_D: 2.6771  Loss_G: 10.9359 D(x): 0.9856    D(G(z)): 0.8181 / 0.0003
[0/5][500/1583] Loss_D: 0.8534  Loss_G: 10.2236 D(x): 0.9564    D(G(z)): 0.4596 / 0.0004
[0/5][550/1583] Loss_D: 0.7589  Loss_G: 5.5539  D(x): 0.9435    D(G(z)): 0.4202 / 0.0125
[0/5][600/1583] Loss_D: 0.6911  Loss_G: 5.7385  D(x): 0.9102    D(G(z)): 0.3470 / 0.0067
[0/5][650/1583] Loss_D: 0.5436  Loss_G: 5.3706  D(x): 0.8198    D(G(z)): 0.2153 / 0.0085
[0/5][700/1583] Loss_D: 0.2817  Loss_G: 4.1926  D(x): 0.8196    D(G(z)): 0.0328 / 0.0280
[0/5][750/1583] Loss_D: 0.3725  Loss_G: 5.0995  D(x): 0.9119    D(G(z)): 0.2041 / 0.0147
[0/5][800/1583] Loss_D: 0.2731  Loss_G: 4.8503  D(x): 0.8567    D(G(z)): 0.0748 / 0.0207
[0/5][850/1583] Loss_D: 1.0390  Loss_G: 8.0527  D(x): 0.9482    D(G(z)): 0.5178 / 0.0016
[0/5][900/1583] Loss_D: 0.3423  Loss_G: 2.8363  D(x): 0.8313    D(G(z)): 0.0807 / 0.1062
[0/5][950/1583] Loss_D: 0.3330  Loss_G: 4.7248  D(x): 0.7813    D(G(z)): 0.0278 / 0.0162
[0/5][1000/1583]        Loss_D: 0.2894  Loss_G: 4.4582  D(x): 0.9208    D(G(z)): 0.1565 / 0.0222
[0/5][1050/1583]        Loss_D: 0.9109  Loss_G: 1.4642  D(x): 0.5323    D(G(z)): 0.0470 / 0.2969
[0/5][1100/1583]        Loss_D: 0.5556  Loss_G: 3.4945  D(x): 0.7047    D(G(z)): 0.0700 / 0.0565
[0/5][1150/1583]        Loss_D: 1.0806  Loss_G: 8.3378  D(x): 0.9796    D(G(z)): 0.5337 / 0.0008
[0/5][1200/1583]        Loss_D: 0.5143  Loss_G: 5.9421  D(x): 0.9281    D(G(z)): 0.3121 / 0.0049
[0/5][1250/1583]        Loss_D: 0.5971  Loss_G: 2.5787  D(x): 0.6788    D(G(z)): 0.0629 / 0.1164
[0/5][1300/1583]        Loss_D: 0.2778  Loss_G: 5.3986  D(x): 0.9441    D(G(z)): 0.1741 / 0.0083
[0/5][1350/1583]        Loss_D: 0.5520  Loss_G: 2.9476  D(x): 0.7443    D(G(z)): 0.1635 / 0.0877
[0/5][1400/1583]        Loss_D: 0.6766  Loss_G: 3.1342  D(x): 0.7127    D(G(z)): 0.1896 / 0.0680
[0/5][1450/1583]        Loss_D: 1.1370  Loss_G: 2.0847  D(x): 0.4467    D(G(z)): 0.0355 / 0.1992
[0/5][1500/1583]        Loss_D: 1.0828  Loss_G: 2.6062  D(x): 0.4402    D(G(z)): 0.0072 / 0.1235
[0/5][1550/1583]        Loss_D: 0.8280  Loss_G: 2.3385  D(x): 0.5557    D(G(z)): 0.0103 / 0.1639
[1/5][0/1583]   Loss_D: 0.2511  Loss_G: 3.8511  D(x): 0.9314    D(G(z)): 0.1493 / 0.0337
[1/5][50/1583]  Loss_D: 0.9840  Loss_G: 1.6468  D(x): 0.4836    D(G(z)): 0.0301 / 0.2723
[1/5][100/1583] Loss_D: 0.5174  Loss_G: 3.7177  D(x): 0.7675    D(G(z)): 0.1649 / 0.0427
[1/5][150/1583] Loss_D: 0.6359  Loss_G: 6.9075  D(x): 0.9556    D(G(z)): 0.3897 / 0.0023
[1/5][200/1583] Loss_D: 0.4655  Loss_G: 2.4158  D(x): 0.7489    D(G(z)): 0.0940 / 0.1348
[1/5][250/1583] Loss_D: 0.4447  Loss_G: 3.1690  D(x): 0.7769    D(G(z)): 0.1299 / 0.0802
[1/5][300/1583] Loss_D: 1.3833  Loss_G: 6.1937  D(x): 0.9741    D(G(z)): 0.6642 / 0.0045
[1/5][350/1583] Loss_D: 0.4817  Loss_G: 3.5902  D(x): 0.9151    D(G(z)): 0.2684 / 0.0537
[1/5][400/1583] Loss_D: 0.4913  Loss_G: 4.5028  D(x): 0.9654    D(G(z)): 0.3311 / 0.0175
[1/5][450/1583] Loss_D: 0.3341  Loss_G: 3.3536  D(x): 0.7808    D(G(z)): 0.0387 / 0.0545
[1/5][500/1583] Loss_D: 0.2914  Loss_G: 3.3239  D(x): 0.8844    D(G(z)): 0.1335 / 0.0521
[1/5][550/1583] Loss_D: 0.6835  Loss_G: 2.2190  D(x): 0.6256    D(G(z)): 0.0827 / 0.1626
[1/5][600/1583] Loss_D: 0.4369  Loss_G: 3.9853  D(x): 0.8937    D(G(z)): 0.2409 / 0.0284
[1/5][650/1583] Loss_D: 0.7174  Loss_G: 2.2420  D(x): 0.6284    D(G(z)): 0.1093 / 0.1727
[1/5][700/1583] Loss_D: 0.8931  Loss_G: 6.4076  D(x): 0.9652    D(G(z)): 0.5163 / 0.0029
[1/5][750/1583] Loss_D: 2.1396  Loss_G: 1.4361  D(x): 0.2011    D(G(z)): 0.0070 / 0.3230
[1/5][800/1583] Loss_D: 0.5617  Loss_G: 5.3380  D(x): 0.9421    D(G(z)): 0.3483 / 0.0077
[1/5][850/1583] Loss_D: 0.5500  Loss_G: 2.4796  D(x): 0.6825    D(G(z)): 0.0723 / 0.1244
[1/5][900/1583] Loss_D: 0.7135  Loss_G: 1.6940  D(x): 0.6580    D(G(z)): 0.1685 / 0.2341
[1/5][950/1583] Loss_D: 0.6895  Loss_G: 4.5745  D(x): 0.8994    D(G(z)): 0.3825 / 0.0173
[1/5][1000/1583]        Loss_D: 0.5195  Loss_G: 3.9908  D(x): 0.8370    D(G(z)): 0.2349 / 0.0279
[1/5][1050/1583]        Loss_D: 0.4412  Loss_G: 2.7433  D(x): 0.7984    D(G(z)): 0.1502 / 0.0906
[1/5][1100/1583]        Loss_D: 0.8107  Loss_G: 2.4648  D(x): 0.5268    D(G(z)): 0.0128 / 0.1387
[1/5][1150/1583]        Loss_D: 2.7933  Loss_G: 0.9528  D(x): 0.1697    D(G(z)): 0.0376 / 0.5177
[1/5][1200/1583]        Loss_D: 0.4335  Loss_G: 3.1838  D(x): 0.8179    D(G(z)): 0.1612 / 0.0636
[1/5][1250/1583]        Loss_D: 1.6800  Loss_G: 6.9846  D(x): 0.9581    D(G(z)): 0.7224 / 0.0021
[1/5][1300/1583]        Loss_D: 0.4179  Loss_G: 3.2330  D(x): 0.9199    D(G(z)): 0.2557 / 0.0587
[1/5][1350/1583]        Loss_D: 0.5405  Loss_G: 3.7078  D(x): 0.8611    D(G(z)): 0.2795 / 0.0392
[1/5][1400/1583]        Loss_D: 0.4897  Loss_G: 3.3621  D(x): 0.9056    D(G(z)): 0.2924 / 0.0504
[1/5][1450/1583]        Loss_D: 0.5741  Loss_G: 2.2347  D(x): 0.7345    D(G(z)): 0.1700 / 0.1313
[1/5][1500/1583]        Loss_D: 1.5250  Loss_G: 1.8694  D(x): 0.6100    D(G(z)): 0.4286 / 0.2650
[1/5][1550/1583]        Loss_D: 0.6662  Loss_G: 3.4729  D(x): 0.8469    D(G(z)): 0.3489 / 0.0450
[2/5][0/1583]   Loss_D: 0.5040  Loss_G: 2.1953  D(x): 0.7196    D(G(z)): 0.1126 / 0.1465
[2/5][50/1583]  Loss_D: 0.6142  Loss_G: 4.1393  D(x): 0.9122    D(G(z)): 0.3725 / 0.0207
[2/5][100/1583] Loss_D: 0.5989  Loss_G: 3.7827  D(x): 0.9165    D(G(z)): 0.3591 / 0.0303
[2/5][150/1583] Loss_D: 0.7125  Loss_G: 1.7638  D(x): 0.5681    D(G(z)): 0.0429 / 0.2153
[2/5][200/1583] Loss_D: 0.5887  Loss_G: 2.3518  D(x): 0.6469    D(G(z)): 0.0667 / 0.1396
[2/5][250/1583] Loss_D: 0.5135  Loss_G: 2.6434  D(x): 0.7761    D(G(z)): 0.1835 / 0.1052
[2/5][300/1583] Loss_D: 1.0969  Loss_G: 1.0629  D(x): 0.4257    D(G(z)): 0.0760 / 0.4097
[2/5][350/1583] Loss_D: 0.4443  Loss_G: 2.1259  D(x): 0.8163    D(G(z)): 0.1842 / 0.1558
[2/5][400/1583] Loss_D: 0.7084  Loss_G: 2.6792  D(x): 0.8496    D(G(z)): 0.3448 / 0.0977
[2/5][450/1583] Loss_D: 0.6996  Loss_G: 3.1145  D(x): 0.8694    D(G(z)): 0.3902 / 0.0613
[2/5][500/1583] Loss_D: 0.5994  Loss_G: 1.8378  D(x): 0.6185    D(G(z)): 0.0602 / 0.2045
[2/5][550/1583] Loss_D: 0.6398  Loss_G: 2.1199  D(x): 0.6821    D(G(z)): 0.1690 / 0.1571
[2/5][600/1583] Loss_D: 0.7085  Loss_G: 3.1926  D(x): 0.8544    D(G(z)): 0.3837 / 0.0538
[2/5][650/1583] Loss_D: 0.7145  Loss_G: 1.2872  D(x): 0.6210    D(G(z)): 0.1421 / 0.3148
[2/5][700/1583] Loss_D: 0.4868  Loss_G: 2.4102  D(x): 0.7872    D(G(z)): 0.1859 / 0.1152
[2/5][750/1583] Loss_D: 1.4289  Loss_G: 1.4495  D(x): 0.3259    D(G(z)): 0.0321 / 0.3117
[2/5][800/1583] Loss_D: 0.4270  Loss_G: 3.0826  D(x): 0.8876    D(G(z)): 0.2444 / 0.0587
[2/5][850/1583] Loss_D: 0.5558  Loss_G: 2.4275  D(x): 0.7628    D(G(z)): 0.2076 / 0.1163
[2/5][900/1583] Loss_D: 0.4035  Loss_G: 2.8560  D(x): 0.8819    D(G(z)): 0.2235 / 0.0774
[2/5][950/1583] Loss_D: 0.5221  Loss_G: 2.0098  D(x): 0.7374    D(G(z)): 0.1515 / 0.1629
[2/5][1000/1583]        Loss_D: 1.5651  Loss_G: 0.3799  D(x): 0.2830    D(G(z)): 0.0236 / 0.7113
[2/5][1050/1583]        Loss_D: 0.9293  Loss_G: 0.9845  D(x): 0.4672    D(G(z)): 0.0579 / 0.4353
[2/5][1100/1583]        Loss_D: 0.3568  Loss_G: 3.0341  D(x): 0.8352    D(G(z)): 0.1373 / 0.0692
[2/5][1150/1583]        Loss_D: 0.7193  Loss_G: 1.8740  D(x): 0.5837    D(G(z)): 0.0889 / 0.1938
[2/5][1200/1583]        Loss_D: 0.4880  Loss_G: 2.9430  D(x): 0.7755    D(G(z)): 0.1714 / 0.0686
[2/5][1250/1583]        Loss_D: 0.5522  Loss_G: 2.0048  D(x): 0.6572    D(G(z)): 0.0812 / 0.1754
[2/5][1300/1583]        Loss_D: 0.6458  Loss_G: 2.1765  D(x): 0.7460    D(G(z)): 0.2425 / 0.1361
[2/5][1350/1583]        Loss_D: 0.6118  Loss_G: 2.0631  D(x): 0.7360    D(G(z)): 0.2207 / 0.1599
[2/5][1400/1583]        Loss_D: 1.8221  Loss_G: 4.5087  D(x): 0.9734    D(G(z)): 0.7777 / 0.0189
[2/5][1450/1583]        Loss_D: 0.9520  Loss_G: 4.1949  D(x): 0.8654    D(G(z)): 0.4971 / 0.0211
[2/5][1500/1583]        Loss_D: 0.5293  Loss_G: 2.9983  D(x): 0.8376    D(G(z)): 0.2684 / 0.0680
[2/5][1550/1583]        Loss_D: 0.4573  Loss_G: 2.3996  D(x): 0.7617    D(G(z)): 0.1380 / 0.1152
[3/5][0/1583]   Loss_D: 0.7086  Loss_G: 1.6009  D(x): 0.5827    D(G(z)): 0.0487 / 0.2698
[3/5][50/1583]  Loss_D: 0.9100  Loss_G: 1.7278  D(x): 0.6350    D(G(z)): 0.2822 / 0.2063
[3/5][100/1583] Loss_D: 0.5674  Loss_G: 2.5733  D(x): 0.7736    D(G(z)): 0.2185 / 0.0991
[3/5][150/1583] Loss_D: 0.5037  Loss_G: 3.7331  D(x): 0.8622    D(G(z)): 0.2715 / 0.0323
[3/5][200/1583] Loss_D: 0.5686  Loss_G: 1.6506  D(x): 0.6955    D(G(z)): 0.1525 / 0.2202
[3/5][250/1583] Loss_D: 0.9567  Loss_G: 1.2145  D(x): 0.4663    D(G(z)): 0.0371 / 0.3478
[3/5][300/1583] Loss_D: 0.4842  Loss_G: 1.9943  D(x): 0.7696    D(G(z)): 0.1676 / 0.1732
[3/5][350/1583] Loss_D: 1.0200  Loss_G: 3.8837  D(x): 0.8938    D(G(z)): 0.5357 / 0.0314
[3/5][400/1583] Loss_D: 0.6235  Loss_G: 1.9561  D(x): 0.6102    D(G(z)): 0.0843 / 0.1832
[3/5][450/1583] Loss_D: 0.5278  Loss_G: 3.6040  D(x): 0.9196    D(G(z)): 0.3266 / 0.0380
[3/5][500/1583] Loss_D: 1.3682  Loss_G: 4.0783  D(x): 0.9101    D(G(z)): 0.6691 / 0.0276
[3/5][550/1583] Loss_D: 0.8740  Loss_G: 4.2813  D(x): 0.9182    D(G(z)): 0.4983 / 0.0205
[3/5][600/1583] Loss_D: 1.5552  Loss_G: 0.3549  D(x): 0.2776    D(G(z)): 0.0198 / 0.7604
[3/5][650/1583] Loss_D: 0.4364  Loss_G: 2.1706  D(x): 0.7496    D(G(z)): 0.1157 / 0.1493
[3/5][700/1583] Loss_D: 0.5508  Loss_G: 2.1757  D(x): 0.6676    D(G(z)): 0.0941 / 0.1466
[3/5][750/1583] Loss_D: 1.6457  Loss_G: 2.5571  D(x): 0.8128    D(G(z)): 0.6670 / 0.1595
[3/5][800/1583] Loss_D: 0.7762  Loss_G: 1.2192  D(x): 0.5564    D(G(z)): 0.1018 / 0.3401
[3/5][850/1583] Loss_D: 0.7662  Loss_G: 1.1636  D(x): 0.5712    D(G(z)): 0.1211 / 0.3480
[3/5][900/1583] Loss_D: 1.5744  Loss_G: 5.2206  D(x): 0.9176    D(G(z)): 0.7052 / 0.0136
[3/5][950/1583] Loss_D: 0.4043  Loss_G: 3.2110  D(x): 0.8369    D(G(z)): 0.1810 / 0.0526
[3/5][1000/1583]        Loss_D: 0.4719  Loss_G: 2.3091  D(x): 0.7761    D(G(z)): 0.1649 / 0.1290
[3/5][1050/1583]        Loss_D: 0.8771  Loss_G: 1.8899  D(x): 0.6129    D(G(z)): 0.2337 / 0.1933
[3/5][1100/1583]        Loss_D: 0.6288  Loss_G: 1.5514  D(x): 0.6569    D(G(z)): 0.1430 / 0.2559
[3/5][1150/1583]        Loss_D: 0.7070  Loss_G: 2.1827  D(x): 0.6593    D(G(z)): 0.1987 / 0.1452
[3/5][1200/1583]        Loss_D: 0.4639  Loss_G: 2.0374  D(x): 0.7144    D(G(z)): 0.0888 / 0.1733
[3/5][1250/1583]        Loss_D: 0.7819  Loss_G: 1.5960  D(x): 0.6253    D(G(z)): 0.2035 / 0.2356
[3/5][1300/1583]        Loss_D: 0.6763  Loss_G: 1.6848  D(x): 0.6349    D(G(z)): 0.1414 / 0.2278
[3/5][1350/1583]        Loss_D: 0.6233  Loss_G: 1.6452  D(x): 0.6656    D(G(z)): 0.1482 / 0.2241
[3/5][1400/1583]        Loss_D: 0.7265  Loss_G: 2.1824  D(x): 0.6274    D(G(z)): 0.1529 / 0.1575
[3/5][1450/1583]        Loss_D: 0.5511  Loss_G: 3.1002  D(x): 0.8449    D(G(z)): 0.2908 / 0.0606
[3/5][1500/1583]        Loss_D: 0.7972  Loss_G: 3.0403  D(x): 0.8863    D(G(z)): 0.4408 / 0.0660
[3/5][1550/1583]        Loss_D: 0.6184  Loss_G: 2.0869  D(x): 0.7725    D(G(z)): 0.2611 / 0.1541
[4/5][0/1583]   Loss_D: 0.4765  Loss_G: 2.6870  D(x): 0.8861    D(G(z)): 0.2735 / 0.0856
[4/5][50/1583]  Loss_D: 1.7997  Loss_G: 5.2614  D(x): 0.9614    D(G(z)): 0.7789 / 0.0087
[4/5][100/1583] Loss_D: 0.5492  Loss_G: 2.1074  D(x): 0.6825    D(G(z)): 0.1128 / 0.1474
[4/5][150/1583] Loss_D: 1.1948  Loss_G: 0.8199  D(x): 0.3828    D(G(z)): 0.0512 / 0.4860
[4/5][200/1583] Loss_D: 0.7491  Loss_G: 2.8145  D(x): 0.8360    D(G(z)): 0.3880 / 0.0802
[4/5][250/1583] Loss_D: 0.7506  Loss_G: 3.7253  D(x): 0.9501    D(G(z)): 0.4559 / 0.0334
[4/5][300/1583] Loss_D: 1.3020  Loss_G: 0.5915  D(x): 0.3300    D(G(z)): 0.0325 / 0.5879
[4/5][350/1583] Loss_D: 0.5785  Loss_G: 2.7406  D(x): 0.7597    D(G(z)): 0.2239 / 0.0850
[4/5][400/1583] Loss_D: 0.7857  Loss_G: 0.8628  D(x): 0.5328    D(G(z)): 0.0482 / 0.4821
[4/5][450/1583] Loss_D: 0.6295  Loss_G: 1.5616  D(x): 0.6140    D(G(z)): 0.0742 / 0.2532
[4/5][500/1583] Loss_D: 0.6027  Loss_G: 1.3241  D(x): 0.6500    D(G(z)): 0.1053 / 0.3116
[4/5][550/1583] Loss_D: 0.5433  Loss_G: 2.0753  D(x): 0.6685    D(G(z)): 0.0861 / 0.1650
[4/5][600/1583] Loss_D: 0.9203  Loss_G: 0.7047  D(x): 0.4748    D(G(z)): 0.0552 / 0.5395
[4/5][650/1583] Loss_D: 0.4784  Loss_G: 2.1977  D(x): 0.8171    D(G(z)): 0.2130 / 0.1466
[4/5][700/1583] Loss_D: 0.8802  Loss_G: 1.1693  D(x): 0.5072    D(G(z)): 0.0654 / 0.3531
[4/5][750/1583] Loss_D: 0.5825  Loss_G: 2.0148  D(x): 0.6357    D(G(z)): 0.0734 / 0.1763
[4/5][800/1583] Loss_D: 1.0064  Loss_G: 5.3213  D(x): 0.9133    D(G(z)): 0.5396 / 0.0077
[4/5][850/1583] Loss_D: 0.6242  Loss_G: 2.6230  D(x): 0.7520    D(G(z)): 0.2354 / 0.0990
[4/5][900/1583] Loss_D: 0.6791  Loss_G: 4.1282  D(x): 0.8830    D(G(z)): 0.3901 / 0.0205
[4/5][950/1583] Loss_D: 0.8379  Loss_G: 4.5762  D(x): 0.9322    D(G(z)): 0.4914 / 0.0159
[4/5][1000/1583]        Loss_D: 0.5845  Loss_G: 2.8670  D(x): 0.8281    D(G(z)): 0.2897 / 0.0750
[4/5][1050/1583]        Loss_D: 0.4887  Loss_G: 2.4597  D(x): 0.8182    D(G(z)): 0.2240 / 0.1075
[4/5][1100/1583]        Loss_D: 0.4223  Loss_G: 2.5951  D(x): 0.8294    D(G(z)): 0.1821 / 0.1014
[4/5][1150/1583]        Loss_D: 0.6907  Loss_G: 2.9250  D(x): 0.8553    D(G(z)): 0.3794 / 0.0704
[4/5][1200/1583]        Loss_D: 0.4348  Loss_G: 2.2292  D(x): 0.7681    D(G(z)): 0.1316 / 0.1381
[4/5][1250/1583]        Loss_D: 0.4937  Loss_G: 2.6697  D(x): 0.8284    D(G(z)): 0.2407 / 0.0851
[4/5][1300/1583]        Loss_D: 2.2182  Loss_G: 6.6116  D(x): 0.9562    D(G(z)): 0.8200 / 0.0042
[4/5][1350/1583]        Loss_D: 0.5130  Loss_G: 2.0914  D(x): 0.7633    D(G(z)): 0.1845 / 0.1599
[4/5][1400/1583]        Loss_D: 0.5734  Loss_G: 3.2659  D(x): 0.8882    D(G(z)): 0.3278 / 0.0535
[4/5][1450/1583]        Loss_D: 0.5903  Loss_G: 1.5823  D(x): 0.6895    D(G(z)): 0.1539 / 0.2494
[4/5][1500/1583]        Loss_D: 0.6853  Loss_G: 1.3179  D(x): 0.6571    D(G(z)): 0.1788 / 0.3131
[4/5][1550/1583]        Loss_D: 0.5006  Loss_G: 2.2710  D(x): 0.7797    D(G(z)): 0.1868 / 0.1297

Results

Finally, lets check out how we did. Here, we will look at three different results. First, we will see how D and G’s losses changed during training. Second, we will visualize G’s output on the fixed_noise batch for every epoch. And third, we will look at a batch of real data next to a batch of fake data from G.

Loss versus training iteration

Below is a plot of D & G’s losses versus training iterations.

plt.figure(figsize=(10,5))
plt.title("Generator and Discriminator Loss During Training")
plt.plot(G_losses,label="G")
plt.plot(D_losses,label="D")
plt.xlabel("iterations")
plt.ylabel("Loss")
plt.legend()
plt.show()
../_images/sphx_glr_dcgan_faces_tutorial_002.png

Visualization of G’s progression

Remember how we saved the generator’s output on the fixed_noise batch after every epoch of training. Now, we can visualize the training progression of G with an animation. Press the play button to start the animation.

#%%capture
fig = plt.figure(figsize=(8,8))
plt.axis("off")
ims = [[plt.imshow(np.transpose(i,(1,2,0)), animated=True)] for i in img_list]
ani = animation.ArtistAnimation(fig, ims, interval=1000, repeat_delay=1000, blit=True)

HTML(ani.to_jshtml())
../_images/sphx_glr_dcgan_faces_tutorial_003.png

Real Images vs. Fake Images

Finally, lets take a look at some real images and fake images side by side.

# Grab a batch of real images from the dataloader
real_batch = next(iter(dataloader))

# Plot the real images
plt.figure(figsize=(15,15))
plt.subplot(1,2,1)
plt.axis("off")
plt.title("Real Images")
plt.imshow(np.transpose(vutils.make_grid(real_batch[0].to(device)[:64], padding=5, normalize=True).cpu(),(1,2,0)))

# Plot the fake images from the last epoch
plt.subplot(1,2,2)
plt.axis("off")
plt.title("Fake Images")
plt.imshow(np.transpose(img_list[-1],(1,2,0)))
plt.show()
../_images/sphx_glr_dcgan_faces_tutorial_004.png

Where to Go Next

We have reached the end of our journey, but there are several places you could go from here. You could:

  • Train for longer to see how good the results get
  • Modify this model to take a different dataset and possibly change the size of the images and the model architecture
  • Check out some other cool GAN projects here
  • Create GANs that generate music

Total running time of the script: ( 32 minutes 18.759 seconds)

Gallery generated by Sphinx-Gallery

Docs

Access comprehensive developer documentation for PyTorch

View Docs

Tutorials

Get in-depth tutorials for beginners and advanced developers

View Tutorials

Resources

Find development resources and get your questions answered

View Resources