Convolutional Neural Networks
- M. Soleymani
Sharif University of Technology Fall 2017 Slides have been adopted from Fei Fei Li and colleagues lectures and notes, cs231n, Stanford 2017.
Convolutional Neural Networks M. Soleymani Sharif University of - - PowerPoint PPT Presentation
Convolutional Neural Networks M. Soleymani Sharif University of Technology Fall 2017 Slides have been adopted from Fei Fei Li and colleagues lectures and notes, cs231n, Stanford 2017. Fully connected layer Fully connected layers Neurons
Sharif University of Technology Fall 2017 Slides have been adopted from Fei Fei Li and colleagues lectures and notes, cs231n, Stanford 2017.
– parameters would add up quickly! – full connectivity is wasteful and the huge number of parameters would quickly lead to overfitting.
[LeCun, Bottou, Bengio, Haffner 1998]
[Krizhevsky, Sutskever, Hinton, 2012]
– Convolutional Layer
– Pooling Layer
– Fully-Connected Layer
Source: http://iamaaditya.github.io/2016/03/
Gives the responses of that filter at every spatial position
Local connections spatially but full along the entire depth of the input volume.
consider a second, green filter
– depth of the output volume equals to the number of filters
– Each of the 96 filters shown here is of size [11x11x3] – and each one is shared by the 55*55 neurons in one depth slice
Source: http://iamaaditya.github.io/2016/03/
computing a dot product between their weights and a small region they are connected to in the input volume. gives the responses of that filter at every spatial position
filters jump 2 pixels at a time as we slide them around
filters jump 2 pixels at a time as we slide them around
cannot apply 3x3 filter on 7x7 input with stride 3.
Example: N = 7, F = 3: stride 1 => (7 - 3)/1 + 1 = 5 stride 2 => (7 - 3)/2 + 1 = 3 stride 3 => (7 - 3)/3 + 1 = 2.33 :\
input 7x7 Filter 3x3 stride 1 zero pad with 1 pixel border => output= 7x7 Output size: (N+2P - F) / stride + 1
Common in practice: filters FxF stride 1 zero-padding with (F-1)/2 e.g. F = 3 => zero pad with 1 F = 5 => zero pad with 2 F = 7 => zero pad with 3
=> will preserve size
zero padding allows us to control the spatial size
N = 5 F = 3 P = 1 S = 1 Output = (5 - 3 + 2)/1+1 = 5. N = 5 F = 3 P = 1 S = 2 Output = (5 - 3 + 2)/2+1 = 3.
Common settings: K = powers of 2 (e.g., 32, 64, 128, 512,…) F = 3, S = 1, P = 1 F = 5, S = 1, P = 2 F = 5, S = 2, P = ? (whatever fits) F = 1, S = 1, P = 0
An activation map is a 28x28 sheet of neuron outputs:
“5x5 filter” => “5x5 receptive field for each neuron”
There will be 6 different neurons all looking at the same region in the input volume constrain the neurons in each depth slice to use the same weights and bias
set of neurons that are all looking at the same region of the input as a depth column
– each neuron is connected to only a local region of the previous layer outputs.
– The connections are local in space (along width and height)
– if one feature is useful to compute at some spatial position (x,y), then it should also be useful to compute at a different position (x2,y2)
– to reduce the amount of parameters and computation in the network – to control overfitting
Common settings: F = 2, S = 2 F = 3, S = 2
– where N is usually up to ~5 – M is large – 0 <= K <= 2 – but recent advances such as ResNet/GoogLeNet challenge this paradigm
– http://cs231n.github.io/convolutional-networks/