Note

Click here to download the full example code

# 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

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)))
```

## 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.

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:

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: 2.0036 Loss_G: 5.6241 D(x): 0.5882 D(G(z)): 0.6680 / 0.0059
[0/5][50/1583] Loss_D: 0.2175 Loss_G: 11.7243 D(x): 0.9118 D(G(z)): 0.0002 / 0.0000
[0/5][100/1583] Loss_D: 0.5615 Loss_G: 7.9697 D(x): 0.9313 D(G(z)): 0.2754 / 0.0008
[0/5][150/1583] Loss_D: 0.4277 Loss_G: 6.6691 D(x): 0.9353 D(G(z)): 0.2713 / 0.0023
[0/5][200/1583] Loss_D: 0.4775 Loss_G: 5.4880 D(x): 0.8873 D(G(z)): 0.2457 / 0.0087
[0/5][250/1583] Loss_D: 0.5018 Loss_G: 3.9606 D(x): 0.8667 D(G(z)): 0.2395 / 0.0481
[0/5][300/1583] Loss_D: 0.4958 Loss_G: 3.0573 D(x): 0.7456 D(G(z)): 0.1085 / 0.0620
[0/5][350/1583] Loss_D: 0.5397 Loss_G: 2.9183 D(x): 0.7534 D(G(z)): 0.1389 / 0.0818
[0/5][400/1583] Loss_D: 0.4275 Loss_G: 4.0151 D(x): 0.7792 D(G(z)): 0.0967 / 0.0291
[0/5][450/1583] Loss_D: 0.6959 Loss_G: 4.6439 D(x): 0.8251 D(G(z)): 0.3208 / 0.0171
[0/5][500/1583] Loss_D: 0.4042 Loss_G: 4.3623 D(x): 0.7819 D(G(z)): 0.0985 / 0.0231
[0/5][550/1583] Loss_D: 0.2287 Loss_G: 4.7390 D(x): 0.8737 D(G(z)): 0.0568 / 0.0200
[0/5][600/1583] Loss_D: 0.4174 Loss_G: 4.1767 D(x): 0.7803 D(G(z)): 0.0838 / 0.0301
[0/5][650/1583] Loss_D: 0.6048 Loss_G: 3.4929 D(x): 0.7581 D(G(z)): 0.1693 / 0.0510
[0/5][700/1583] Loss_D: 0.3875 Loss_G: 4.4013 D(x): 0.8129 D(G(z)): 0.1054 / 0.0237
[0/5][750/1583] Loss_D: 0.4328 Loss_G: 5.6477 D(x): 0.8872 D(G(z)): 0.2085 / 0.0074
[0/5][800/1583] Loss_D: 0.2608 Loss_G: 6.0048 D(x): 0.9324 D(G(z)): 0.1428 / 0.0048
[0/5][850/1583] Loss_D: 1.0320 Loss_G: 9.3708 D(x): 0.9437 D(G(z)): 0.5449 / 0.0003
[0/5][900/1583] Loss_D: 0.6874 Loss_G: 3.1024 D(x): 0.7327 D(G(z)): 0.2307 / 0.0769
[0/5][950/1583] Loss_D: 0.7960 Loss_G: 1.2940 D(x): 0.5989 D(G(z)): 0.0849 / 0.3696
[0/5][1000/1583] Loss_D: 0.2522 Loss_G: 4.7052 D(x): 0.9343 D(G(z)): 0.1455 / 0.0248
[0/5][1050/1583] Loss_D: 0.2812 Loss_G: 3.4752 D(x): 0.8644 D(G(z)): 0.0908 / 0.0456
[0/5][1100/1583] Loss_D: 0.6024 Loss_G: 4.7818 D(x): 0.9050 D(G(z)): 0.3340 / 0.0164
[0/5][1150/1583] Loss_D: 0.5214 Loss_G: 4.7329 D(x): 0.8726 D(G(z)): 0.2653 / 0.0175
[0/5][1200/1583] Loss_D: 0.4892 Loss_G: 3.7528 D(x): 0.7809 D(G(z)): 0.1456 / 0.0452
[0/5][1250/1583] Loss_D: 0.4326 Loss_G: 3.6611 D(x): 0.8026 D(G(z)): 0.1135 / 0.0490
[0/5][1300/1583] Loss_D: 0.6391 Loss_G: 4.1414 D(x): 0.8164 D(G(z)): 0.2912 / 0.0280
[0/5][1350/1583] Loss_D: 0.4798 Loss_G: 3.7436 D(x): 0.7021 D(G(z)): 0.0332 / 0.0436
[0/5][1400/1583] Loss_D: 0.4497 Loss_G: 3.4976 D(x): 0.7091 D(G(z)): 0.0296 / 0.0503
[0/5][1450/1583] Loss_D: 0.5800 Loss_G: 3.0201 D(x): 0.7707 D(G(z)): 0.1891 / 0.0859
[0/5][1500/1583] Loss_D: 0.6786 Loss_G: 6.0197 D(x): 0.9369 D(G(z)): 0.4028 / 0.0052
[0/5][1550/1583] Loss_D: 0.6029 Loss_G: 3.1193 D(x): 0.7587 D(G(z)): 0.1935 / 0.0764
[1/5][0/1583] Loss_D: 0.5466 Loss_G: 5.0520 D(x): 0.9351 D(G(z)): 0.3342 / 0.0112
[1/5][50/1583] Loss_D: 0.5479 Loss_G: 3.6086 D(x): 0.8049 D(G(z)): 0.2293 / 0.0424
[1/5][100/1583] Loss_D: 0.3233 Loss_G: 3.6308 D(x): 0.8653 D(G(z)): 0.1333 / 0.0478
[1/5][150/1583] Loss_D: 0.4021 Loss_G: 3.7547 D(x): 0.8492 D(G(z)): 0.1716 / 0.0419
[1/5][200/1583] Loss_D: 0.7231 Loss_G: 3.1232 D(x): 0.9056 D(G(z)): 0.3750 / 0.0789
[1/5][250/1583] Loss_D: 0.3776 Loss_G: 3.1899 D(x): 0.8068 D(G(z)): 0.1053 / 0.0633
[1/5][300/1583] Loss_D: 0.9648 Loss_G: 6.3213 D(x): 0.9705 D(G(z)): 0.5534 / 0.0029
[1/5][350/1583] Loss_D: 2.7036 Loss_G: 10.4684 D(x): 0.9688 D(G(z)): 0.8566 / 0.0001
[1/5][400/1583] Loss_D: 0.4610 Loss_G: 3.3901 D(x): 0.8982 D(G(z)): 0.2544 / 0.0479
[1/5][450/1583] Loss_D: 0.4008 Loss_G: 4.0627 D(x): 0.8537 D(G(z)): 0.1796 / 0.0296
[1/5][500/1583] Loss_D: 0.3671 Loss_G: 3.5372 D(x): 0.7694 D(G(z)): 0.0355 / 0.0455
[1/5][550/1583] Loss_D: 0.4392 Loss_G: 3.0794 D(x): 0.8168 D(G(z)): 0.1789 / 0.0621
[1/5][600/1583] Loss_D: 0.5349 Loss_G: 4.7227 D(x): 0.9027 D(G(z)): 0.3097 / 0.0138
[1/5][650/1583] Loss_D: 1.3806 Loss_G: 7.0114 D(x): 0.9664 D(G(z)): 0.6691 / 0.0023
[1/5][700/1583] Loss_D: 0.5091 Loss_G: 2.4617 D(x): 0.7497 D(G(z)): 0.1451 / 0.1161
[1/5][750/1583] Loss_D: 0.8812 Loss_G: 1.4016 D(x): 0.5561 D(G(z)): 0.0742 / 0.3228
[1/5][800/1583] Loss_D: 0.3665 Loss_G: 3.8566 D(x): 0.8532 D(G(z)): 0.1621 / 0.0343
[1/5][850/1583] Loss_D: 0.4915 Loss_G: 2.7790 D(x): 0.6958 D(G(z)): 0.0508 / 0.1023
[1/5][900/1583] Loss_D: 0.7472 Loss_G: 4.0748 D(x): 0.8149 D(G(z)): 0.3441 / 0.0327
[1/5][950/1583] Loss_D: 0.4544 Loss_G: 3.0177 D(x): 0.8202 D(G(z)): 0.1888 / 0.0668
[1/5][1000/1583] Loss_D: 0.4597 Loss_G: 4.1206 D(x): 0.8824 D(G(z)): 0.2439 / 0.0244
[1/5][1050/1583] Loss_D: 0.7280 Loss_G: 1.7663 D(x): 0.5980 D(G(z)): 0.0439 / 0.2246
[1/5][1100/1583] Loss_D: 0.4675 Loss_G: 3.3175 D(x): 0.8685 D(G(z)): 0.2449 / 0.0493
[1/5][1150/1583] Loss_D: 0.5857 Loss_G: 2.6935 D(x): 0.7530 D(G(z)): 0.1957 / 0.1070
[1/5][1200/1583] Loss_D: 0.3660 Loss_G: 3.4710 D(x): 0.8792 D(G(z)): 0.1892 / 0.0459
[1/5][1250/1583] Loss_D: 0.6815 Loss_G: 4.0906 D(x): 0.8409 D(G(z)): 0.3411 / 0.0310
[1/5][1300/1583] Loss_D: 0.4100 Loss_G: 3.2312 D(x): 0.8578 D(G(z)): 0.2000 / 0.0528
[1/5][1350/1583] Loss_D: 0.5077 Loss_G: 3.4215 D(x): 0.8668 D(G(z)): 0.2595 / 0.0530
[1/5][1400/1583] Loss_D: 0.4818 Loss_G: 2.5172 D(x): 0.8430 D(G(z)): 0.2216 / 0.1127
[1/5][1450/1583] Loss_D: 0.4628 Loss_G: 3.4808 D(x): 0.8174 D(G(z)): 0.1851 / 0.0464
[1/5][1500/1583] Loss_D: 0.7231 Loss_G: 3.5260 D(x): 0.8848 D(G(z)): 0.3976 / 0.0432
[1/5][1550/1583] Loss_D: 1.2648 Loss_G: 1.2622 D(x): 0.3655 D(G(z)): 0.0204 / 0.3572
[2/5][0/1583] Loss_D: 0.5357 Loss_G: 2.1837 D(x): 0.7427 D(G(z)): 0.1747 / 0.1384
[2/5][50/1583] Loss_D: 0.5019 Loss_G: 3.6355 D(x): 0.8580 D(G(z)): 0.2680 / 0.0344
[2/5][100/1583] Loss_D: 1.2416 Loss_G: 2.7625 D(x): 0.8459 D(G(z)): 0.5845 / 0.0921
[2/5][150/1583] Loss_D: 0.4782 Loss_G: 2.0529 D(x): 0.7262 D(G(z)): 0.1045 / 0.1620
[2/5][200/1583] Loss_D: 1.7132 Loss_G: 0.9553 D(x): 0.2527 D(G(z)): 0.0375 / 0.4605
[2/5][250/1583] Loss_D: 0.5491 Loss_G: 3.4005 D(x): 0.8840 D(G(z)): 0.3128 / 0.0473
[2/5][300/1583] Loss_D: 1.9933 Loss_G: 0.8937 D(x): 0.1960 D(G(z)): 0.0116 / 0.4786
[2/5][350/1583] Loss_D: 0.6843 Loss_G: 3.5542 D(x): 0.9040 D(G(z)): 0.4022 / 0.0440
[2/5][400/1583] Loss_D: 1.4836 Loss_G: 5.2819 D(x): 0.9371 D(G(z)): 0.6975 / 0.0086
[2/5][450/1583] Loss_D: 0.6487 Loss_G: 3.2736 D(x): 0.8981 D(G(z)): 0.3777 / 0.0528
[2/5][500/1583] Loss_D: 1.3409 Loss_G: 0.8169 D(x): 0.3341 D(G(z)): 0.0158 / 0.5077
[2/5][550/1583] Loss_D: 0.8895 Loss_G: 1.5878 D(x): 0.5241 D(G(z)): 0.0486 / 0.2624
[2/5][600/1583] Loss_D: 0.8378 Loss_G: 2.9671 D(x): 0.7815 D(G(z)): 0.3856 / 0.0693
[2/5][650/1583] Loss_D: 0.6164 Loss_G: 1.2745 D(x): 0.6420 D(G(z)): 0.0876 / 0.3364
[2/5][700/1583] Loss_D: 0.5210 Loss_G: 2.7011 D(x): 0.8243 D(G(z)): 0.2465 / 0.0857
[2/5][750/1583] Loss_D: 0.6622 Loss_G: 1.6654 D(x): 0.6456 D(G(z)): 0.1317 / 0.2292
[2/5][800/1583] Loss_D: 0.9166 Loss_G: 4.8232 D(x): 0.9285 D(G(z)): 0.5221 / 0.0117
[2/5][850/1583] Loss_D: 0.8446 Loss_G: 1.8150 D(x): 0.4971 D(G(z)): 0.0273 / 0.2219
[2/5][900/1583] Loss_D: 1.8198 Loss_G: 7.3766 D(x): 0.9608 D(G(z)): 0.7716 / 0.0011
[2/5][950/1583] Loss_D: 0.6357 Loss_G: 2.0299 D(x): 0.6776 D(G(z)): 0.1628 / 0.1611
[2/5][1000/1583] Loss_D: 0.6132 Loss_G: 2.0684 D(x): 0.7450 D(G(z)): 0.2251 / 0.1619
[2/5][1050/1583] Loss_D: 0.7619 Loss_G: 2.4935 D(x): 0.7130 D(G(z)): 0.2781 / 0.1119
[2/5][1100/1583] Loss_D: 0.8821 Loss_G: 3.3167 D(x): 0.8447 D(G(z)): 0.4645 / 0.0479
[2/5][1150/1583] Loss_D: 0.6693 Loss_G: 3.3267 D(x): 0.8389 D(G(z)): 0.3498 / 0.0491
[2/5][1200/1583] Loss_D: 2.8507 Loss_G: 3.6275 D(x): 0.9599 D(G(z)): 0.8868 / 0.0487
[2/5][1250/1583] Loss_D: 0.6216 Loss_G: 1.5313 D(x): 0.6500 D(G(z)): 0.1209 / 0.2588
[2/5][1300/1583] Loss_D: 0.9154 Loss_G: 1.4103 D(x): 0.6139 D(G(z)): 0.2621 / 0.3065
[2/5][1350/1583] Loss_D: 0.5813 Loss_G: 2.0524 D(x): 0.7163 D(G(z)): 0.1839 / 0.1643
[2/5][1400/1583] Loss_D: 0.9255 Loss_G: 3.4883 D(x): 0.8739 D(G(z)): 0.4971 / 0.0447
[2/5][1450/1583] Loss_D: 0.5381 Loss_G: 2.7330 D(x): 0.8071 D(G(z)): 0.2341 / 0.0863
[2/5][1500/1583] Loss_D: 0.8641 Loss_G: 3.7736 D(x): 0.8959 D(G(z)): 0.4793 / 0.0394
[2/5][1550/1583] Loss_D: 0.4998 Loss_G: 2.8948 D(x): 0.8378 D(G(z)): 0.2463 / 0.0696
[3/5][0/1583] Loss_D: 0.5535 Loss_G: 2.4292 D(x): 0.7707 D(G(z)): 0.2153 / 0.1161
[3/5][50/1583] Loss_D: 0.7244 Loss_G: 1.2329 D(x): 0.6029 D(G(z)): 0.1422 / 0.3358
[3/5][100/1583] Loss_D: 1.4589 Loss_G: 4.9297 D(x): 0.9043 D(G(z)): 0.6905 / 0.0123
[3/5][150/1583] Loss_D: 0.6256 Loss_G: 1.8417 D(x): 0.6203 D(G(z)): 0.0813 / 0.1997
[3/5][200/1583] Loss_D: 0.6826 Loss_G: 1.8347 D(x): 0.6894 D(G(z)): 0.2161 / 0.1913
[3/5][250/1583] Loss_D: 0.4623 Loss_G: 3.0719 D(x): 0.8548 D(G(z)): 0.2436 / 0.0591
[3/5][300/1583] Loss_D: 0.7182 Loss_G: 2.8059 D(x): 0.7828 D(G(z)): 0.3344 / 0.0778
[3/5][350/1583] Loss_D: 0.6356 Loss_G: 2.2965 D(x): 0.7857 D(G(z)): 0.2891 / 0.1301
[3/5][400/1583] Loss_D: 0.8835 Loss_G: 1.3368 D(x): 0.4911 D(G(z)): 0.0614 / 0.3357
[3/5][450/1583] Loss_D: 0.6453 Loss_G: 2.8059 D(x): 0.8005 D(G(z)): 0.3023 / 0.0775
[3/5][500/1583] Loss_D: 0.5163 Loss_G: 2.7763 D(x): 0.8365 D(G(z)): 0.2609 / 0.0776
[3/5][550/1583] Loss_D: 0.7250 Loss_G: 1.3377 D(x): 0.6127 D(G(z)): 0.1401 / 0.3140
[3/5][600/1583] Loss_D: 0.7971 Loss_G: 1.8226 D(x): 0.5565 D(G(z)): 0.1058 / 0.2088
[3/5][650/1583] Loss_D: 0.6572 Loss_G: 1.7603 D(x): 0.5801 D(G(z)): 0.0513 / 0.2363
[3/5][700/1583] Loss_D: 0.5896 Loss_G: 1.7196 D(x): 0.6850 D(G(z)): 0.1246 / 0.2207
[3/5][750/1583] Loss_D: 0.7604 Loss_G: 1.6644 D(x): 0.6305 D(G(z)): 0.1943 / 0.2383
[3/5][800/1583] Loss_D: 0.6920 Loss_G: 1.2966 D(x): 0.6430 D(G(z)): 0.1687 / 0.3155
[3/5][850/1583] Loss_D: 0.6209 Loss_G: 2.4020 D(x): 0.7574 D(G(z)): 0.2551 / 0.1208
[3/5][900/1583] Loss_D: 0.5545 Loss_G: 2.7171 D(x): 0.8430 D(G(z)): 0.2887 / 0.0896
[3/5][950/1583] Loss_D: 0.5949 Loss_G: 1.3137 D(x): 0.6644 D(G(z)): 0.1281 / 0.3140
[3/5][1000/1583] Loss_D: 0.9711 Loss_G: 4.4291 D(x): 0.9097 D(G(z)): 0.5342 / 0.0182
[3/5][1050/1583] Loss_D: 0.7687 Loss_G: 0.8587 D(x): 0.5773 D(G(z)): 0.1312 / 0.4574
[3/5][1100/1583] Loss_D: 0.4927 Loss_G: 2.0443 D(x): 0.7850 D(G(z)): 0.1906 / 0.1592
[3/5][1150/1583] Loss_D: 0.5630 Loss_G: 1.8211 D(x): 0.7713 D(G(z)): 0.2102 / 0.2043
[3/5][1200/1583] Loss_D: 0.5995 Loss_G: 1.6035 D(x): 0.7130 D(G(z)): 0.1803 / 0.2640
[3/5][1250/1583] Loss_D: 0.9193 Loss_G: 3.8818 D(x): 0.8983 D(G(z)): 0.5078 / 0.0313
[3/5][1300/1583] Loss_D: 0.7717 Loss_G: 1.5874 D(x): 0.5402 D(G(z)): 0.0607 / 0.2567
[3/5][1350/1583] Loss_D: 0.6796 Loss_G: 1.2542 D(x): 0.6187 D(G(z)): 0.1308 / 0.3251
[3/5][1400/1583] Loss_D: 0.9092 Loss_G: 2.9280 D(x): 0.7706 D(G(z)): 0.4203 / 0.0727
[3/5][1450/1583] Loss_D: 0.7959 Loss_G: 2.6819 D(x): 0.7396 D(G(z)): 0.3427 / 0.0891
[3/5][1500/1583] Loss_D: 0.8997 Loss_G: 4.2281 D(x): 0.9033 D(G(z)): 0.4965 / 0.0231
[3/5][1550/1583] Loss_D: 0.5710 Loss_G: 2.3582 D(x): 0.8097 D(G(z)): 0.2658 / 0.1170
[4/5][0/1583] Loss_D: 1.0899 Loss_G: 3.6505 D(x): 0.9176 D(G(z)): 0.5791 / 0.0393
[4/5][50/1583] Loss_D: 0.6311 Loss_G: 3.4409 D(x): 0.8655 D(G(z)): 0.3474 / 0.0444
[4/5][100/1583] Loss_D: 1.4921 Loss_G: 0.8958 D(x): 0.2803 D(G(z)): 0.0198 / 0.4670
[4/5][150/1583] Loss_D: 0.6338 Loss_G: 1.8484 D(x): 0.6468 D(G(z)): 0.1265 / 0.2014
[4/5][200/1583] Loss_D: 0.5472 Loss_G: 2.0001 D(x): 0.6843 D(G(z)): 0.1071 / 0.1692
[4/5][250/1583] Loss_D: 0.5886 Loss_G: 2.4002 D(x): 0.8189 D(G(z)): 0.2809 / 0.1169
[4/5][300/1583] Loss_D: 0.7145 Loss_G: 2.7032 D(x): 0.7241 D(G(z)): 0.2826 / 0.0867
[4/5][350/1583] Loss_D: 0.6507 Loss_G: 2.6337 D(x): 0.7538 D(G(z)): 0.2660 / 0.0921
[4/5][400/1583] Loss_D: 0.6163 Loss_G: 2.3410 D(x): 0.7091 D(G(z)): 0.1930 / 0.1257
[4/5][450/1583] Loss_D: 0.6186 Loss_G: 1.3978 D(x): 0.6509 D(G(z)): 0.1225 / 0.2974
[4/5][500/1583] Loss_D: 0.5425 Loss_G: 2.0538 D(x): 0.7397 D(G(z)): 0.1706 / 0.1655
[4/5][550/1583] Loss_D: 0.6667 Loss_G: 2.0522 D(x): 0.6715 D(G(z)): 0.1869 / 0.1629
[4/5][600/1583] Loss_D: 0.5885 Loss_G: 1.2409 D(x): 0.6456 D(G(z)): 0.0869 / 0.3425
[4/5][650/1583] Loss_D: 0.6649 Loss_G: 1.5807 D(x): 0.6140 D(G(z)): 0.0954 / 0.2572
[4/5][700/1583] Loss_D: 0.9344 Loss_G: 2.9319 D(x): 0.7927 D(G(z)): 0.4342 / 0.0777
[4/5][750/1583] Loss_D: 0.7034 Loss_G: 1.5209 D(x): 0.6573 D(G(z)): 0.1946 / 0.2577
[4/5][800/1583] Loss_D: 0.6230 Loss_G: 1.8376 D(x): 0.6444 D(G(z)): 0.1186 / 0.2033
[4/5][850/1583] Loss_D: 0.9479 Loss_G: 1.1087 D(x): 0.4895 D(G(z)): 0.1049 / 0.3843
[4/5][900/1583] Loss_D: 0.6910 Loss_G: 2.1991 D(x): 0.7092 D(G(z)): 0.2506 / 0.1353
[4/5][950/1583] Loss_D: 0.5390 Loss_G: 2.7111 D(x): 0.9007 D(G(z)): 0.3272 / 0.0818
[4/5][1000/1583] Loss_D: 0.5419 Loss_G: 2.9262 D(x): 0.8417 D(G(z)): 0.2792 / 0.0703
[4/5][1050/1583] Loss_D: 0.6497 Loss_G: 3.7239 D(x): 0.9025 D(G(z)): 0.3777 / 0.0342
[4/5][1100/1583] Loss_D: 0.6019 Loss_G: 2.6325 D(x): 0.7952 D(G(z)): 0.2700 / 0.0994
[4/5][1150/1583] Loss_D: 0.8389 Loss_G: 3.2277 D(x): 0.8150 D(G(z)): 0.4176 / 0.0536
[4/5][1200/1583] Loss_D: 1.0132 Loss_G: 0.8859 D(x): 0.4295 D(G(z)): 0.0338 / 0.4568
[4/5][1250/1583] Loss_D: 0.4624 Loss_G: 2.7425 D(x): 0.8272 D(G(z)): 0.2128 / 0.0836
[4/5][1300/1583] Loss_D: 0.5438 Loss_G: 3.2151 D(x): 0.9361 D(G(z)): 0.3324 / 0.0575
[4/5][1350/1583] Loss_D: 0.6064 Loss_G: 1.6269 D(x): 0.7102 D(G(z)): 0.1870 / 0.2341
[4/5][1400/1583] Loss_D: 0.9716 Loss_G: 4.9775 D(x): 0.9553 D(G(z)): 0.5527 / 0.0105
[4/5][1450/1583] Loss_D: 0.6502 Loss_G: 1.7412 D(x): 0.7370 D(G(z)): 0.2460 / 0.2141
[4/5][1500/1583] Loss_D: 0.6025 Loss_G: 1.4075 D(x): 0.6649 D(G(z)): 0.1190 / 0.2875
[4/5][1550/1583] Loss_D: 0.8561 Loss_G: 1.3271 D(x): 0.5570 D(G(z)): 0.1320 / 0.3349
```

## 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()
```

**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())
```

**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()
```

## 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:** ( 28 minutes 51.271 seconds)