# Deep Learning From Scratch - Theory and Implementation

DanielSabinasz
238.5K views

## Multi-layer perceptrons

### Motivation

So now we are able to train linear classifiers of arbitrary dimensionality automatically. However, many real-world classes are not linearly separable. This means that there does not exist any line with all the points of the first class on one side of the line and all the points of the other class on the other side. Let's illustrate this with an example.

Example
Example

As we can see, it is impossible to draw a line that separates the blue points from the red points. Instead, our decision boundary has to have a rather complex shape. This is where multi-layer perceptrons come into play: They allow us to train a decision boundary of a more complex shape than a straight line.

### Computational graph

As their name suggests, multi-layer perceptrons (MLPs) are composed of multiple perceptrons stacked one after the other in a layer-wise fashion. Let's look at a visualization of the computational graph:

As we can see, the input is fed into the first layer, which is a multidimensional perceptron with a weight matrix ${W}_{1}$$W_1$ and bias vector ${b}_{1}$$b_1$. The output of that layer is then fed into second layer, which is again a perceptron with another weight matrix ${W}_{2}$$W_2$ and bias vector ${b}_{2}$$b_2$. This process continues for every of the $L$$L$ layers until we reach the output layer. We refer to the last layer as the output layer and to every other layer as a hidden layer.

an MLP with one hidden layers computes the function

$\sigma \left(\sigma \left(X\phantom{\rule{thinmathspace}{0ex}}{W}_{1}+{b}_{1}\right){W}_{2}+{b}_{2}\right)\phantom{\rule{thinmathspace}{0ex}},$$\sigma(\sigma(X \, W_1 + b_1) W_2 + b_2) \,,$

an MLP with two hidden layers computes the function

$\sigma \left(\sigma \left(\sigma \left(X\phantom{\rule{thinmathspace}{0ex}}{W}_{1}+{b}_{1}\right){W}_{2}+{b}_{2}\right)\phantom{\rule{thinmathspace}{0ex}}{W}_{3}\phantom{\rule{thinmathspace}{0ex}},$$\sigma(\sigma(\sigma(X \, W_1 + b_1) W_2 + b_2) \, W_3 \,,$

and, generally, an MLP with $L-1$$L-1$ hidden layers computes the function

$\sigma \left(\sigma \left(\cdots \sigma \left(\sigma \left(X\phantom{\rule{thinmathspace}{0ex}}{W}_{1}+{b}_{1}\right){W}_{2}+{b}_{2}\right)\cdots \right)\phantom{\rule{thinmathspace}{0ex}}{W}_{L}+{b}_{L}\right)\phantom{\rule{thinmathspace}{0ex}}.$$\sigma(\sigma( \cdots \sigma(\sigma(X \, W_1 + b_1) W_2 + b_2) \cdots) \, W_L + b_L) \,.$

### Implementation

Using the library we have built, we can now easily implement multi-layer perceptrons without further work.

Multi-Layer Perceptron

As we can see, we have learned a rather complex decision boundary. If we use more layers, the decision boundary can become arbitrarily complex, allowing us to learn classification patterns that are impossible to spot by a human being, especially in higher dimensions.

## Recap

Congratulations on making it this far! You have learned the foundations of building neural networks from scratch, and in contrast to most machine learning practitioners, you now know how it all works under the hood and why it is done the way it is done.

Let's recap what we have learned. We started out by considering computational graphs in general, and we saw how to build them and how to compute their output. We then moved on to describe perceptrons, which are linear classifiers that assign a probability to each output class by squashing the output of ${w}^{T}x+b$$w^Tx+b$ through a sigmoid (or softmax, in the case of multiple classes). Following that, we saw how to judge how good a classifier is - via a loss function, the cross-entropy loss, the minimization of which is equivalent to maximum likelihood. In the next step, we saw how to minimize the loss via gradient descent: By iteratively stepping into the direction of the negative gradient. We then introduced backpropagation as a means of computing the derivative of the loss with respect to each node by performing a breadth-first search and multiplying according to the chain rule. We used all that we've learned to train a good linear classifier for the red/blue example dataset. Finally, we learned about multi-layer perceptrons as a means of learning non-linear decision boundaries, implemented an MLP with one hidden layer and successfully trained it on a non-linearly-separable dataset.

## Next steps

You now know all the fundamentals for training arbitrary neural networks. As a next step, you should learn about the following topics (Google is your friend):

• The difference between training loss and test loss
• Overfitting and underfitting
• Regularization and early stopping
• Dropout
• Convolutional neural networks
• Recurrent neural networks
• Autoencoders
• Deep Generative Models

All of these topics are dealt with in the book "Deep Learning" by Ian Goodfellow, Yoshua Bengio and Aaron Courville, which I highly recommend everyone to read. A free online version of the book can be found at http://www.deeplearningbook.org/.

Create your playground on Tech.io
This playground was created on Tech.io, our hands-on, knowledge-sharing platform for developers.
Join the CodinGame community on Discord to chat about puzzle contributions, challenges, streams, blog articles - all that good stuff!
Online Participants