Take the depth from 1 layer to 3, and watch what happens to the boundary, the colour of the โ and the number correct.
| Term | On this screen |
|---|---|
| Fully connected layer | every line drawn from โ to โ |
| Activation function | the bend (ReLU, sigmoid) |
| Layer | the middle layer |
| Forward propagation | the trip out — handing numbers from input to output to produce a prediction |
| Backpropagation | the trip back — sharing the error at the output back towards the input, which gives each knob its own “which way, and how far” |
| Vanishing gradients | โ returning nothing but 0, so the clue for moving the knobs never gets back upstream |
| Skip connection, residual connection | the skip path |
| Divergence (in gradient descent) | the numbers running away |
| Normalization (batch, layer) | putting everything on 0 to 1 (dividing by the top of the range) |
| Learning rate | the step size |
| Multilayer perceptron | a form with one layer or more |
| Simple perceptron | a form with no layer (that is Problem 8) |