convolution-model-step-by-step-v1

March 19, 2024

1 Convolutional Neural Networks: Step by Step

Welcome to Course 4’s first assignment! In this assignment, you will implement convolutional
(CONV) and pooling (POOL) layers in numpy, including both forward propagation and (optionally)
backward propagation.
By the end of this notebook, you’ll be able to:
• Explain the convolution operation
• Apply two different types of pooling operation
• Identify the components used in a convolutional neural network (padding, stride, filter, …)
and their purpose
• Build a convolutional neural network
Notation: - Superscript [𝑙] denotes an object of the 𝑙𝑡ℎ layer. - Example: 𝑎[4] is the 4𝑡ℎ layer
activation. 𝑊 [5] and 𝑏[5] are the 5𝑡ℎ layer parameters.
• Superscript (𝑖) denotes an object from the 𝑖𝑡ℎ example.
– Example: 𝑥(𝑖) is the 𝑖𝑡ℎ training example input.
• Subscript 𝑖 denotes the 𝑖𝑡ℎ entry of a vector.
[𝑙]
– Example: 𝑎𝑖 denotes the 𝑖𝑡ℎ entry of the activations in layer 𝑙, assuming this is a fully
connected (FC) layer.
• 𝑛𝐻 , 𝑛𝑊 and 𝑛𝐶 denote respectively the height, width and number of channels of a given
[𝑙] [𝑙] [𝑙]
layer. If you want to reference a specific layer 𝑙, you can also write 𝑛𝐻 , 𝑛𝑊 , 𝑛𝐶 .
• 𝑛𝐻𝑝𝑟𝑒𝑣 , 𝑛𝑊𝑝𝑟𝑒𝑣 and 𝑛𝐶𝑝𝑟𝑒𝑣 denote respectively the height, width and number of channels of
[𝑙−1] [𝑙−1]
the previous layer. If referencing a specific layer 𝑙, this could also be denoted 𝑛𝐻 , 𝑛𝑊 ,
[𝑙−1]
𝑛𝐶 .
You should be familiar with numpy and/or have completed the previous courses of the specialization.
Let’s get started!

1.1 Important Note on Submission to the AutoGrader

Before submitting your assignment to the AutoGrader, please make sure you are not doing the
following:
1. You have not added any extra print statement(s) in the assignment.
2. You have not added any extra code cell(s) in the assignment.
3. You have not changed any of the function parameters.
4. You are not using any global variables inside your graded exercises. Unless specifically in-
structed to do so, please refrain from it and use the local variables instead.

1
 5. You are not changing the assignment code where it is not required, like creating extra variables.
If you do any of the following, you will get something like, Grader Error: Grader feedback
not found (or similarly unexpected) error upon submitting your assignment. Before asking for
help/debugging the errors in your assignment, check for these first. If this is the case, and you
don’t remember the changes you have made, you can get a fresh copy of the assignment by following
these instructions.

1.2 Table of Contents

• 1 - Packages
• 2 - Outline of the Assignment
• 3 - Convolutional Neural Networks
– 3.1 - Zero-Padding
∗ Exercise 1 - zero_pad
– 3.2 - Single Step of Convolution
∗ Exercise 2 - conv_single_step
– 3.3 - Convolutional Neural Networks - Forward Pass
∗ Exercise 3 - conv_forward
• 4 - Pooling Layer
– 4.1 - Forward Pooling
∗ Exercise 4 - pool_forward
• 5 - Backpropagation in Convolutional Neural Networks (OPTIONAL / UNGRADED)
– 5.1 - Convolutional Layer Backward Pass
∗ 5.1.1 - Computing dA
∗ 5.1.2 - Computing dW
∗ 5.1.3 - Computing db
· Exercise 5 - conv_backward
– 5.2 Pooling Layer - Backward Pass
∗ 5.2.1 Max Pooling - Backward Pass
· Exercise 6 - create_mask_from_window
∗ 5.2.2 - Average Pooling - Backward Pass
· Exercise 7 - distribute_value
∗ 5.2.3 Putting it Together: Pooling Backward
· Exercise 8 - pool_backward
## 1 - Packages
Let’s first import all the packages that you will need during this assignment. - numpy is the
fundamental package for scientific computing with Python. - matplotlib is a library to plot graphs
in Python. - np.random.seed(1) is used to keep all the random function calls consistent. This helps
to grade your work.
[1]: ### v1.1

[2]: import numpy as np

import h5py
import matplotlib.pyplot as plt
from public_tests import *

2
%matplotlib inline
plt.rcParams['figure.figsize'] = (5.0, 4.0) # set default size of plots
plt.rcParams['image.interpolation'] = 'nearest'
plt.rcParams['image.cmap'] = 'gray'

%load_ext autoreload
%autoreload 2

np.random.seed(1)

## 2 - Outline of the Assignment

You will be implementing the building blocks of a convolutional neural network! Each function you
will implement will have detailed instructions to walk you through the steps:
• Convolution functions, including:
– Zero Padding
– Convolve window
– Convolution forward
– Convolution backward (optional)
• Pooling functions, including:
– Pooling forward
– Create mask
– Distribute value
– Pooling backward (optional)
This notebook will ask you to implement these functions from scratch in numpy. In the next
notebook, you will use the TensorFlow equivalents of these functions to build the following model:
Note: For every forward function, there is a corresponding backward equivalent. Hence, at every
step of your forward module you will store some parameters in a cache. These parameters are used
to compute gradients during backpropagation.
## 3 - Convolutional Neural Networks
Although programming frameworks make convolutions easy to use, they remain one of the hardest
concepts to understand in Deep Learning. A convolution layer transforms an input volume into an
output volume of different size, as shown below.
In this part, you will build every step of the convolution layer. You will first implement two helper
functions: one for zero padding and the other for computing the convolution function itself.
### 3.1 - Zero-Padding
Zero-padding adds zeros around the border of an image:
Figure 1 : Zero-Padding Image (3 channels, RGB) with a padding of 2.
The main benefits of padding are:
• It allows you to use a CONV layer without necessarily shrinking the height and width of the
volumes. This is important for building deeper networks, since otherwise the height/width

3
 would shrink as you go to deeper layers. An important special case is the “same” convolution,
in which the height/width is exactly preserved after one layer.
• It helps us keep more of the information at the border of an image. Without padding, very
few values at the next layer would be affected by pixels at the edges of an image.
### Exercise 1 - zero_pad Implement the following function, which pads all the images of a batch
of examples X with zeros. Use np.pad. Note if you want to pad the array “a” of shape (5, 5, 5, 5, 5)
with pad = 1 for the 2nd dimension, pad = 3 for the 4th dimension and pad = 0 for the rest, you
would do:
a = np.pad(a, ((0,0), (1,1), (0,0), (3,3), (0,0)), mode='constant', constant_values = (0,0))
[25]: # GRADED FUNCTION: zero_pad

def zero_pad(X, pad):

"""
Pad with zeros all images of the dataset X. The padding is applied to the␣
↪height and width of an image,

as illustrated in Figure 1.

Argument:
X -- python numpy array of shape (m, n_H, n_W, n_C) representing a batch of␣
↪m images

pad -- integer, amount of padding around each image on vertical and␣

↪horizontal dimensions

Returns:
X_pad -- padded image of shape (m, n_H + 2 * pad, n_W + 2 * pad, n_C)
"""

#(� 1 line)
# X_pad = None
# YOUR CODE STARTS HERE
X_pad = np.pad(X, ((0,0), (pad, pad), (pad,pad), (0,0)), 'constant',␣
↪constant_values = 0)

# YOUR CODE ENDS HERE

return X_pad

[26]: np.random.seed(1)
x = np.random.randn(4, 3, 3, 2)
x_pad = zero_pad(x, 3)
print ("x.shape =\n", x.shape)
print ("x_pad.shape =\n", x_pad.shape)
print ("x[1,1] =\n", x[1, 1])
print ("x_pad[1,1] =\n", x_pad[1, 1])

fig, axarr = plt.subplots(1, 2)

4
axarr[0].set_title('x')
axarr[0].imshow(x[0, :, :, 0])
axarr[1].set_title('x_pad')
axarr[1].imshow(x_pad[0, :, :, 0])
zero_pad_test(zero_pad)

x.shape =
(4, 3, 3, 2)
x_pad.shape =
(4, 9, 9, 2)
x[1,1] =
[[ 0.90085595 -0.68372786]
[-0.12289023 -0.93576943]
[-0.26788808 0.53035547]]
x_pad[1,1] =
[[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]]
x.shape =
(4, 3, 3, 2)
x_pad.shape =
(4, 9, 9, 2)
x[1,1] =
[[ 0.90085595 -0.68372786]
[-0.12289023 -0.93576943]
[-0.26788808 0.53035547]]
x_pad[1,1] =
[[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]
[0. 0.]]
[[0. 0. 0. 0. 0. 0. 0. 0. 0.]
[0. 0. 0. 0. 0. 0. 0. 0. 0.]]
All tests passed!

5
 ### 3.2 - Single Step of Convolution
In this part, implement a single step of convolution, in which you apply the filter to a single position
of the input. This will be used to build a convolutional unit, which:
• Takes an input volume
• Applies a filter at every position of the input
• Outputs another volume (usually of different size)
Figure 2 : Convolution operation with a filter of 3x3 and a stride of 1 (stride = amount you move
the window each time you slide)
In a computer vision application, each value in the matrix on the left corresponds to a single pixel
value. You convolve a 3x3 filter with the image by multiplying its values element-wise with the
original matrix, then summing them up and adding a bias. In this first step of the exercise, you
will implement a single step of convolution, corresponding to applying a filter to just one of the
positions to get a single real-valued output.
Later in this notebook, you’ll apply this function to multiple positions of the input to implement
the full convolutional operation.
### Exercise 2 - conv_single_step Implement conv_single_step().
Hint.
Note: The variable b will be passed in as a numpy array. If you add a scalar (a float or integer)
to a numpy array, the result is a numpy array. In the special case of a numpy array containing a
single value, you can cast it as a float to convert it to a scalar.
[30]: # GRADED FUNCTION: conv_single_step

def conv_single_step(a_slice_prev, W, b):

"""
Apply one filter defined by parameters W on a single slice (a_slice_prev)␣
↪of the output activation

6
 of the previous layer.

Arguments:
a_slice_prev -- slice of input data of shape (f, f, n_C_prev)
W -- Weight parameters contained in a window - matrix of shape (f, f,␣
↪n_C_prev)

b -- Bias parameters contained in a window - matrix of shape (1, 1, 1)

Returns:
Z -- a scalar value, the result of convolving the sliding window (W, b) on␣
↪a slice x of the input data

"""

#(� 3 lines of code)

# Element-wise product between a_slice_prev and W. Do not add the bias yet.
# s = None
# Sum over all entries of the volume s.
# Z = None
# Add bias b to Z. Cast b to a float() so that Z results in a scalar value.
# Z = None
# YOUR CODE STARTS HERE
s = np.multiply(a_slice_prev, W)
Z = np.sum(s)
Z = float(b) + Z

# YOUR CODE ENDS HERE

return Z

[31]: np.random.seed(1)
a_slice_prev = np.random.randn(4, 4, 3)
W = np.random.randn(4, 4, 3)
b = np.random.randn(1, 1, 1)

Z = conv_single_step(a_slice_prev, W, b)
print("Z =", Z)
conv_single_step_test(conv_single_step)

assert (type(Z) == np.float64), "You must cast the output to numpy float 64"
assert np.isclose(Z, -6.999089450680221), "Wrong value"

Z = -6.999089450680221
All tests passed!
### 3.3 - Convolutional Neural Networks - Forward Pass
In the forward pass, you will take many filters and convolve them on the input. Each ‘convolution’
gives you a 2D matrix output. You will then stack these outputs to get a 3D volume:

7
### Exercise 3 - conv_forward Implement the function below to convolve the filters W on an input
activation A_prev.
This function takes the following inputs: * A_prev, the activations output by the previous layer
(for a batch of m inputs); * Weights are denoted by W. The filter window size is f by f. * The bias
vector is b, where each filter has its own (single) bias.
You also have access to the hyperparameters dictionary, which contains the stride and the padding.
Hint: 1. To select a 2x2 slice at the upper left corner of a matrix “a_prev” (shape (5,5,3)), you
would do:
a_slice_prev = a_prev[0:2,0:2,:]
Notice how this gives a 3D slice that has height 2, width 2, and depth 3. Depth is the number of
channels.
This will be useful when you will define a_slice_prev below, using the start/end indexes you
will define.
2. To define a_slice you will need to first define its corners vert_start, vert_end, horiz_start
and horiz_end. This figure may be helpful for you to find out how each of the corners can
be defined using h, w, f and s in the code below.
Figure 3 : Definition of a slice using vertical and horizontal start/end (with a 2x2 filter) This figure
shows only a single channel.
Reminder:
The formulas relating the output shape of the convolution to the input shape are:

𝑛𝐻𝑝𝑟𝑒𝑣 − 𝑓 + 2 × 𝑝𝑎𝑑
𝑛𝐻 = ⌊ ⌋+1
𝑠𝑡𝑟𝑖𝑑𝑒
𝑛𝑊𝑝𝑟𝑒𝑣 − 𝑓 + 2 × 𝑝𝑎𝑑
𝑛𝑊 = ⌊ ⌋+1
𝑠𝑡𝑟𝑖𝑑𝑒
𝑛𝐶 = number of filters used in the convolution

For this exercise, don’t worry about vectorization! Just implement everything with for-loops.

Additional Hints (if you’re stuck):

• Use array slicing (e.g.varname[0:1,:,3:5]) for the following variables:
a_prev_pad ,W, b
– Copy the starter code of the function and run it outside of the defined function, in
separate cells.

– Check that the subset of each array is the size and dimension that you’re expecting.

• To decide how to get the vert_start, vert_end, horiz_start, horiz_end, remember that
these are indices of the previous layer.
– Draw an example of a previous padded layer (8 x 8, for instance), and the current
(output layer) (2 x 2, for instance).

8
 – The output layer’s indices are denoted by h and w.

• Make sure that a_slice_prev has a height, width and depth.

• Remember that a_prev_pad is a subset of A_prev_pad.
– Think about which one should be used within the for loops.
[6]: # GRADED FUNCTION: conv_forward

def conv_forward(A_prev, W, b, hparameters):

"""
Implements the forward propagation for a convolution function

Arguments:
A_prev -- output activations of the previous layer,
numpy array of shape (m, n_H_prev, n_W_prev, n_C_prev)
W -- Weights, numpy array of shape (f, f, n_C_prev, n_C)
b -- Biases, numpy array of shape (1, 1, 1, n_C)
hparameters -- python dictionary containing "stride" and "pad"

Returns:
Z -- conv output, numpy array of shape (m, n_H, n_W, n_C)
cache -- cache of values needed for the conv_backward() function
"""

# Retrieve dimensions from A_prev's shape (�1 line)

# (m, n_H_prev, n_W_prev, n_C_prev) = None

# Retrieve dimensions from W's shape (�1 line)

# (f, f, n_C_prev, n_C) = None

# Retrieve information from "hparameters" (�2 lines)

# stride = None
# pad = None

# Compute the dimensions of the CONV output volume using the formula given␣
↪above.
# Hint: use int() to apply the 'floor' operation. (�2 lines)
# n_H = None
# n_W = None

# Initialize the output volume Z with zeros. (�1 line)

# Z = None

# Create A_prev_pad by padding A_prev

# A_prev_pad = None

9
 # for i in range(None): # loop over the batch of training␣
↪examples
# a_prev_pad = None # Select ith training example's␣
↪padded activation

# for h in range(None): # loop over vertical axis of the␣

↪output volume

# Find the vertical start and end of the current "slice" (�2 lines)
# vert_start = None
# vert_end = None

# for w in range(None): # loop over horizontal axis of the␣

↪output volume

# Find the horizontal start and end of the current "slice" (�2␣
↪lines)

# horiz_start = None
# horiz_end = None

# for c in range(None): # loop over channels (= #filters) of␣

↪the output volume

# Use the corners to define the (3D) slice of a_prev_pad␣

↪(See Hint above the cell). (�1 line)
# a_slice_prev = None

# Convolve the (3D) slice with the correct filter W and␣

↪bias b, to get back one output neuron. (�3 line)
# weights = None
# biases = None
# Z[i, h, w, c] = None
# YOUR CODE STARTS HERE

(m, n_H_prev, n_W_prev, n_C_prev) = A_prev.shape

# Retrieve dimensions from W's shape (�1 line)

(f, f, n_C_prev, n_C) = W.shape

# Retrieve information from "hparameters" (�2 lines)

stride = hparameters['stride']
pad = hparameters['pad']

# Compute the dimensions of the CONV output volume using the formula given␣
↪above.

# Hint: use int() to apply the 'floor' operation. (�2 lines)

n_H = int((n_H_prev - f + 2 * pad) / stride) + 1
n_W = int((n_W_prev - f + 2 * pad) / stride) + 1

10
 # Initialize the output volume Z with zeros. (�1 line)
Z = np.zeros((m, n_H, n_W, n_C))

# Create A_prev_pad by padding A_prev

A_prev_pad = zero_pad(A_prev, pad)

for i in range(m): # loop over the batch of training examples

a_prev_pad = A_prev_pad[i] # Select ith training␣
↪example's padded activation

for h in range(n_H): # loop over vertical axis of the output␣

↪volume

# Find the vertical start and end of the current "slice" (�2 lines)
vert_start = h * stride
vert_end = vert_start + f

for w in range(n_W): # loop over horizontal axis of the␣

↪output volume

# Find the horizontal start and end of the current "slice" (�2␣
↪lines)

horiz_start = w * stride
horiz_end = horiz_start + f

for c in range(n_C): # loop over channels (= #filters) of the␣

↪output volume

# Use the corners to define the (3D) slice of a_prev_pad␣

↪(See Hint above the cell). (�1 line)
a_slice_prev = a_prev_pad[vert_start:vert_end, horiz_start:
↪horiz_end, :]

# Convolve the (3D) slice with the correct filter W and␣

↪bias b, to get back one output neuron. (�3 line)

weights = W[:, :, :, c]
biases = b[:, :, :, c]
Z[i, h, w, c] = conv_single_step(a_slice_prev, weights,␣
↪biases)

# YOUR CODE ENDS HERE

# Save information in "cache" for the backprop

cache = (A_prev, W, b, hparameters)

return Z, cache

11
[7]: np.random.seed(1)
A_prev = np.random.randn(2, 5, 7, 4)
W = np.random.randn(3, 3, 4, 8)
b = np.random.randn(1, 1, 1, 8)
hparameters = {"pad" : 1,
"stride": 2}

Z, cache_conv = conv_forward(A_prev, W, b, hparameters)

z_mean = np.mean(Z)
z_0_2_1 = Z[0, 2, 1]
cache_0_1_2_3 = cache_conv[0][1][2][3]
print("Z's mean =\n", z_mean)
print("Z[0,2,1] =\n", z_0_2_1)
print("cache_conv[0][1][2][3] =\n", cache_0_1_2_3)

conv_forward_test_1(z_mean, z_0_2_1, cache_0_1_2_3)

conv_forward_test_2(conv_forward)

Z's mean =
0.5511276474566768
Z[0,2,1] =
[-2.17796037 8.07171329 -0.5772704 3.36286738 4.48113645 -2.89198428
10.99288867 3.03171932]
cache_conv[0][1][2][3] =
[-1.1191154 1.9560789 -0.3264995 -1.34267579]
First Test: All tests passed!
Second Test: All tests passed!
Finally, a CONV layer should also contain an activation, in which case you would add the following
line of code:
# Convolve the window to get back one output neuron
Z[i, h, w, c] = ...
# Apply activation
A[i, h, w, c] = activation(Z[i, h, w, c])
You don’t need to do it here, however.
## 4 - Pooling Layer
The pooling (POOL) layer reduces the height and width of the input. It helps reduce computation,
as well as helps make feature detectors more invariant to its position in the input. The two types
of pooling layers are:
• Max-pooling layer: slides an (𝑓, 𝑓) window over the input and stores the max value of the
window in the output.
• Average-pooling layer: slides an (𝑓, 𝑓) window over the input and stores the average value of
the window in the output.
These pooling layers have no parameters for backpropagation to train. However, they have hyper-

12
 parameters such as the window size 𝑓. This specifies the height and width of the 𝑓 × 𝑓 window you
would compute a max or average over.
### 4.1 - Forward Pooling Now, you are going to implement MAX-POOL and AVG-POOL, in
the same function.
### Exercise 4 - pool_forward
Implement the forward pass of the pooling layer. Follow the hints in the comments below.
Reminder: As there’s no padding, the formulas binding the output shape of the pooling to the
input shape is:

𝑛𝐻𝑝𝑟𝑒𝑣 − 𝑓
𝑛𝐻 = ⌊ ⌋+1
𝑠𝑡𝑟𝑖𝑑𝑒

𝑛𝑊𝑝𝑟𝑒𝑣 − 𝑓
𝑛𝑊 = ⌊ ⌋+1
𝑠𝑡𝑟𝑖𝑑𝑒

𝑛𝐶 = 𝑛𝐶𝑝𝑟𝑒𝑣

[17]: # GRADED FUNCTION: pool_forward

def pool_forward(A_prev, hparameters, mode = "max"):

"""
Implements the forward pass of the pooling layer

Arguments:
A_prev -- Input data, numpy array of shape (m, n_H_prev, n_W_prev, n_C_prev)
hparameters -- python dictionary containing "f" and "stride"
mode -- the pooling mode you would like to use, defined as a string ("max"␣
↪or "average")

Returns:
A -- output of the pool layer, a numpy array of shape (m, n_H, n_W, n_C)
cache -- cache used in the backward pass of the pooling layer, contains the␣
↪input and hparameters

"""

# Retrieve dimensions from the input shape

(m, n_H_prev, n_W_prev, n_C_prev) = A_prev.shape

# Retrieve hyperparameters from "hparameters"

f = hparameters["f"]
stride = hparameters["stride"]

# Define the dimensions of the output

n_H = int(1 + (n_H_prev - f) / stride)

13
 n_W = int(1 + (n_W_prev - f) / stride)
n_C = n_C_prev

# Initialize output matrix A

A = np.zeros((m, n_H, n_W, n_C))

# for i in range(None): # loop over the training␣

↪examples
# for h in range(None): # loop on the vertical axis␣
↪of the output volume

# Find the vertical start and end of the current "slice" (�2 lines)
# vert_start = None
# vert_end = None

# for w in range(None): # loop on the horizontal␣

↪axis of the output volume
# Find the vertical start and end of the current "slice" (�2␣
↪lines)

# horiz_start = None
# horiz_end = None

# for c in range (None): # loop over the channels of␣

↪the output volume

# Use the corners to define the current slice on the ith␣

↪training example of A_prev, channel c. (�1 line)

# a_prev_slice = None

# Compute the pooling operation on the slice.

# Use an if statement to differentiate the modes.
# Use np.max and np.mean.
# if mode == "max":
# A[i, h, w, c] = None
# elif mode == "average":
# A[i, h, w, c] = None

# YOUR CODE STARTS HERE

for i in range(m): # loop over the training examples
for h in range(n_H): # loop on the vertical axis of␣
↪the output volume

# Find the vertical start and end of the current "slice" (�2 lines)
vert_start = h * stride
vert_end = vert_start + f

for w in range(n_W): # loop on the horizontal axis of␣

↪the output volume

14
 # Find the vertical start and end of the current "slice" (�2␣
↪lines)
horiz_start = w * stride
horiz_end = horiz_start + f

for c in range(n_C): # loop over the channels of the␣

↪output volume

# Use the corners to define the current slice on the ith␣

↪training example of A_prev, channel c. (�1 line)

a_prev_slice = A_prev[i, vert_start:vert_end, horiz_start:

↪horiz_end, c]

# Compute the pooling operation on the slice.

# Use an if statement to differentiate the modes.
# Use np.max and np.mean.
if mode == "max":
A[i, h, w, c] = np.max(a_prev_slice)
elif mode == "average":
A[i, h, w, c] = np.mean(a_prev_slice)

# YOUR CODE ENDS HERE

# Store the input and hparameters in "cache" for pool_backward()

cache = (A_prev, hparameters)

# Making sure your output shape is correct

#assert(A.shape == (m, n_H, n_W, n_C))

return A, cache

[18]: # Case 1: stride of 1

print("CASE 1:\n")
np.random.seed(1)
A_prev_case_1 = np.random.randn(2, 5, 5, 3)
hparameters_case_1 = {"stride" : 1, "f": 3}

A, cache = pool_forward(A_prev_case_1, hparameters_case_1, mode = "max")

print("mode = max")
print("A.shape = " + str(A.shape))
print("A[1, 1] =\n", A[1, 1])
A, cache = pool_forward(A_prev_case_1, hparameters_case_1, mode = "average")
print("mode = average")
print("A.shape = " + str(A.shape))
print("A[1, 1] =\n", A[1, 1])

15
pool_forward_test_1(pool_forward)

# Case 2: stride of 2
print("\n\033[0mCASE 2:\n")
np.random.seed(1)
A_prev_case_2 = np.random.randn(2, 5, 5, 3)
hparameters_case_2 = {"stride" : 2, "f": 3}

A, cache = pool_forward(A_prev_case_2, hparameters_case_2, mode = "max")

print("mode = max")
print("A.shape = " + str(A.shape))
print("A[0] =\n", A[0])
print()

A, cache = pool_forward(A_prev_case_2, hparameters_case_2, mode = "average")

print("mode = average")
print("A.shape = " + str(A.shape))
print("A[1] =\n", A[1])

pool_forward_test_2(pool_forward)

CASE 1:

mode = max
A.shape = (2, 3, 3, 3)
A[1, 1] =
[[1.96710175 0.84616065 1.27375593]
[1.96710175 0.84616065 1.23616403]
[1.62765075 1.12141771 1.2245077 ]]
mode = average
A.shape = (2, 3, 3, 3)
A[1, 1] =
[[ 0.44497696 -0.00261695 -0.31040307]
[ 0.50811474 -0.23493734 -0.23961183]
[ 0.11872677 0.17255229 -0.22112197]]
All tests passed!
CASE 2:

mode = max
A.shape = (2, 2, 2, 3)
A[0] =
[[[1.74481176 0.90159072 1.65980218]
[1.74481176 1.6924546 1.65980218]]

[[1.13162939 1.51981682 2.18557541]

[1.13162939 1.6924546 2.18557541]]]

16
mode = average
A.shape = (2, 2, 2, 3)
A[1] =
[[[-0.17313416 0.32377198 -0.34317572]
[ 0.02030094 0.14141479 -0.01231585]]

[[ 0.42944926 0.08446996 -0.27290905]

[ 0.15077452 0.28911175 0.00123239]]]
All tests passed!
Expected output
CASE 1:

mode = max
A.shape = (2, 3, 3, 3)
A[1, 1] =
[[1.96710175 0.84616065 1.27375593]
[1.96710175 0.84616065 1.23616403]
[1.62765075 1.12141771 1.2245077 ]]
mode = average
A.shape = (2, 3, 3, 3)
A[1, 1] =
[[ 0.44497696 -0.00261695 -0.31040307]
[ 0.50811474 -0.23493734 -0.23961183]
[ 0.11872677 0.17255229 -0.22112197]]
All tests passed!

CASE 2:

mode = max
A.shape = (2, 2, 2, 3)
A[0] =
[[[1.74481176 0.90159072 1.65980218]
[1.74481176 1.6924546 1.65980218]]

[[1.13162939 1.51981682 2.18557541]

[1.13162939 1.6924546 2.18557541]]]

mode = average
A.shape = (2, 2, 2, 3)
A[1] =
[[[-0.17313416 0.32377198 -0.34317572]
[ 0.02030094 0.14141479 -0.01231585]]

[[ 0.42944926 0.08446996 -0.27290905]

[ 0.15077452 0.28911175 0.00123239]]]
All tests passed!

17
What you should remember:
• A convolution extracts features from an input image by taking the dot product between the
input data and a 3D array of weights (the filter).
• The 2D output of the convolution is called the feature map
• A convolution layer is where the filter slides over the image and computes the dot product
– This transforms the input volume into an output volume of different size
• Zero padding helps keep more information at the image borders, and is helpful for building
deeper networks, because you can build a CONV layer without shrinking the height and width
of the volumes
• Pooling layers gradually reduce the height and width of the input by sliding a 2D window
over each specified region, then summarizing the features in that region
Congratulations! You have now implemented the forward passes of all the layers of a convolu-
tional network. Great work!
The remainder of this notebook is optional, and will not be graded. If you carry on, just remember
to hit the Submit button to submit your work for grading first.
## 5 - Backpropagation in Convolutional Neural Networks (OPTIONAL / UNGRADED)
In modern deep learning frameworks, you only have to implement the forward pass, and the frame-
work takes care of the backward pass, so most deep learning engineers don’t need to bother with
the details of the backward pass. The backward pass for convolutional networks is complicated.
If you wish, you can work through this optional portion of the notebook to get a sense of what
backprop in a convolutional network looks like.
When in an earlier course you implemented a simple (fully connected) neural network, you used
backpropagation to compute the derivatives with respect to the cost to update the parameters.
Similarly, in convolutional neural networks you can calculate the derivatives with respect to the
cost in order to update the parameters. The backprop equations are not trivial and were not derived
in lecture, but are briefly presented below.
### 5.1 - Convolutional Layer Backward Pass
Let’s start by implementing the backward pass for a CONV layer.
#### 5.1.1 - Computing dA: This is the formula for computing 𝑑𝐴 with respect to the cost for
a certain filter 𝑊𝑐 and a given training example:

𝑛𝐻 𝑛𝑊
𝑑𝐴 += ∑ ∑ 𝑊𝑐 × 𝑑𝑍ℎ𝑤 (1)
ℎ=0 𝑤=0

Where 𝑊𝑐 is a filter and 𝑑𝑍ℎ𝑤 is a scalar corresponding to the gradient of the cost with respect to
the output of the conv layer Z at the hth row and wth column (corresponding to the dot product
taken at the ith stride left and jth stride down). Note that at each time, you multiply the same filter
𝑊𝑐 by a different dZ when updating dA. We do so mainly because when computing the forward
propagation, each filter is dotted and summed by a different a_slice. Therefore when computing
the backprop for dA, you are just adding the gradients of all the a_slices.
In code, inside the appropriate for-loops, this formula translates into:
da_prev_pad[vert_start:vert_end, horiz_start:horiz_end, :] += W[:,:,:,c] * dZ[i, h, w, c]

18
 #### 5.1.2 - Computing dW: This is the formula for computing 𝑑𝑊𝑐 (𝑑𝑊𝑐 is the derivative of
one filter) with respect to the loss:

𝑛𝐻 𝑛𝑊
𝑑𝑊𝑐 += ∑ ∑ 𝑎𝑠𝑙𝑖𝑐𝑒 × 𝑑𝑍ℎ𝑤 (2)
ℎ=0 𝑤=0

Where 𝑎𝑠𝑙𝑖𝑐𝑒 corresponds to the slice which was used to generate the activation 𝑍𝑖𝑗 . Hence, this
ends up giving us the gradient for 𝑊 with respect to that slice. Since it is the same 𝑊 , we will
just add up all such gradients to get 𝑑𝑊 .
In code, inside the appropriate for-loops, this formula translates into:
dW[:,:,:,c] += a_slice * dZ[i, h, w, c]
#### 5.1.3 - Computing db:
This is the formula for computing 𝑑𝑏 with respect to the cost for a certain filter 𝑊𝑐 :

𝑑𝑏 = ∑ ∑ 𝑑𝑍ℎ𝑤 (3)
ℎ 𝑤

As you have previously seen in basic neural networks, db is computed by summing 𝑑𝑍. In this
case, you are just summing over all the gradients of the conv output (Z) with respect to the cost.
In code, inside the appropriate for-loops, this formula translates into:
db[:,:,:,c] += dZ[i, h, w, c]
### Exercise 5 - conv_backward
Implement the conv_backward function below. You should sum over all the training examples,
filters, heights, and widths. You should then compute the derivatives using formulas 1, 2 and 3
above.
[19]: def conv_backward(dZ, cache):
"""
Implement the backward propagation for a convolution function

Arguments:
dZ -- gradient of the cost with respect to the output of the conv layer␣
↪(Z), numpy array of shape (m, n_H, n_W, n_C)

cache -- cache of values needed for the conv_backward(), output of␣

↪conv_forward()

Returns:
dA_prev -- gradient of the cost with respect to the input of the conv layer␣
↪(A_prev),

numpy array of shape (m, n_H_prev, n_W_prev, n_C_prev)

dW -- gradient of the cost with respect to the weights of the conv layer (W)
numpy array of shape (f, f, n_C_prev, n_C)
db -- gradient of the cost with respect to the biases of the conv layer (b)

19
 numpy array of shape (1, 1, 1, n_C)
"""

# Retrieve information from "cache"

# (A_prev, W, b, hparameters) = None
# Retrieve dimensions from A_prev's shape
# (m, n_H_prev, n_W_prev, n_C_prev) = None
# Retrieve dimensions from W's shape
# (f, f, n_C_prev, n_C) = None

# Retrieve information from "hparameters"

# stride = None
# pad = None

# Retrieve dimensions from dZ's shape

# (m, n_H, n_W, n_C) = None

# Initialize dA_prev, dW, db with the correct shapes

# dA_prev = None
# dW = None
# db = None

# Pad A_prev and dA_prev

# A_prev_pad = zero_pad(A_prev, pad)
# dA_prev_pad = zero_pad(dA_prev, pad)

#for i in range(m): # loop over the training examples

# select ith training example from A_prev_pad and dA_prev_pad

# a_prev_pad = None
# da_prev_pad = None

#for h in range(n_H): # loop over vertical axis of␣

↪the output volume

# for w in range(n_W): # loop over horizontal axis of␣

↪the output volume

# for c in range(n_C): # loop over the channels of the␣

↪output volume

# Find the corners of the current "slice"

# vert_start = None
# vert_end = None
# horiz_start = None
# horiz_end = None

# Use the corners to define the slice from a_prev_pad

20
 # a_slice = None

# Update gradients for the window and the filter's␣

↪parameters using the code formulas given above

# da_prev_pad[vert_start:vert_end, horiz_start:horiz_end, :
↪] += None

# dW[:,:,:,c] += None
# db[:,:,:,c] += None

# Set the ith training example's dA_prev to the unpadded da_prev_pad␣

↪(Hint: use X[pad:-pad, pad:-pad, :])
# dA_prev[i, :, :, :] = None
# YOUR CODE STARTS HERE
(A_prev, W, b, hparameters) = cache
# Retrieve dimensions from A_prev's shape
(m, n_H_prev, n_W_prev, n_C_prev) = A_prev.shape
# Retrieve dimensions from W's shape
(f, f, n_C_prev, n_C) = W.shape
# Retrieve information from "hparameters"
stride = hparameters['stride']
pad = hparameters['pad']
# Retrieve dimensions from dZ's shape
(m, n_H, n_W, n_C) = dZ.shape

# Initialize dA_prev, dW, db with the correct shapes

dA_prev = np.zeros_like(A_prev)
dW = np.zeros_like(W)
db = np.zeros_like(b)

# Pad A_prev and dA_prev

A_prev_pad = zero_pad(A_prev, pad)
dA_prev_pad = zero_pad(dA_prev, pad)

for i in range(m): # loop over the training examples

# select ith training example from A_prev_pad and dA_prev_pad
a_prev_pad = A_prev_pad[i]
da_prev_pad = dA_prev_pad[i]

for h in range(n_H): # loop over vertical axis of the␣

↪output volume
for w in range(n_W): # loop over horizontal axis of␣
↪the output volume

for c in range(n_C): # loop over the channels of the␣

↪output volume

# Find the corners of the current "slice"

21
 vert_start = h * stride
vert_end = vert_start + f
horiz_start = w * stride
horiz_end = horiz_start + f

# Use the corners to define the slice from a_prev_pad

a_slice = a_prev_pad[vert_start:vert_end, horiz_start:
↪horiz_end, :]

# Update gradients for the window and the filter's␣

↪parameters using the code formulas given above

da_prev_pad[vert_start:vert_end, horiz_start:horiz_end, :]␣

↪+= W[:, :, :, c] * dZ[i, h, w, c]

dW[:, :, :, c] += a_slice * dZ[i, h, w, c]

db[:, :, :, c] += dZ[i, h, w, c]

# Set the ith training example's dA_prev to the unpadded da_prev_pad␣

↪(Hint: use X[pad:-pad, pad:-pad, :])
dA_prev[i, :, :, :] = da_prev_pad[pad:-pad, pad:-pad, :]

# Making sure your output shape is correct

# YOUR CODE ENDS HERE

# Making sure your output shape is correct

assert(dA_prev.shape == (m, n_H_prev, n_W_prev, n_C_prev))

return dA_prev, dW, db

[20]: # We'll run conv_forward to initialize the 'Z' and 'cache_conv",

# which we'll use to test the conv_backward function
np.random.seed(1)
A_prev = np.random.randn(10, 4, 4, 3)
W = np.random.randn(2, 2, 3, 8)
b = np.random.randn(1, 1, 1, 8)
hparameters = {"pad" : 2,
"stride": 2}
Z, cache_conv = conv_forward(A_prev, W, b, hparameters)

# Test conv_backward
dA, dW, db = conv_backward(Z, cache_conv)

print("dA_mean =", np.mean(dA))

print("dW_mean =", np.mean(dW))
print("db_mean =", np.mean(db))

assert type(dA) == np.ndarray, "Output must be a np.ndarray"

assert type(dW) == np.ndarray, "Output must be a np.ndarray"

22
assert type(db) == np.ndarray, "Output must be a np.ndarray"
assert dA.shape == (10, 4, 4, 3), f"Wrong shape for dA {dA.shape} != (10, 4,␣
↪4, 3)"

assert dW.shape == (2, 2, 3, 8), f"Wrong shape for dW {dW.shape} != (2, 2, 3,␣
↪8)"

assert db.shape == (1, 1, 1, 8), f"Wrong shape for db {db.shape} != (1, 1, 1,␣
↪8)"

assert np.isclose(np.mean(dA), 1.4524377), "Wrong values for dA"

assert np.isclose(np.mean(dW), 1.7269914), "Wrong values for dW"
assert np.isclose(np.mean(db), 7.8392325), "Wrong values for db"

print("\033[92m All tests passed.")

dA_mean = 1.4524377775388075
dW_mean = 1.7269914583139097
db_mean = 7.839232564616838
All tests passed.
Expected Output:
dA_mean
1.45243777754
dW_mean
1.72699145831
db_mean
7.83923256462
## 5.2 Pooling Layer - Backward Pass
Next, let’s implement the backward pass for the pooling layer, starting with the MAX-POOL
layer. Even though a pooling layer has no parameters for backprop to update, you still need to
backpropagate the gradient through the pooling layer in order to compute gradients for layers that
came before the pooling layer.
### 5.2.1 Max Pooling - Backward Pass
Before jumping into the backpropagation of the pooling layer, you are going to build a helper
function called create_mask_from_window() which does the following:

1 3 0 0
𝑋=[ ] → 𝑀 =[ ] (4)
4 2 1 0

As you can see, this function creates a “mask” matrix which keeps track of where the maximum of
the matrix is. True (1) indicates the position of the maximum in X, the other entries are False (0).
You’ll see later that the backward pass for average pooling is similar to this, but uses a different
mask.
### Exercise 6 - create_mask_from_window

23
 Implement create_mask_from_window(). This function will be helpful for pooling backward.
Hints: - np.max() may be helpful. It computes the maximum of an array. - If you have a matrix
X and a scalar x: A = (X == x) will return a matrix A of the same size as X such that:
A[i,j] = True if X[i,j] = x
A[i,j] = False if X[i,j] != x
• Here, you don’t need to consider cases where there are several maxima in a matrix.
[21]: def create_mask_from_window(x):
"""
Creates a mask from an input matrix x, to identify the max entry of x.

Arguments:
x -- Array of shape (f, f)

Returns:
mask -- Array of the same shape as window, contains a True at the position␣
↪corresponding to the max entry of x.

"""
# (�1 line)
# mask = None
# YOUR CODE STARTS HERE
mask = (x == np.max(x))

# YOUR CODE ENDS HERE

return mask

[22]: np.random.seed(1)
x = np.random.randn(2, 3)
mask = create_mask_from_window(x)
print('x = ', x)
print("mask = ", mask)

x = np.array([[-1, 2, 3],
[2, -3, 2],
[1, 5, -2]])

y = np.array([[False, False, False],

[False, False, False],
[False, True, False]])
mask = create_mask_from_window(x)

assert type(mask) == np.ndarray, "Output must be a np.ndarray"

assert mask.shape == x.shape, "Input and output shapes must match"
assert np.allclose(mask, y), "Wrong output. The True value must be at position␣
↪(2, 1)"

24
 print("\033[92m All tests passed.")

x = [[ 1.62434536 -0.61175641 -0.52817175]

[-1.07296862 0.86540763 -2.3015387 ]]
mask = [[ True False False]
[False False False]]
All tests passed.
Expected Output:
x=
[[ 1.62434536 -0.61175641 -0.52817175] [-1.07296862 0.86540763 -2.3015387 ]]
mask =
[[ True False False] [False False False]]
Why keep track of the position of the max? It’s because this is the input value that ultimately
influenced the output, and therefore the cost. Backprop is computing gradients with respect to the
cost, so anything that influences the ultimate cost should have a non-zero gradient. So, backprop
will “propagate” the gradient back to this particular input value that had influenced the cost.
### 5.2.2 - Average Pooling - Backward Pass
In max pooling, for each input window, all the “influence” on the output came from a single input
value–the max. In average pooling, every element of the input window has equal influence on the
output. So to implement backprop, you will now implement a helper function that reflects this.
For example if we did average pooling in the forward pass using a 2x2 filter, then the mask you’ll
use for the backward pass will look like:

1/4 1/4
𝑑𝑍 = 1 → 𝑑𝑍 = [ ] (5)
1/4 1/4

This implies that each position in the 𝑑𝑍 matrix contributes equally to output because in the
forward pass, we took an average.
### Exercise 7 - distribute_value
Implement the function below to equally distribute a value dz through a matrix of dimension shape.
Hint
[23]: def distribute_value(dz, shape):
"""
Distributes the input value in the matrix of dimension shape

Arguments:
dz -- input scalar
shape -- the shape (n_H, n_W) of the output matrix for which we want to␣
↪distribute the value of dz

25
 Returns:
a -- Array of size (n_H, n_W) for which we distributed the value of dz
"""
# Retrieve dimensions from shape (�1 line)
# (n_H, n_W) = None

# Compute the value to distribute on the matrix (�1 line)

# average = None

# Create a matrix where every entry is the "average" value (�1 line)
# a = None
# YOUR CODE STARTS HERE
(n_H, n_W) = shape

# Compute the value to distribute on the matrix (�1 line)

average = dz / (n_H * n_W)

# Create a matrix where every entry is the "average" value (�1 line)
a = np.ones(shape) * average

# YOUR CODE ENDS HERE

return a

[24]: a = distribute_value(2, (2, 2))

print('distributed value =', a)

assert type(a) == np.ndarray, "Output must be a np.ndarray"

assert a.shape == (2, 2), f"Wrong shape {a.shape} != (2, 2)"
assert np.sum(a) == 2, "Values must sum to 2"

a = distribute_value(100, (10, 10))

assert type(a) == np.ndarray, "Output must be a np.ndarray"
assert a.shape == (10, 10), f"Wrong shape {a.shape} != (10, 10)"
assert np.sum(a) == 100, "Values must sum to 100"

print("\033[92m All tests passed.")

distributed value = [[0.5 0.5]

[0.5 0.5]]
All tests passed.
Expected Output:
distributed_value =
[[ 0.5 0.5] <br> [ 0.5 0.5]]
### 5.2.3 Putting it Together: Pooling Backward

26
 You now have everything you need to compute backward propagation on a pooling layer.
### Exercise 8 - pool_backward
Implement the pool_backward function in both modes ("max" and "average"). You will once
again use 4 for-loops (iterating over training examples, height, width, and channels). You should
use an if/elif statement to see if the mode is equal to 'max' or 'average'. If it is equal to
‘average’ you should use the distribute_value() function you implemented above to create a
matrix of the same shape as a_slice. Otherwise, the mode is equal to ‘max’, and you will create
a mask with create_mask_from_window() and multiply it by the corresponding value of dA.
[25]: def pool_backward(dA, cache, mode = "max"):
"""
Implements the backward pass of the pooling layer

Arguments:
dA -- gradient of cost with respect to the output of the pooling layer,␣
↪same shape as A

cache -- cache output from the forward pass of the pooling layer, contains␣
↪the layer's input and hparameters

mode -- the pooling mode you would like to use, defined as a string ("max"␣
↪or "average")

Returns:
dA_prev -- gradient of cost with respect to the input of the pooling layer,␣
↪same shape as A_prev

"""
# Retrieve information from cache (�1 line)
# (A_prev, hparameters) = None

# Retrieve hyperparameters from "hparameters" (�2 lines)

# stride = None
# f = None

# Retrieve dimensions from A_prev's shape and dA's shape (�2 lines)
# m, n_H_prev, n_W_prev, n_C_prev = None
# m, n_H, n_W, n_C = None

# Initialize dA_prev with zeros (�1 line)

# dA_prev = None

# for i in range(None): # loop over the training examples

# select training example from A_prev (�1 line)

# a_prev = None

# for h in range(n_H): # loop on the vertical axis

# for w in range(n_W): # loop on the horizontal axis

27
 # for c in range(n_C): # loop over the channels␣
↪(depth)

# Find the corners of the current "slice" (�4 lines)

# vert_start = None
# vert_end = None
# horiz_start = None
# horiz_end = None

# Compute the backward propagation in both modes.

# if mode == "max":

# Use the corners and "c" to define the current slice␣

↪from a_prev (�1 line)
# a_prev_slice = None

# Create the mask from a_prev_slice (�1 line)

# mask = None

# Set dA_prev to be dA_prev + (the mask multiplied by␣

↪the correct entry of dA) (�1 line)

# dA_prev[i, vert_start: vert_end, horiz_start:␣

↪horiz_end, c] += None

# elif mode == "average":

# Get the value da from dA (�1 line)

# da = None

# Define the shape of the filter as fxf (�1 line)

# shape = None

# Distribute it to get the correct slice of dA_prev. i.

↪e. Add the distributed value of da. (�1 line)
# dA_prev[i, vert_start: vert_end, horiz_start:␣
↪horiz_end, c] += None

# YOUR CODE STARTS HERE

(A_prev, hparameters) = cache

# Retrieve hyperparameters from "hparameters" (�2 lines)

stride = hparameters['stride']
f = hparameters['f']

# Retrieve dimensions from A_prev's shape and dA's shape (�2 lines)
m, n_H_prev, n_W_prev, n_C_prev = A_prev.shape
m, n_H, n_W, n_C = dA.shape

28
 # Initialize dA_prev with zeros (�1 line)
dA_prev = np.zeros_like(A_prev)

for i in range(m): # loop over the training examples

# select training example from A_prev (�1 line)
a_prev = A_prev[i]

for h in range(n_H): # loop on the vertical axis

for w in range(n_W): # loop on the horizontal axis
for c in range(n_C): # loop over the channels (depth)

# Find the corners of the current "slice" (�4 lines)

vert_start = h * stride
vert_end = vert_start + f
horiz_start = w * stride
horiz_end = horiz_start + f

# Compute the backward propagation in both modes.

if mode == "max":

# Use the corners and "c" to define the current slice␣

↪from a_prev (�1 line)
a_prev_slice = a_prev[vert_start: vert_end, horiz_start:
↪ horiz_end, c]

# Create the mask from a_prev_slice (�1 line)

mask = create_mask_from_window(a_prev_slice)

# Set dA_prev to be dA_prev + (the mask multiplied by␣

↪the correct entry of dA) (�1 line)

dA_prev[i, vert_start: vert_end, horiz_start:␣

↪horiz_end, c] += mask * dA[i, h, w, c]

elif mode == "average":

# Get the value da from dA (�1 line)

da = dA[i, h, w, c]

# Define the shape of the filter as fxf (�1 line)

shape = (f, f)

# Distribute it to get the correct slice of dA_prev. i.

↪e. Add the distributed value of da. (�1 line)
dA_prev[i, vert_start: vert_end, horiz_start:␣
↪horiz_end, c] += distribute_value(da, shape)

29
 # YOUR CODE ENDS HERE

# Making sure your output shape is correct

assert(dA_prev.shape == A_prev.shape)

return dA_prev

[26]: np.random.seed(1)
A_prev = np.random.randn(5, 5, 3, 2)
hparameters = {"stride" : 1, "f": 2}
A, cache = pool_forward(A_prev, hparameters)
print(A.shape)
print(cache[0].shape)
dA = np.random.randn(5, 4, 2, 2)

dA_prev1 = pool_backward(dA, cache, mode = "max")

print("mode = max")
print('mean of dA = ', np.mean(dA))
print('dA_prev1[1,1] = ', dA_prev1[1, 1])
print()
dA_prev2 = pool_backward(dA, cache, mode = "average")
print("mode = average")
print('mean of dA = ', np.mean(dA))
print('dA_prev2[1,1] = ', dA_prev2[1, 1])

assert type(dA_prev1) == np.ndarray, "Wrong type"

assert dA_prev1.shape == (5, 5, 3, 2), f"Wrong shape {dA_prev1.shape} != (5, 5,␣
↪3, 2)"

assert np.allclose(dA_prev1[1, 1], [[0, 0],

[ 5.05844394, -1.68282702],
[ 0, 0]]), "Wrong values for mode max"
assert np.allclose(dA_prev2[1, 1], [[0.08485462, 0.2787552],
[1.26461098, -0.25749373],
[1.17975636, -0.53624893]]), "Wrong values␣
↪for mode average"

print("\033[92m All tests passed.")

(5, 4, 2, 2)
(5, 5, 3, 2)
mode = max
mean of dA = 0.14571390272918056
dA_prev1[1,1] = [[ 0. 0. ]
[ 5.05844394 -1.68282702]
[ 0. 0. ]]

30
mode = average
mean of dA = 0.14571390272918056
dA_prev2[1,1] = [[ 0.08485462 0.2787552 ]
[ 1.26461098 -0.25749373]
[ 1.17975636 -0.53624893]]
All tests passed.
Expected Output:
mode = max:
mean of dA =
0.145713902729
dA_prev[1,1] =
[[ 0. 0. ] [ 5.05844394 -1.68282702] [ 0. 0. ]]
mode = average
mean of dA =
0.145713902729
dA_prev[1,1] =
[[ 0.08485462 0.2787552 ] [ 1.26461098 -0.25749373] [ 1.17975636 -0.53624893]]
Congratulations! You’ve completed the assignment and its optional portion. You now understand
how convolutional neural networks work, and have implemented all the building blocks of a neural
network. In the next assignment you will implement a ConvNet using TensorFlow. Nicely done!
See you there.

31