Lesson 9 (2019) - How to train your model

00:00:00.000 | Welcome back to lesson 9 part 2, how to train your model.

00:00:08.000 | Before we talk about training our model, though, I wanted to revisit a couple of things that came up last week.

00:00:15.000 | And the reason I really wanted to revisit them is because

00:00:22.000 | I wanted to kind of give you an insight into how I do research.

00:00:25.000 | I mean, a lot of this course really will be me showing you how I do research and how I do software development in the hope that that is somewhat helpful to you.

00:00:33.000 | So one of the questions that came up last week was we looked at.

00:00:42.000 | That's the size of that. Okay, we looked at. We looked inside the NN dot com 2D that comes with PyTorch to see how it goes about initializing parameters.

00:00:56.000 | And we found that inside here, convn d dot reset parameters, we found the way that it does initialization.

00:01:03.000 | And we found this math dot square root 5 without any commentary, which was quite mysterious.

00:01:11.000 | So I decided to do some research into, you know, kind of dual research.

00:01:17.000 | One is like, what's the impact of this math dot square root 5?

00:01:21.000 | And then at the same time, trying to get in touch with the PyTorch team about asking them where this math dot square root 5 comes from.

00:01:28.000 | So let me show you how I went about doing that research.

00:01:32.000 | So I loaded up just what we had from last week, which was the ability to download the MNIST data and open it up.

00:01:53.000 | And then the function to normalize it, which I thought we'd export if we haven't already.

00:02:01.000 | And then we'd grab the data and would normalize it.

00:02:04.000 | And because we're going to be talking a lot about convolutions towards the end of today's lesson and particularly next lesson, I suspect.

00:02:13.000 | So I'll skip over some of the details about convolutions for now.

00:02:16.000 | But basically to do a convolution, as you know, we need a square or rectangular input.

00:02:22.000 | And our MNIST input, remember, was just a single vector per image 768 long.

00:02:27.000 | So I resized them all to 28 by 28 one channel images.

00:02:33.000 | So that we could test out the impact of this conv2d in it in PyTorch and set up the various variables that we wanted to have.

00:02:43.000 | And then I created a conv2d layer.

00:02:46.000 | So we have one input because it's just one channel.

00:02:48.000 | NH, which is number hidden, which is 32 outputs. And let's do a five by five kernel. And we're talking more about why five by five might be suitable.

00:02:57.000 | And just for testing, let's just grab the first hundred elements of the validation set.

00:03:02.000 | So we've now got a tensor of one hundred by one by twenty eight by twenty eight.

00:03:07.000 | So it's a really good idea when you're playing with anything in software development, but including notebooks to refactor things.

00:03:18.000 | So I'm going to be wanting to look at the main and standard deviation of a bunch of things.

00:03:22.000 | So let's create a little function called stats to do that.

00:03:26.000 | And I never plan ahead what I'm going to do when you see this in a notebook.

00:03:29.000 | It always means that I've written out that by hand and then I copied it and then I'm like, OK, I'm using it twice.

00:03:35.000 | I'll chuck it in a function. So then I go back and create the function.

00:03:38.000 | So here I've got the mean and standard deviation of my L1, which is a conv2d layer.

00:03:46.000 | And so a conv2d layer contains a weight tensor parameter and a bias tensor parameter.

00:03:53.000 | So just to remind you, L1.weight.shape is 32 output filters because that's what number hidden was.

00:04:06.000 | One input filter because we only have one channel and then five by five.

00:04:10.000 | OK, so that's the size of our tensor.

00:04:13.000 | And if you've forgotten why that's the size of a tensor, you can go back to the Excel directory, for example,

00:04:22.000 | from part one where you can find the conv example spreadsheet.

00:04:30.000 | And in the conv example spreadsheet, you can see what each of those parameters does.

00:04:38.000 | So we basically had a filter for each input channel and for each output channel.

00:04:47.000 | So that's kind of what it looked like.

00:04:49.000 | And so the next layer, we now have a four dimensional tensor, a rank four tensor that we've got the three by three.

00:05:02.000 | We've got it for each input and for each output.

00:05:08.000 | OK, so that's the 32 by one by five by five.

00:05:14.000 | So the main and standard deviation of the weights zero and point one one.

00:05:22.000 | And this is because we know that behind the scenes, it's called this function to initialize.

00:05:32.000 | So the bias is initialized with a uniform random number between negative of this and positive of this and then the weights are initialized with timing uniform with this odd math dot square root five thing.

00:05:50.000 | So that's fine. That's not particularly interesting.

00:05:52.000 | What's more interesting is to take our input tensor of M NIST numbers and put it through this layer, which we called L1, which remember is a conv2D layer.

00:06:03.000 | So layer one and let's create an output T and let's look at the stats of T.

00:06:09.000 | So this is the stats of the output of this layer.

00:06:12.000 | We would like it to be a mean of zero and a standard deviation or a variance of one.

00:06:18.000 | The mean of zero is there, but the deviation of one is not there.

00:06:24.000 | So that looks like a problem.

00:06:27.000 | Let's compare this to the normal timing in it.

00:06:31.000 | So the normal timing in it, remember, is designed to be used after a value layer or more generally a leaky value layer.

00:06:45.000 | And recall that a leaky value layer has the y equals x here and here the gradient of this is called a or leak or whatever.

00:07:05.000 | And now in our case, we're just looking at a conv layer, so we don't have anything kind of going on there.

00:07:13.000 | In fact, it's straight here as well.

00:07:16.000 | So effectively we have like a leak, if you like, of one or an A of one.

00:07:21.000 | So to use climbing in it with no value, we can just put a equals one.

00:07:26.000 | And if we do that, then we get a mean of zero and a variance of one.

00:07:31.000 | So climbing in it seems to be working nicely.

00:07:37.000 | OK, so let's now try it with value. So let's now define a function, which is the function for layer one,

00:07:45.000 | which is to pass it through our layer one conv and then do a value with some A, some leak amount,

00:07:52.000 | which we'll set to zero by default. So this will be just a regular value.

00:07:58.000 | And you can see that.

00:08:01.000 | If we now run that.

00:08:05.000 | If we now run that with climbing initialization, we get a variance of one,

00:08:10.000 | which is good and the main is no longer zero as we discussed last week.

00:08:14.000 | It's about a half.

00:08:17.000 | But if we go back and reinitialize the com2d with this default PyTorch,

00:08:23.000 | this is not looking good at all with relu. It's even worse because remember.

00:08:28.000 | They don't have anything kind of handling that relu case in the default con.

00:08:34.000 | So this looks like a problem, so a variance of point three five.

00:08:38.000 | It may not sound a lot lower than one, but let's look. Take a look at what that means.

00:08:45.000 | So I forgot to mention where we are. This is the zero to a.

00:08:50.000 | Why square root five notebook so zero to a notebook.

00:08:56.000 | So in order to explore this, I decided that I would try and write my own.

00:09:01.000 | Timing in it.

00:09:04.000 | Function and so normally with the timing in it function.

00:09:09.000 | If we were working with just a regular fully connected matrix multiplication.

00:09:17.000 | We would basically be saying.

00:09:22.000 | How many output filters are there so what's the if this is the weight matrix then what's the what's the width of the weight matrix for a convolutional layer.

00:09:30.000 | It's a little bit different is a little bit different right because what we actually want to know is each time like in this case.

00:09:40.000 | We're basically multiplying all these together with some sort of inputs and then adding them all up right that's basically what a single step of a matrix multiplication is.

00:09:50.000 | In a convolution we're also multiplying a bunch of things together and adding them up, but what we're actually adding together is if it was three by three.

00:09:59.000 | Is we're multiplying together each of the three by three elements.

00:10:03.000 | Right and also.

00:10:05.000 | The channel dimension that we actually multiply all of those together and add them all up so.

00:10:12.000 | Because convolution and matrix multiplication are kind of one in the same thing as we know with some weight tying and with some with some zeros.

00:10:21.000 | So in order to calculate the total number of modifications and additions going on for a convolutional layer we need to basically take the kernel size which in this case is.

00:10:36.000 | 5 by 5.

00:10:39.000 | And multiply it by.

00:10:41.000 | The number of filters.

00:10:43.000 | Okay, so the general way to get that 5 by 5 piece is we can just grab any one piece of this weight tensor and that will return a 5 by 5.

00:10:53.000 | Kernel and then say how many elements are in that part of the weight tensor and that's going to be the receptive field size.

00:11:01.000 | So the receptive field size for just the immediate layer before is how many.

00:11:09.000 | How many elements are in that kernel so for this it's 25 it's 5 by 5 right and so if we then say okay let's grab the.

00:11:18.000 | Shape of the weight matrix and it gives us the number of filters out 32.

00:11:23.000 | And then the number of filters in one and then I'll skip the rest because they're the only two things I want.

00:11:29.000 | So now for the timing her in it.

00:11:32.000 | We can calculate fan in is the number of input filters times receptive field size so that's 1 times 25 fan out is 32 by 25.

00:11:45.000 | So there you can see this is how we calculate the effective fan in and fan out for a convolutional layer so we can do all that by hand.

00:11:58.000 | And then the timing in it formula you need to then for leaky value you need to multiply.

00:12:08.000 | By root 2 or if there's a leaky part in it so if the A is not equal to 0 then it is actually root 2 divided by 1 plus a squared.

00:12:21.000 | So that's just the formula for the timing in it and that's often called the gain.

00:12:27.000 | For the in it.

00:12:30.000 | And so there's a formula for the gain so you can see that if the gain is 1.

00:12:36.000 | Right then that's just linear there's no nonlinearity at all so there's no change to the calculation of how you do the initialization.

00:12:46.000 | On the other hand if it's a standard value then you've got the root 2 which we saw last week from the from the timing paper.

00:12:55.000 | With a gain of .01 it's about root 2 as well is pretty close and this is a kind of a common leaky value amount.

00:13:01.000 | But what about in the case of the pie torch in it in the case of the pie torch in it it's root 5.

00:13:08.000 | Which is .577 which sounds like an odd.

00:13:12.000 | Number it's a long way away from what we were expecting to see so that's a bit concerning.

00:13:23.000 | But one thing we have to account for here is that the initialization that they use for pie torch.

00:13:34.000 | Is not climbing normal it's climbing uniform right and so normally distributed random numbers.

00:13:50.000 | Look like that but uniform random numbers.

00:13:58.000 | Look like that right and so the uniform random numbers they were using as their kind of starting point were between.

00:14:08.000 | Minus one and one.

00:14:11.000 | The standard deviation of that obviously is not one right the standard deviation is obviously less than one and so you can Google for the standard deviation of a uniform distribution or you could jump into Excel or Python and just grab a bunch of random numbers and find out what the standard deviation is.

00:14:31.000 | And you'll find that you can I've got it here actually I've grabbed ten thousand random numbers in that uniform distribution and asked for this standard deviation and it turns out that it's one over root three.

00:14:47.000 | Okay so part of the reason for this difference actually. Is that they need a gain to handle uniform random numbers rather than just normal random numbers but it still doesn't.

00:15:04.000 | Quite account for the difference so let's take a look so here's here's my version of climbing in which I've just grabbed all of the previous lines of code and merge them together.

00:15:15.000 | And then I've just added this thing to multiply it by root three because of the uniform random number and so then if I run this timing to.

00:15:27.000 | On my weights and get the stats of that nice again get a variance of about one.

00:15:35.000 | And again confirming that if I.

00:15:40.000 | Well this is interesting if I do it with a equals math dot square root five I would expect to get the same result as the pie torch default which I do it's about point four which is what we found back here point three five so it seems like we've successfully.

00:15:57.000 | You know re implemented what they had.

00:16:00.000 | So at this point I was like okay well what is this what does this do what does this mean so to see kind of what this looks like I threw together a quick confident.

00:16:12.000 | And I grabbed the first hundred dependent variables and so then I took my input and I ran it through the whole confident to get the stats out of the results so this is now telling me what happens when I use the default pie torch in it.

00:16:27.000 | And put it through a four layer confident and the answer is I end up with a variance of point oh oh six.

00:16:36.000 | And that sounds likely to be a really big problem right because there's there's so little variation going on that last layer and also there's a huge difference between the first layer and the last layer that's the really big issue the first layer had a standard deviation of point four and the last layer had a standard.

00:16:53.000 | Well the input layers is one that's the first hidden layer is point four and the last layer is point oh six so these are all going at like totally different rates.

00:17:04.000 | And then what we could do is we could grab that prediction and put it through mean squared error this is the function we created last week run backward and get the stats on the gradients.

00:17:17.000 | For the first layer weights so this is now going all the way forward and all the way back again.

00:17:21.000 | And again standard deviation is nowhere near one so that sounds like a big problem.

00:17:30.000 | So let's try using climbing uniform instead and if you look at the climbing uniform source code you'll see that it's got this it's got the steps that we saw gain over root of the fan and here is the square root of three because it's uniform okay and so we can confirm.

00:17:50.000 | Let's go through and go through every layer and if it's a convolutional layer then let's call climbing uniform on the weights and set the biases to zero.

00:18:01.000 | So we'll initialize it ourselves.

00:18:07.000 | And then we'll grab T.

00:18:11.000 | And it's not one but it's a lot better than point oh eight so this is pretty encouraging that we can get through four layers we wouldn't want to probably have.

00:18:23.000 | A forty layer neural network which is losing this much variance but it should be fine plenty good enough for a four layer network and then let's also confirm on the backward and the backward the first layers gradient is point five.

00:18:37.000 | So that was my kind of starting point for the research here and at the end of this I kind of thought this is.

00:18:46.000 | You know pretty concerning and why did I think it was concerning.

00:18:52.000 | We'll be saying a lot more about why it's concerning but let's quickly look at to be initializing.

00:18:58.000 | So I put this together today and he called this why you need a good in it and he's just he's pointed out here that if you grab.

00:19:07.000 | To grab a random vector X and a random matrix a which is random normally distributed mean zero and standard deviation of one.

00:19:21.000 | Then a hundred times you basically go X is a times X and then you go so you're basically multiplying again and again and again after a hundred iterations your standard deviation and mean are not a number.

00:19:39.000 | So basically the issue is that when you multiply by a matrix lots and lots of times you explode out to the point that your computer can't even keep track.

00:19:49.000 | So what silver did next was he actually.

00:19:52.000 | Put something in a loop to check whether it's not a number and he found it was twenty twenty twenty eight iterations before it before it died.

00:20:04.000 | So it didn't take very long to.

00:20:09.000 | To explode now in the other hand what if we take the random numbers for the standard deviation of point or one instead of one.

00:20:17.000 | And we do that a hundred times.

00:20:20.000 | Then it disappears to zero.

00:20:22.000 | So you can see like you know if you've got a hundred layer neural net because that's what it's doing it's doing a hundred matrix multipliers on itself on the on the output of each previous one you've got to be super careful.

00:20:33.000 | To find some set of weights that because because if this is your starting set of weights if it's point or one or if it's one standard deviation.

00:20:44.000 | You can't ever learn anything because there are no gradients the gradients are either zero or man right so you actually have to have a reasonable starting point and this is really why.

00:20:55.000 | For decades people weren't able to train deep neural networks because people hadn't figured out how to initialize them.

00:21:06.000 | So instead we have to use some.

00:21:10.000 | In it okay and we'll talk about that in a moment for those who are interested Silvan's thing gone on to describe why it is that you have to divide by the square root of the fan.

00:21:21.000 | And so feel free to keep reading that if you're interested it's it's cool but we don't need to know it for now it's just some derivation and further discussion.

00:21:32.000 | So in parallel I also asked the pipe torch team about this and I sent these results to them.

00:21:38.000 | And I said what's going on and so sumeth finally appeared and he said it was a historical accident because 15 years ago or for 15 years before Python appeared there was a product called torch a neural network product in lower and they did it that way.

00:21:57.000 | And so then on Google Plus in 2014 he started talking to someone a dealer man who's now a deep mind and about at this time maybe a bit before he was our intern actually and.

00:22:10.000 | Sonda said this is. At analytic. And Sonda said this this route five thing looks weird and sumeth said no no go look at the paper and Sonda said no that's not what the paper said and sumeth said oh it's a bug but it's a good bug because somebody at somebody went and checked it out and they thought that they were getting better results with this thing.

00:22:34.000 | So so then I talked to sumeth and he was already aware of this issue to some extent and within a couple of hours.

00:22:47.000 | I torch team had created an issue saying they're going to update their their edits so this is super cool like it so this is like partly to say well this is an awesome team super responsive and this is why pie torch works so well is that they see issues and they fix them but it's also to say like.

00:23:09.000 | When you see something in a library don't assume it's it's right or that it makes sense you know when it comes to deep learning none of us know what we're doing and you can see it doesn't take too much to kind of.

00:23:21.000 | Begin to something you know and then you can you know raise an issue and say his his analysis that I did there's a fantastic extension called just it just it for Jupiter notebooks that lets you take your little research notebook press a single button and it turns it into a shareable just that you can then put a link to say here's the analysis that I did.

00:23:45.000 | And so yeah that's that's a little bit of.

00:23:49.000 | A little bit of research idea to answering this question from last week.

00:23:54.000 | There are lots of interesting initialization approaches you can use we've already talked about the lower and Ben Jio paper we've already talked about the timing her paper.

00:24:05.000 | There's an interesting paper called all you need is a good in it which describes how you can kind of iteratively go through your network and set one layer of weights at a time to like literally like kind of do a little optimized to find out which set of parameters gets you a unit variance at every point.

00:24:24.000 | There's another cool paper which talks about something called orthogonal initialization if you've done some many algebra particularly if you've done Rachel's computational linear algebra course you'll know about the idea of orthogonal matrices and they make good in its.

00:24:40.000 | We talked briefly last week about fix up initialization and then there's also something called self normalizing neural networks.

00:24:48.000 | Fix up and self normalizing neural networks are both interesting papers because they describe how to try to set.

00:24:55.000 | A combination of kind of activation functions and in it such that you are guaranteed a unit variance as deep as you like and both of those 2 papers went to something like a thousand layers deep and train them successfully.

00:25:12.000 | In both cases the fix ups much more recent but in both cases people have kind of held them as.

00:25:19.000 | Reasons we can get rid of batch norm I think it's very unlikely to be true very very few people use this sell you thing now because in both cases they're incredibly fiddly.

00:25:30.000 | You know so for example in this in the self normalizing neural networks case if you put in dropout you need to put a correction if you know if you do anything different in put in a correction as soon as you as you've seen as soon as something changes like the amount of leakiness in your activation function or whatever.

00:25:46.000 | All you know all of your assumptions about what your variance will be in the next layer disappear.

00:25:53.000 | And for the cellular paper it was a particular problem because it relied on 2 specific numbers that were calculated in a famous 96 page long appendix of math in the cellular paper and so if you wanted to do a slightly different.

00:26:10.000 | You know architecture in any way and they only showed this a fully connected network so even if you want to do convolutions what are you going to do you know redo that 96 pages of math so that 96 pages of math is now so famous that it has its own Twitter handle the cellular appendix.

00:26:25.000 | Which has the pin tweet why does nobody want to read me and this is like literally what the entire 96 pages of the appendix looks like.

00:26:35.000 | I will mention that this in my opinion this is kind of a dumb way of finding those 2 numbers the all you need is a good in it paper is a much better approach to kind of.

00:26:46.000 | Doing these things in my opinion which is like if you've got a couple of parameters you need to set then why not kind of set them using a quick little loop or something you know so if you if you need those if you want to find.

00:26:58.000 | To kind of sell you parameters that work for your architecture you can find them empirically pretty quickly and pretty easily.

00:27:07.000 | Okay so that's a little bit about in it we'll come back to more of that very shortly.

00:27:14.000 | There was one other question from last week which was we noticed that the shape of the kind of manual linear layer we created and the shape of the pipe torch one were transposed and the question was why.

00:27:32.000 | And so again I did some digging into this until eventually sumeth from the high torch team pointed out to me this commit from.

00:27:42.000 | 7 years ago in the old lure torch code where this actually happened and that basically it's because that old lure library.

00:27:51.000 | Couldn't handle batch matrix multiplication without doing it in this transposed way and that's why still to this day pie torch does it.

00:28:00.000 | And upside down which is fine like it's not slower it's not a problem but again it's kind of an interesting case of like.

00:28:08.000 | I find this happens all the time like in deep learning something's done a particular way forever and then everybody does it that way forever and nobody goes back and says why now this particular case it really doesn't matter I don't think.

00:28:22.000 | But often it does right so like things like how do we initialize neural networks and how many layers should they have and stuff like that they kind of.

00:28:30.000 | Nobody really thought of like nobody really changed challenged the normal practices for years so I'm hoping that with this.

00:28:36.000 | You know really ground up approach you can see what the assumptions we're making are and see how to question them and see that you know even to me pie torch is the best library around at the moment and even pie torch has these weird kind of.

00:28:51.000 | Our cake edges to it.

00:28:56.000 | OK so that was a little diversion to start with but a fun diversion because that's you know something I spend a couple of days this week on and think it's pretty interesting so to go back to how do we implement a basic modern CNN.

00:29:10.000 | Model.

00:29:13.000 | We got to this point so we've done a matrix modification so that's our fine function we've done real you so that's our nonlinearity and so a fully connected network forward.

00:29:27.000 | Is simply layering together those 2 things.

00:29:31.000 | So we did that and then we did the backward pass and we kind of refactored that nicely and it turned out that it looked pretty similar to pie torches way of doing things.

00:29:41.000 | And so now we're ready to train our model and that's where we're up to.

00:29:47.000 | So here we are.

00:29:49.000 | Oh 3 many batch training and we're going to train our model.

00:29:53.000 | So we can start.

00:29:56.000 | By grabbing our MNIST data so again we're just importing the stuff that we just exported from the previous class.

00:30:04.000 | Here's the model we created in the previous class.

00:30:08.000 | And so let's get some predictions from that model and we'll call them pred.

00:30:14.000 | And so now to train our model the first thing we need to do is we need a loss function.

00:30:20.000 | Because without a loss function we can't train it now profuse previously we used mean squared error which I said was a total cheap.

00:30:28.000 | Now that we've decided to trust pie torches auto grad we can use many more things because you don't have to write our own gradients and I'm too lazy to do that.

00:30:39.000 | So let's go ahead and use cross entropy because cross entropy makes a lot more sense to remind you from.

00:30:47.000 | The last class.

00:30:50.000 | There is an entropy example notebook where we learnt first of all that cross entropy requires doing two things first of all softmax.

00:31:01.000 | Well in the case it is multi class categorical cross entropy first to softmax and then you do the negative log likelihood so the softmax was if we have a bunch of different possible.

00:31:13.000 | Predictions and we got some output for each one from our model then we take either the power of that output we sum them all up and then we take.

00:31:25.000 | Either the power of divided by the sum of either the power of and that was our softmax.

00:31:30.000 | So there it is in math form there it is in summation math form and here it is in code form.

00:31:45.000 | So either the X divided by X X some and then the whole thing we do a dot log and that's because in pie torch negative log likelihood expects a log softmax not just a softmax and we'll see why in a moment.

00:32:04.000 | I'm sorry pop a log on the end so here's a lot longer softmax function.

00:32:09.000 | So now we can go ahead and create a softmax predictions by passing.

00:32:13.000 | Preds to log softmax.

00:32:16.000 | Now that we've done that we can calculate cross entropy loss.

00:32:21.000 | And cross entropy loss is generally expressed in this form which is this form some of actual times the log of the probability of that actual so in other words if we have is cat and is dog then here's our actual so it's one hot encoded is cat yes is dog no.

00:32:46.000 | We have our predictions from our from our model from our softmax.

00:32:53.000 | We can then say well what's the log of the probability it's a cat so log of this what's the log of the probability it's a dog so log of one minus that.

00:33:03.000 | And so then our negative log likelihood is simply B times E plus C times F and then take the negative of all that that's negative log likelihood which is what this is.

00:33:16.000 | But remember and I know I keep saying this because people keep forgetting not you guys but people out in the world keep forgetting that when you're multiplying by stuff which is mainly 0 and one hot encoded multi categorical classification most of your categories are 0.

00:33:32.000 | Every time you multiply by 0 you're doing nothing at all but you're doing it very slowly.

00:33:37.000 | So rather than multiplying by 0 and then adding up the one one that you have a much faster way as we know to do to multiply by a one hot encoded thing is to first of all simply say what's the location of the one.

00:33:53.000 | Here so in this case it's location to this case it's location one if we index from one and then we just look up into our array of probabilities directly offset by this amount.

00:34:06.000 | Or put it in math terms for one hot encoded X's the above is simply log of PI where I is the index of our prediction.

00:34:20.000 | Sorry not our prediction of the actual so the index into here the actual.

00:34:26.000 | So how do we write this in PyTorch and I'll show you a really cool trick.

00:34:35.000 | This is that this is what we're going to end up with this is our negative log likelihood.

00:34:40.000 | Implementation and it's incredibly fast and incredibly concise and I'll show you how we do it.

00:34:46.000 | Let's look at our dependent variable so let's just look at the first three values there five zero four so that's the first three elements of the dependent variable.

00:34:59.000 | And so what we want to do is we want to find what is the probability associated with five in our predictions and with zero and with four.

00:35:11.000 | So our predictions are softmax predictions remember fifty thousand by ten and so if we take the very first of those.

00:35:25.000 | That I all are right and so.

00:35:30.000 | Said that the actual answer should be five so if we go into this zero one two three four five that's the answer that we're going to want right.

00:35:51.000 | So here's how we can grab all three of those at once.

00:35:55.000 | We can index into our array with the whole thing five zero four.

00:36:02.000 | And then for the first bit we pass in.

00:36:05.000 | Just contiguous integers zero one two.

00:36:09.000 | Why does this work this works because PyTorch supports all of the advanced indexing support from NumPy and so if you click on this link.

00:36:20.000 | One of the many things that types of indexing that NumPy and therefore PyTorch supports is integer array indexing and what this is.

00:36:30.000 | Is that you pass a list for each dimension so in this case we have two dimensions so we need to pass two lists and the first is the list of all of the row indexes you want and the second is the list of all of the column indexes you want so this is going to end up returning zero comma five.

00:36:49.000 | One comma zero and two comma four.

00:36:53.000 | Which is.

00:36:55.000 | The exact numbers that we wanted so example zero five is minus two point four nine.

00:37:01.000 | So to grab the entire list of the exact things that we want for our negative log likelihood.

00:37:11.000 | Then we basically say OK let's look in our predict let's look in our predictions and then for our row indexes.

00:37:21.000 | It's every single row index so range of target dot shape zero so target dot shape zero is the number of rows so range of that is all of the numbers from zero to the number of rows so zero one two three blah blah blah fifty thousand four forty nine thousand ninety nine.

00:37:38.000 | And then which columns do we want for each of those rows or whatever our target is whatever the actual value so in this case five zero four etc.

00:37:49.000 | So that returns.

00:37:53.000 | All of the values we need we then take minus because it's negative log likelihood and take the mean so that's all it takes to do negative log likelihood in PyTorch which is super wonderfully easy.

00:38:07.000 | So now we can calculate our loss which is the negative log likelihood of the softmax predictions.

00:38:14.000 | That's what we had up here.

00:38:17.000 | Compared to our actual why trading.

00:38:21.000 | And so there it is.

00:38:25.000 | Now this was our softmax formula which is a to the X over some of the X's.

00:38:36.000 | So we have a and then it's all logged so we've got a log of A over B and remember I keep telling you that like one thing you want to remember from high school math is how logs work so I do want you to try to recall that log of A over B is log of A minus log of B.

00:38:51.000 | And so we can rewrite this as log of A to the X minus log of all that and of course either the something and log are opposites of each other so a log of A to the X is just X so that ends up being X minus.

00:39:12.000 | X dot X dot some dot log.

00:39:16.000 | So this is useful.

00:39:18.000 | And let's just check that that actually works so as I kind of keep refactoring these things as even as I'd like to me.

00:39:24.000 | These mathematical manipulations are just refactoring right so just refactoring the math so you keep checking along so we created test near last time so let's use it to make sure that it's a similar the same as our loss.

00:39:37.000 | Now you'll see here this is taking the log of the sum of the X and there's a trick called log some X.

00:39:51.000 | Now the reason we need this trick is that when you go into the power of something you can get ridiculously big numbers and if you've done Rachel's new computational linear algebra course then you'll know that very big numbers in floating point.

00:40:06.000 | On a computer are really inaccurate basically the further you get away from zero the less kind of fine grained they are you know gets to the point where like two numbers a thousand apart the computer thinks they're the same number so you don't want big numbers particularly when you're calculating gradients.

00:40:24.000 | So anywhere you see an eight of the X we get nervous we don't want X to be big but it turns out that if you do this little mathematical substitution you can actually subtract a number from your exes and add them back at the front and you get the same answer so what you could do is you can find the maximum of all of your exes.

00:40:50.000 | You can subtract it from all of your exes and then add it back afterwards outside the X and you get exactly the same answer so in other words let's find the maximum.

00:41:02.000 | That's subtracted from all of our exes and then let's do log some X and then at the end we'll add it back again and that gives you exactly the same number that without this numerical problem.

00:41:14.000 | So when people talk about like numerical stability tricks they're talking about stuff like this and this is a really helpful numerical stability trick.

00:41:23.000 | So this is how you do log some X in real life we can check that this one here is the same as and look in fact log some X is already a method in pytorch it's such a important and useful thing you can just actually use pytorches and you'll get the same result as the one we just wrote.

00:41:43.000 | So now we can use it so log softmax is now just X minus X dot log some X.

00:41:49.000 | And let's check yep still the same so now that that's all working we may as well just use pytorches log softmax is and pytorches and our little loss.

00:42:00.000 | But actually I know a loss of log softmax is called cross entropy.

00:42:09.000 | So finally we get test near F dot cross entropy is the same as loss and it is so we've now recreated by torches cross entropy so we're allowed to use it according to our rules.

00:42:21.000 | OK so now that we have a loss function we can use it to train and we may as well also define a metric because it's nice to see accuracy to see how we're going just much more interpretable and remember from part one that the accuracy is simply grab the argmax OK to find out which which which of the numbers in our softmax is the highest and the index of that is our prediction and then check whether that's equal to the actual.

00:42:50.000 | And then we want to take the main but in pytorch you can't take the main of it's you have to take the main of floats which makes some sense so turn it into a float first so there's our accuracy.

00:43:02.000 | So let's just check let's grab a batch size of 64 and let's grab our first X batch this is our first playing around with many batches right so our first X batch is going to be a training set from zero up to batch size.

00:43:16.000 | So our predictions is we're just going to run our model and remember our model was.

00:43:25.000 | Linear value linear those still using a super simple model so let's calculate some predictions and let's have a look at them and here's some predictions and it's 64 by 10 as you'd expect batch size 64 and 10 possible probabilities right.

00:43:42.000 | So now we can grab our first batch of dependent variables and calculate our loss.

00:43:50.000 | OK that's 2.3 and calculate our accuracy and as you'd expect it's about 10% because we haven't trained our model.

00:43:57.000 | So we've got a model that's.

00:43:59.000 | Giving basically random answers.

00:44:02.000 | So let's train it so we need a learning rate.

00:44:05.000 | We need to pick a number of epochs.

00:44:08.000 | And we need a training loop.

00:44:10.000 | So our training loop if you remember from part one.

00:44:14.000 | Remember lesson to SGD.

00:44:17.000 | Our training loop.

00:44:19.000 | Looks like this.

00:44:21.000 | Calculate your predictions.

00:44:23.000 | Calculate your loss.

00:44:26.000 | Do backward subtract learning rate times gradients and zero the gradients so let's do exactly the same thing.

00:44:36.000 | We're going to go through a cheap walk and go through I up until and which is 50,000.

00:44:41.000 | That's the number of rows but integer divide by batch size because we're going to do a batch at a time and so then we'll grab everything starting at times batch size and ending at that plus batch size.

00:44:53.000 | So this is going to be our first this is going to be a mini batch and so let's grab one X mini batch one Y mini batch and pass that through the model and our loss function.

00:45:05.000 | And then do backward.

00:45:08.000 | And then we're going to do our update which remember we have to do with no grad because this is not part of the gradient calculation. This is the result of it.

00:45:15.000 | But now we can't just go.

00:45:18.000 | A dot subtract learning rate times gradient we have to do that for every single one of our parameters so our model has.

00:45:29.000 | 3 layers. The value has no parameters in it.

00:45:33.000 | So the linear layer has weight and bias and this linear layer has weight and bias so it basically got 4 tenses to deal with.

00:45:43.000 | So we're going to go through all of our layers and let's just check whether that layer has an attribute called weight or not that's a bit kind of more flexible than hard coding things and if it does then let's update the weight to minus equals the gradient of that.

00:45:58.000 | By the learning rate the bias to the bias gradient by the learning rate and then 0 those gradients when we're done.

00:46:06.000 | So let's run it.

00:46:09.000 | And then let's check the loss function and the accuracy and the loss has gone down from 2.3 to 0.05 and the accuracy has gone up from 0.12 to 1.

00:46:22.000 | Notice that this accuracy is for only a single mini batch and it's a mini batch from the training set so it doesn't mean too much, but obviously our model is learning something so this is good so this is.

00:46:35.000 | This is there you know we're now.

00:46:41.000 | Well, we haven't really done calm, but I guess we've got a basic training. We're now here. We have a basic training.

00:46:48.000 | Which is great so we kind of got all the pieces.

00:46:52.000 | So let's try to make this simpler 'cause this is too much code right and it's too hard to fiddle around with.

00:46:58.000 | So the first bit will do.

00:47:02.000 | Is we're going to try and get rid of.

00:47:05.000 | This mess.

00:47:07.000 | And we're going to replace it with.

00:47:11.000 | And so the difference here is rather than manually going through weight and bias for each one.

00:47:18.000 | We're going to loop through.

00:47:20.000 | Something called model dot parameters, so we're not even going to look through the layers. We're just going to loop directly through model dot parameters and for each parameter will say that parameter minus equals gradient times learning rate.

00:47:32.000 | So somehow we need to be able to get all of the parameters of our model 'cause if we could do that we could greatly simplify this part of the loop and also make it much more flexible right so.

00:47:45.000 | To do that.

00:47:50.000 | We could create something like this and is calling this dummy module right and in dummy module what I'm going to do is I'm going to say every time I.

00:48:00.000 | Set an attribute like L1 or L2.

00:48:04.000 | To a you know in this case to linear.

00:48:07.000 | I want to.

00:48:09.000 | Update a list called underscore modules with a list of all of the modules I have so in other words after I create this dummy module.

00:48:17.000 | I want to be able to print out here's my representation I want to be able to print out the list of those modules and see the modules that are there 'cause then I can define a method called parameters.

00:48:29.000 | That will go through everything in my underscore modules list and then go through all of their parameters and that's what I'll be able to do see I could do here model dot parameters.

00:48:41.000 | So how did I create this just it's not inheriting from something right this is all written in pure Python.

00:48:48.000 | How did I make it so that as soon as I said here's an attribute in my in my in it that somehow it magically appeared in this underscore modules list so that I could then create this parameters so that I could then do this refactoring.

00:49:05.000 | And the trick is that Python has a special dunder set atra method and every time you assign to anything inside self inside Python.

00:49:17.000 | It will call this method if you've.

00:49:20.000 | Got one and so this method just checks that my the key so in other words the attribute name doesn't start with underscore 'cause if it does it might be underscore modules and then it's going to be like a recursive loop and also Python's got all kinds of.

00:49:34.000 | Internal stuff that starts with underscore so as long as it's not some internal private stuff.

00:49:39.000 | Put that value inside my modules dictionary and call it K.

00:49:44.000 | That's it right then after you've done that.

00:49:47.000 | Do whatever the super class does when it sets attributes and in this case the super class is object if you don't say what it is that it's just the Python highest level object so now we have something that has all of the stuff we need to do this refactoring.

00:50:03.000 | But the good news is pie torch also has something that does that and it's called an end up module.

00:50:11.000 | So we can do the exact same thing rather than implementing that set attributes stuff ourselves we can just call just inherit from an end up module and it does it for us right and so this is now you know why you have to call super dunder in it first right because it has to set up.

00:50:30.000 | It's equivalent of this underscore modules dictionary right so.

00:50:35.000 | That's why you have to call super in it first and then after you've done that in pie torch.

00:50:41.000 | It's exactly the same as what I just showed you it now creates something which you can access through named children and you can see here if I print out the name and the layer there is the name and the layer.

00:50:53.000 | So this is how pie torch does the exact same thing just like I created a dunder repra pie torch also has a dunder repra so if you just print out model it prints it out like so you can grab the attributes just in the normal pythonic way it's just a normal python class it has a bit of bit of this extra behavior.

00:51:17.000 | So now we can run it with this refactoring.

00:51:25.000 | Make sure everything works.

00:51:27.000 | And there we go okay so this is doing exactly the same thing as before but a little bit more conveniently.

00:51:33.000 | Not convenient enough for my liking so one thing we could try to do is to get rid of the need to write every layer separately maybe go back to having it as a list again.

00:51:46.000 | So if we made it a list of layers.

00:51:51.000 | And then we want to be able to pass that to some model class.

00:51:56.000 | Pass in the layers.

00:51:58.000 | This is not enough.

00:52:00.000 | To make them available as parameters right because the only thing that actually that pie torch is going to make available as parameters are things that.

00:52:08.000 | That it knows are proper and end up modules so but here's the cool thing you can just go through.

00:52:16.000 | All of those layers and call self dot add module that's just the equivalent of what I did here when I said self dot underscore modules blah blah right so in pie torch you can just call self dot add module and just like I did you give it a name and then you pass in the layer and so if you do that.

00:52:36.000 | If you do that then you end up with.

00:52:41.000 | The same thing okay so that's one that's one thing you could do but this is kind of clunky so it'd be nice if pie torch would do it for you and it does that's what end up module list does so if you.

00:52:55.000 | If you create if you use an end up module list then it just.

00:53:00.000 | Basically calls that line of code for you.

00:53:04.000 | So you can see us doing it here we're going to create something called sequential model which just set self dot layers to that module list and then when we call it just goes through each layer X equals that layer of X and returns it.

00:53:18.000 | And there's that okay even this is a little bit on the clunky side why would we have to write it ourselves.

00:53:25.000 | We don't pie torch has that code already it's called an end up sequential.

00:53:30.000 | Okay so we've now recreated an end up sequential.

00:53:36.000 | And there it is doing the same thing.

00:53:39.000 | So again we're not creating like dumped down versions if you look at an end up sequential and you look at the source code and you look at forward it's just.

00:53:50.000 | It's even the same name self go through each module and self underscore modules dot values input equals module input return input.

00:53:59.000 | So that's their version and remember our version.

00:54:03.000 | You know was.

00:54:07.000 | Basically the same.

00:54:10.000 | And we could even put it in something called underscore modules so yeah that's what that's all an end up sequential is doing for you.

00:54:19.000 | Okay so we're making some progress it's less ugly than it used to be still more ugly than we would like.

00:54:28.000 | This is.

00:54:33.000 | This is where we got our fifth function up to.

00:54:37.000 | So let's try and simplify it a bit more.

00:54:41.000 | Let's replace all this torch dot no grad for PN model parameters blah blah blah with something where we can just write those two lines of code that would be nice.

00:54:50.000 | So let's create a class called optimizer.

00:54:54.000 | We're going to pass in some parameters.

00:54:57.000 | And store them away.

00:55:00.000 | And we're going to pass in the learning rate and we're going to store that away.

00:55:06.000 | And so if we're going to be able to go up dot step up dot step has to do.

00:55:11.000 | This so here is step with torch not no grad go through each parameter and do that okay so it's just back to that out and zero grad we probably shouldn't actually go model zero grad because.

00:55:25.000 | It's actually possible for the user as you know to say I don't want to include certain parameters in my optimizer so when we're doing like gradual unfreezing and stuff so really zero grad should actually do this it should go through the list of parameters that you asked to.

00:55:40.000 | Optimize and zero those gradients so here we've now created something called optimizer and we can now.

00:55:48.000 | Grab our model and so we remember that the model now we've created something called dot parameters so we can pass that to our optimizer and then we can now just go up dot step up dot zero grad and let's test it and it works.

00:56:03.000 | OK now of course luckily for us pipe torture already has these lines of code it's called opt in dot SGD.

00:56:14.000 | Now opt in dot SGD does do a few more things weight decay momentum stuff like that so let's have a look here's opt in dot SGD and here's a step function.

00:56:28.000 | It's got weight decay momentum dampening this drop we're going to see all these things very shortly but basically all it does is it goes through each layer group.

00:56:37.000 | And it.

00:56:39.000 | Does the exact thing that we just see so once you remove the momentum and stuff and we're going to be implementing this in a much better way than pytorch in very soon so once you remove all that.

00:56:50.000 | Their opt in dot SGD is exactly the same as our optimizer.

00:56:58.000 | So let's go ahead and use that instead.

00:57:02.000 | And so it's kind of nice then if we're going to use all the parameters of the model it's just create a get model which creates a model and returns it as well as a SGD optimizer with all the parameters.

00:57:14.000 | And okay there's a training loop.

00:57:19.000 | And seems to be working.

00:57:23.000 | It's nice to put tests in from time to time and I like to put these tests in like hey my accuracy should be significantly better than 50%.

00:57:33.000 | You know note that these kind of stochastic tests are highly imperfect in many ways it's theoretically possible it could fail because you got really unlucky.

00:57:43.000 | I know though that this is really vanishingly unlikely to happen it's always much more than 90%.

00:57:52.000 | It's also possible that your code could be failing in a way that causes the accuracy to be.

00:57:59.000 | A bit lower than it should be but not this low.

00:58:02.000 | I still think it's a great idea to have these kinds of tests when you're doing machine learning because they give you a hint when something's going wrong and you'll notice I don't set a random seed at any point this is very intentional.

00:58:20.000 | I really like it that that if there's variation going on when I run my model at different times I want to see it.

00:58:28.000 | I don't want it to be hidden away behind a fixed seat so there's a there's a big push in science for like reproducible science which is which is great for many reasons but it's not how you should develop your models and you're developing your models.

00:58:41.000 | You want to have a kind of good intuitive sense of what bits are stable and what bits are unstable and how much variation do you expect and so if you have a test which.

00:58:51.000 | You know fails one every out of one every 100 times it's it's good to know that you know and so like in the first day I code there's lots of tests like that and so then sometimes.

00:59:03.000 | You know there'll be a test that fails it's nothing particularly to do with the push that just happened but it's it's really helpful for us because then we can look at it and be like oh.

00:59:11.000 | This thing we thought should pretty much always be true sometimes isn't true and then we'll go back and we'll deeply study why that is and figure out how to make it more stable and how to make it reliably pass that test so this is a kind of a controversial kind of test to have that something that I found in practice is very very very helpful.

00:59:32.000 | It's not complete and it's not totally automated and it's imperfect in many ways but it's nonetheless helpful.

00:59:40.000 | OK let's get rid of these 2 lines of code these were the lines of code that grabbed X mini batch from the training set and the Y mini batch from the training set.

00:59:49.000 | Let's do them both in one line of code.

00:59:52.000 | So it'd be nice to have one line of code we have some kind of object where we can pass in the indexes we want and get back both X and Y.

01:00:00.000 | And that's quite a data set as you know so here's our data set class again not inheriting from anything it's all from scratch play Python we initialize it by passing in the X and the Y will store them away.

01:00:13.000 | It's very handy to have a length hopefully you know by now if you don't then now's a good time to realize that dunder Len is the thing that lets you go Len of something in Python and have it work that's what Len will call so now we've got the length of our data set.

01:00:29.000 | And dunder get item is a thing that when you index into it it will return that and so we just return the tuple of X I and Y I.

01:00:40.000 | So. Let's go ahead and create a data set for our training set and a validation set check that the lengths are right.

01:00:50.000 | Check the first.

01:01:10.000 | So the next thing we're going to do so that's a data set.

01:01:14.000 | Next thing we're going to do is create a data loader.

01:01:17.000 | This is what the start of our training loop look like before and let's replace it with this single line of code.

01:01:25.000 | So to do that we're going to have a class we're going to have to have a class that takes a data set and a batch size and stores them away and when you go for blah in blah behind the scenes in python it calls dunder itter.

01:01:42.000 | And so what we're going to do is we're going to loop through range from zero up to the size of the data set jumping up batch size at a time so 064128 etc up to 50,000 and each time we go through we will.

01:01:58.000 | Yield our data set at an index starting at I and ending up ending at I plus self dot batch size.

01:02:07.000 | Probably quite a lot of you haven't seen yield before it's an incredibly useful concept it's.

01:02:16.000 | If you're really interested it's something called a co routine it's basically this really interesting idea that you can have a function that doesn't return just one thing once back can return lots of things and you can kind of ask for it.

01:02:27.000 | Lots of times so the way these iterators work in python is that when you when you call this it basically returns something which you can then call next on lots of times and each time you call next it will return the next thing.

01:02:44.000 | That is yielded so it's not I don't have time to explain car routines in detail here but.

01:02:52.000 | It's really worth looking up and learning about we'll be using them lots.

01:02:57.000 | They're super valuable thing and it's not just for data science they're really handy for things like network programming web apps stuff like that as well so well worth being familiar with yield in python and nowadays most programming languages have something like this so you'll be able to.

01:03:13.000 | Take it to wherever you go.

01:03:17.000 | So now we have a data loader we can create a training one and a validation one and we can this is how we do it.

01:03:24.000 | It's a valid deal is the thing that basically kind of generates our co routine for us and then next is the thing that grabs the next thing yielded out of that car routine so this is a very common thing you'll be doing lots next in a blah you probably did it a whole lot of times.

01:03:42.000 | In part one because we kind of did it without diving in very deeply into what's going on and that returns.

01:03:51.000 | One thing from our data set in the data set returns two things because that's what we put in it so we expect to get two things back and we can check that those two things are the right size.

01:04:02.000 | So that's our data loader and so let's double check.

01:04:07.000 | There it is good stuff so now.

01:04:11.000 | There's our fitness function let's call the fitness function looking good.

01:04:16.000 | So this is about as neat as we're going to get that's that's quite beautiful right.

01:04:23.000 | It's kind of.

01:04:25.000 | All the steps you can think of if you said it in English there go through each epoch.

01:04:30.000 | Go through each batch grabbing the independent independent variable.

01:04:34.000 | Calculate the predictions.

01:04:37.000 | Calculate the losses.

01:04:39.000 | Calculate the gradients.

01:04:42.000 | Update with the learning rate.

01:04:45.000 | Reset the gradients.

01:04:48.000 | So that's you know that's kind of where you want to get is to a point where you can read your code.

01:04:53.000 | In a very kind of intuitive way to a domain expert and until you get to that point it's very hard really I find to really maintain the code and understand the code.

01:05:02.000 | And this is the trick for doing research as well as it's not just for you know hardcore software engineering a researcher that can't do those things to their code can't do research properly right because if you think of something you want to try.

01:05:17.000 | You know you don't know how to do it or it takes weeks or if there are bugs in it you don't know so you know you want your code to be quite beautiful.

01:05:25.000 | I think this is beautiful code.

01:05:30.000 | And this is at this point you know.

01:05:34.000 | This data set and this data loader are the same extractions that PyTorch.

01:05:40.000 | Uses so let's dig into this a little bit more we do have a problem which is that we're always looping through our training set in order.

01:05:49.000 | And that's very problematic because we lose the randomness of kind of shuffling it each time particularly if our training set was already like ordered by dependent variable.

01:05:59.000 | Then every batch is going to be exactly the same dependent variable so we really want to shuffle it.

01:06:06.000 | So let's try random sampling so for random sampling I'm going to create a sampler class and we're going to pass into it a data set to sample.

01:06:17.000 | And a batch size and something that says whether to shuffle or not right and as per usual we just store those away I don't actually store away the data set I just store away the length of the data set so that we know.

01:06:28.000 | How much to how many items to sample.

01:06:32.000 | And then here's that here's that under it right so remember this is the thing that we can call next on lots of times.

01:06:40.000 | And so if we are.

01:06:43.000 | Shuffling.

01:06:47.000 | Then let's grab a random permutation of the numbers from naught to n minus one.

01:06:53.000 | And if we're not shuffling then let's grab all of the integers in order from zero to n minus one.

01:07:00.000 | And then this is the same we had before go through that range and yield the indexes so what does that look like.

01:07:09.000 | Here's a sampler with shuffle equals false and a batch size of three oh one two three four five six seven eight nine and here it is.

01:07:21.000 | With shuffle equals true five four three seven six two eight nine oh one.

01:07:27.000 | So now that we've got these we can now replace our data loader with something where we pass it a sampler.

01:07:35.000 | And we then loop through for s in samplers that's going to loop through each of these right and the cool thing is that because we used yield these are only going to be calculated when we ask for them they're not all calculated up front so we can use these on really big data sets no problem.

01:07:50.000 | And so it's kind of this is a common thing is where you're actually looping through something.

01:07:57.000 | Which is itself a core routine and then yielding something which does other things to that so this is like a really nice way of doing streaming computations it's being done lazily and not going to run out of memory it's a it's really neat way to do things and so then we're going to grab.

01:08:15.000 | All of the indexes in that sample and we're going to grab the data set at that index so now we've got a list of tenses.

01:08:24.000 | And then we need some way to collect them all together into a single pair of tenses and so we've created a function called collate which just grabs the X's and the Y's and stacks them up so torch stack just grabs a bunch of tenses and.

01:08:41.000 | Glues them together on a new access you might want to do different things like add some padding or you know stuff like that so you can pass in a different collate function if you want to and it'll store it away and use it right so now.

01:08:57.000 | We can create our 2 samplers we can create our 2 data loaders with those samplers so the training one is shuffling the valid ones not shuffling so let's check as the validation data loader and the training data loader if we call it twice with exactly the same index we get different things in this case we got 2/8 but they're different 8's.

01:09:20.000 | Call it another 2 times we're getting different numbers okay so it's it is shuffling as we hoped.

01:09:26.000 | And so again we can train our model and that's fine.

01:09:32.000 | So the pie torch data loader.

01:09:35.000 | Does exactly that so let's import the pie torch data loader and you can see it takes exactly the same arguments.

01:09:43.000 | Okay and we can even pass in the exact collate function that we just wrote it's it doesn't have a single sampler that you pass shuffle equals true or false true it has 2 set samplers 1 called random 1 called sequential so slightly different to the API we just wrote but does exactly the same thing.

01:09:59.000 | And so.

01:10:01.000 | You can create those data loaders and works exactly the same so that's what a pie torch data loader does.

01:10:08.000 | Most of the time you don't need the flexibility of writing your own sampler and your own collation function so you can just pass in shuffle and it will use the default.

01:10:19.000 | Sampler and collation function that work the way we just showed.

01:10:25.000 | Something that we did not implement in pie torches data loader is that in purchase data loader you can pass in an extra parameter called num workers and that will fire off that many processes and each one will separately grab stuff out of your data set and then it'll collect them together afterwards and so if your data sets doing things like.

01:10:47.000 | You know opening big jpeg files and doing all kinds of image transformations that's a really good idea.

01:10:54.000 | So we want to implement that.

01:10:57.000 | So finally for this section.

01:11:00.000 | We should add validation.

01:11:03.000 | So to know if we're overfitting we need to have a separate validation set.

01:11:13.000 | So here's the same loop that we had before.

01:11:17.000 | And here's and here's the same loop pretty much again but with torch dot no grad going through the validation set.

01:11:25.000 | So for this we grabbed the predictions and the losses before but we don't call backward and we don't step the optimizer because it's just a validation instead we just keep track of the loss and we also keep track of the accuracy.

01:11:39.000 | The only other difference is that we've added here model dot train and here model dot novelle.

01:11:47.000 | What does that do well actually all it does is it sets a internal attribute called dot training to true or false.

01:11:55.000 | So let's try it if I put print model dot training after each one.

01:12:00.000 | And train this.

01:12:04.000 | See true false true false true false okay and so why does it set this thing called model dot training to true or false because some kinds of layers need to have different behavior depending on whether it's training or evaluation or validation.

01:12:22.000 | For example batch norm only updates its running statistics if it's training dropout only does randomized dropout if it's training they're the two main ones so that's why you always want to train and avail and if you forget to put something into a valve mode when you're done training you'll often be surprised because you'll be getting worse results than you expected.

01:12:47.000 | Okay, so that's that's our fit loop one thing to note.

01:12:52.000 | Are these validation results correct if the batch size varies spell that correctly if.

01:13:01.000 | If the batch size varies because what we're doing here is we're adding up.

01:13:05.000 | The loss and we're adding up the accuracy and then at the end we see how big is our data loader how many batches are there and we divide.

01:13:14.000 | But if you think about it if you had one mini batch of size 1000 and one mini batch of size one.

01:13:23.000 | You can't actually just do that right you can't you actually need a weighted average weighted by the size of the mini batch so this incorrect way is how nearly every library does it faster I does it the proper way and next time we do this we're going to do the proper way okay but for now.

01:13:40.000 | Here's what most people do and it does not work correctly when your batch size varies.

01:13:48.000 | So it it's handy to have something that we can basically pass in a training data set in a validation data set in a batch size to and just grab the data loaders.

01:13:57.000 | The training data set will be shuffled validation won't be shuffled also the validation data set we don't need to do the backward pass so we don't need to store the gradients so that means that we have.

01:14:09.000 | Twice as much room so we can make it twice this size twice the batch size so it's you know another nice thing to refactor out you don't have to type it anymore and also it means that you won't accidentally make a mistake.

01:14:22.000 | And so now we can go ahead and fit and let's do five epochs and so now these are actual validation accuracies.

01:14:32.000 | Okay great so we've successfully built a training loop let's have a six minute break come back at 755 and talk about callbacks.

01:14:44.000 | Before we continue Rachel any questions.

01:14:51.000 | So why do we have to zero out our gradients and pie torch.

01:14:56.000 | Why do you have to zero out your gradients and pie torch so yeah.

01:15:06.000 | The way we.

01:15:08.000 | Let's go back to.

01:15:12.000 | So it is our here's our optimizer right.

01:15:16.000 | Or let's go back even further here's.

01:15:22.000 | Here's our first version so this is just.

01:15:28.000 | With no additional help from pie torch at all if we didn't go grad zero here.

01:15:38.000 | Then what's going to happen the next time we go through and say lost up backward is it's going to add.

01:15:44.000 | The new gradients to those existing gradients now why does that happen or that happens because we often have kind of lots of sources of gradients you know there's lots of kind of.

01:15:56.000 | Different modules all connected together and so they're getting their gradients from lots of different places and they all have to be added up so so when we call backward we wouldn't want backward to zero the gradients.

01:16:08.000 | Because then we would lose this ability to kind of plug in lots of things together and just have them have them work.

01:16:16.000 | So that's why we need the grad dot zero.

01:16:20.000 | Here so then you know that's part that's part one of the answer.

01:16:25.000 | Part two of the answer is.

01:16:28.000 | Why did we write our optimizer so there was one thing called step and one thing called zero grad because what we could have done is we could have removed these lines and push this up here.

01:16:40.000 | And so that step.

01:16:43.000 | Could have done both and then since we've actually got this kind of twice now we could put it all inside the for loop.

01:16:52.000 | So we could certainly have written our optimizer like this as a switch parameter and does the update and sets the gradient to zero and then we would be able to remove this line.

01:17:05.000 | So.

01:17:08.000 | The problem with that is that.

01:17:13.000 | Within remove the ability.

01:17:17.000 | To not zero the gradients here and that means any time that we don't want to zero the gradients we now can't use the optimizer so for example.

01:17:28.000 | What if you are working with some pretty big objects so like if you're doing super resolution and you're trying to create a two K output.

01:17:38.000 | You know your batch size you can only fit two images on the GPU at a time.

01:17:45.000 | And.

01:17:47.000 | The stability of the gradients that you get from a batch size of two is so poor that you need to use a larger batch size so well that would be.

01:17:58.000 | Really easy to do if you did it like this right because we could say.

01:18:08.000 | If.

01:18:10.000 | I.

01:18:12.000 | Percent.

01:18:15.000 | Two.

01:18:17.000 | Then.

01:18:20.000 | Right and so this is now going to only run these things every two iterations and so that means that our effective batch size is now double.

01:18:32.000 | So that's handy right that's called gradient accumulation the gradient accumulation is where you change your training loop so that your your optimizer step and your zero grads only happen occasionally so.

01:18:48.000 | That's really the reason is it is it there might be times you don't want to zero the gradients every time you do a step.

01:18:58.000 | And if you if there's no way to do that that's a problem.

01:19:03.000 | That you could argue that I can't think of a reason that this isn't a good idea we could make our optimizer we could say kind of like auto zero.

01:19:12.000 | Equals true say and then we could have something in here which kind of says like if self dot auto zero.

01:19:23.000 | Then self dot zero.

01:19:27.000 | Right something like that and then that could even be the default and then you wouldn't have to worry about it unless you're explicitly wanted to do gradient accumulation I think that would be really be a better API design maybe but that's.

01:19:41.000 | Not what they've done but it's so easy to write your own optimizers you could totally do that but I mean that you know the upside is removing a single line of code which.

01:19:51.000 | Isn't a huge upside anyway so.

01:19:55.000 | Any other questions Rachel.

01:19:58.000 | Okay.

01:20:03.000 | Okay so that's our training loop.

01:20:07.000 | But it's not quite where we wanted to be and I'm stealing some slides here from silver who had a really cool talk recently called an infinitely customizable training loop so I'll steal her slides.

01:20:21.000 | Before I do I would like to do a big thank you to silver.

01:20:27.000 | He has been working full time with fast day I for.

01:20:34.000 | Well over a year now I guess and a huge amount of what you see in the fast day I library and research and courses is is him so massive thank you to silver who's the most awesome person I've worked within my whole life so.

01:20:53.000 | That's pretty cool but also thank you to lots of other people huge thanks to stairs who a lot of you all have come across in the forum and he's he's done a lot of the stuff that makes faster I work.

01:21:05.000 | Well and he's entirely a volunteer so like super grateful to him.

01:21:11.000 | You know the stuff that lets you check with your installation works properly that lets you quickly check with your performance is what it should be also like organizing lots of helpful projects through the forums he's been fantastic lots of other folks as well.

01:21:26.000 | Andrew Shaw wrote a lot of the original kind of documentation stuff that we have Fred Monroe has been helpful in thousands of ways and it's just incredibly generous.

01:21:37.000 | Jason a lot of you will already be aware of who helped a lot with the final lesson of the last course and is hard at work now on taking it even further to doing some stuff that's going to blow you away.

01:21:51.000 | I particularly want to point out Radik because this is the list of the I can't quite count as a 20 most helpful people on the forum as ranked by a number of likes.

01:22:03.000 | You know when somebody clicks that like button that means they're saying you know you've you've helped me and more people have said that about Radik than anybody else and it's not surprising because Radik is just not just an incredibly helpful person but extremely thoughtful.

01:22:19.000 | And he's now I mean he.

01:22:23.000 | You know when he started with as a fast student he.

01:22:27.000 | Considered himself if I remember correctly basically a failed ML student he had tried a number of times to learn ML and hadn't succeeded but he's just applied himself so well for the last couple of years and he's now a Kaggle winner.

01:22:40.000 | You know a world recognized deep learning practitioner and so thank you to all of these people and everybody else who's contributed in so many ways and of course Rachel who's sitting right next to me.

01:22:56.000 | So this is the. Fit function that we just wrote or the one this slightly more elegant one before we added validation to it.

01:23:08.000 | So go through each epoch go through each sort of mini back to go through each mini batch get the prediction the loss backward pass update your parameters and then zero the gradients.

01:23:21.000 | So that's basically what we're doing model predictions loss gradients step at each time we grab a bit more training data.

01:23:34.000 | But. That's not really all we want to do in a training loop.

01:23:40.000 | We might want to add the beautiful fast progress progress bars and animations that silver created in his fast progress library or tense aboard or whatever and thanks to Jason actually we now have tense aboard integration in fast AI so be sure to check that out if you want extra pretty graphs like these.

01:24:01.000 | Hyper parameter scheduling. You might want to add all kinds of different regularization techniques these are all examples of regularization techniques that we support in fast AI and many more.

01:24:13.000 | Mixed precision training and also take advantage of the tensor cause in a voter GPU to train much faster.

01:24:22.000 | There's more tweaks you might want to do the training loop than than we could possibly think of and even if we did think of all of the ones that exist now somebody will come up with a new one tomorrow.

01:24:30.000 | So the so you've got some possible ways you could solve this problem.

01:24:36.000 | And you know some of the things are talking about or even things like how do you add gains more complex stuff so one approach is.

01:24:45.000 | Write a training loop for every possible way you want to train and this is particularly problematic when you start to like want to combine multiple different tweaks right as you like cutting and pasting or whatever.

01:24:59.000 | So that's certainly not going to work for fast AI.

01:25:05.000 | There's what I tried for fast AI zero point seven this is my training loop the last time I tried this which is like throw in every damn thing and it and it just got.

01:25:19.000 | So every time somebody would say like a new papers come out can you please implement and I just be like no I couldn't bear it.

01:25:29.000 | So now we have something better.

01:25:33.000 | Callbacks and callbacks are something which like every library has callbacks but nobody else have callbacks anything like our callbacks and you'll see what I mean our callbacks let you not only look at but fully customize every one of these.

01:25:48.000 | Steps right and so.

01:25:54.000 | Here's our starting training loop.

01:25:57.000 | Here's the fast AI.

01:26:00.000 | Version one training loop it's the same.

01:26:04.000 | Right there's the exact same lines of code.

01:26:08.000 | Plus.

01:26:10.000 | A bunch of calls to.

01:26:13.000 | Callbacks and so each one basically says.

01:26:17.000 | Before I do a step on step again.

01:26:20.000 | After I do a step on step and after I do a batch on batch and after I do an epoch on epoch and after finish training on training and right.

01:26:29.000 | And they have the ability to also change things or even.

01:26:33.000 | They have the ability to say please skip the next step.

01:26:36.000 | I returning a bullion.

01:26:39.000 | So with this we can create and have created all kinds of things and fast AI like learning rate schedulers.

01:26:46.000 | And early stopping.

01:26:49.000 | And parallel trainer this is literally when I wrote parallel trainer this is the entire call back I wrote.

01:26:55.000 | This is the entire gradient clipping call back right after you do the backward pass clip the gradients.

01:27:03.000 | So you can do a lot with a little.

01:27:08.000 | And then.

01:27:10.000 | You can mix them all together.

01:27:12.000 | Because all of the callbacks work with all of the other callbacks.

01:27:16.000 | So these are some of the callbacks that we have in fast AI.

01:27:20.000 | Right now.

01:27:23.000 | So for example.

01:27:25.000 | How did we do gains.

01:27:27.000 | Last.

01:27:28.000 | Course.

01:27:30.000 | So what we did behind the scenes was we created again module.

01:27:35.000 | That was ridiculously simple we created again module that had a forward method.

01:27:40.000 | That just said what's your generator mode is that.

01:27:45.000 | Sorry are you in generator mode or not and we're not means discriminator mode if you're in generator mode called the generator otherwise called the critic.

01:27:54.000 | And then there's a function called switch that just change generator mode backwards and forwards between generator and just discriminator.

01:28:02.000 | Same thing if we created a loss function where there was a generator loss.

01:28:07.000 | And a critic loss.

01:28:10.000 | And so then we created a call back.

01:28:13.000 | Right which had a switch that just switch the generator mode on and off.

01:28:18.000 | And past that along to the model I just showed you and the loss function I just showed you.

01:28:26.000 | And then it would set requires grad to the generator or discriminator as appropriate.

01:28:34.000 | And then would have on train begin on train end on that.

01:28:39.000 | Callbacks to do the right thing at the right time so most importantly at the start of an epoch.

01:28:44.000 | Set your generator mode.

01:28:46.000 | And at the end of training set your generator mode.

01:28:49.000 | So if you look at kind of other libraries implementation of GANS there.

01:28:55.000 | Basically kind of a whole new training loop whole new.

01:28:59.000 | Data load is whole new everything and it was really cool in fast AI we were able to create a GAN.

01:29:07.000 | In this you know incredibly small amount of code for such a complex task.

01:29:13.000 | So let's let's do that ourselves right because we've got a training loop if we add callbacks we should now then be able to do.

01:29:20.000 | Everything.

01:29:23.000 | So let's start out by grabbing our data as before.

01:29:29.000 | So we've got the number of hidden is 50 batch size 64 loss function is cross entropy.

01:29:37.000 | This is the signature of our fit function before and I got very nervous when I see functions with lots of things being passed to it.

01:29:48.000 | And it makes me think do we really need to pass all those things to it or can some of them be packaged up together.

01:29:53.000 | There's a lot of benefits to packaging up things together when you can package up things together where they're kind of alike things.

01:30:00.000 | You can pass them around to everything that needs them together.

01:30:04.000 | You can create them using kind of factory methods that create them together and you can do smart things like look at the combination of them and make smart decisions for your users.

01:30:15.000 | Rather than having to have them set everything themselves so there's lots of reasons that I would prefer to keep a pox right but I'd like to put all these other things into a single object.

01:30:29.000 | And specifically we can do that in 2 steps first of all let's take this data and say training and valid data conceptually should be 1 thing it's my data that maybe there's test data there as well.

01:30:41.000 | So let's create a class called data bunch.

01:30:45.000 | That we're going to pass in training data and validation data and we'll store them away.

01:30:51.000 | And that's the entirety there's no logic here but for convenience let's make it easy to grab the data set out of them.

01:30:57.000 | As well.

01:30:59.000 | Remember we're now using you can either use the.

01:31:04.000 | That the handmade data loader that we built in the last 1 or you can use the pie torch data loader they're both providing exactly the same API at this point except for the numb workers issue.

01:31:18.000 | So the remember that we passed these data load as a data set that you can access and then it would be nice if we could create a get model.

01:31:26.000 | Function.

01:31:28.000 | Which could create our model but automatically set the last layer to have the correct number of activations because the data knows how many activations it needs.

01:31:39.000 | So let's also optionally make it that you can pass in C which is going to get stored away so that then when we create our data we can pass in C which remember we set to our.

01:31:51.000 | Maximum y value.

01:31:53.000 | And so that way we never have to think about that again.

01:31:59.000 | So that's our.

01:32:02.000 | So that's our data bunch class.

01:32:06.000 | So there's our get model so it's just going to.

01:32:10.000 | Create a model with the number of inputs is the size of the input data.

01:32:17.000 | Number of hidden is whatever we had earlier, whatever we pass in and a value and then a linear from hidden to data dot C.

01:32:26.000 | And return the model and an optimizer.

01:32:29.000 | And we all know all about dot parameters now.

01:32:32.000 | So then the other.

01:32:36.000 | The rest of the stuff model lost funk opt and data.

01:32:39.000 | Let's store them in something but all up lost funk data.

01:32:44.000 | I want to store them away and that thing will call a learner.

01:32:48.000 | So notice a learner class has no logic at all.

01:32:52.000 | It's just a storage device for these 4 things.

01:32:58.000 | So now we can create a learner.

01:33:01.000 | Passing in the model and the optimizer since they're returned in this order from get model we can just say star get model.

01:33:09.000 | So that's going to pass in the model and the optimizer and we've got our lost function already at the top here we set it to cross entropy.

01:33:16.000 | And we've got our data because it's that data bunch we just created.

01:33:20.000 | So this there's nothing magic going on with data bunches and learners are just like wrappers for the information that we need.

01:33:29.000 | So now we'll take the fit function we had before and I just pasted it here but every time I had model I replaced it with learned up model every time I had data I replaced it with learned up data and so forth.

01:33:41.000 | Okay, so.

01:33:43.000 | There's the exact same thing that we had before still working fine.

01:33:48.000 | And so now.

01:33:51.000 | Let's add callbacks.

01:33:55.000 | So our fit function before basically said for epoch in range epochs for batch in train dl and then it had these contents right predictions lost backwards step zero grad I factored out the contents into something called one batch.

01:34:11.000 | Okay, and then I added.

01:34:14.000 | All these.

01:34:18.000 | Callbacks.

01:34:20.000 | At cb dot after backwards cd dot after step.

01:34:24.000 | I did one other refactoring which is that the.

01:34:29.000 | Training loop has to loop through every batch and the validation loop has to loop through every batch so I just created something called all batches.

01:34:39.000 | Okay, so this is my fit loop right begin fit the epoch in epochs begin epoch or batches with the training set begin validate.

01:34:49.000 | No grad or batches with a validation set after epoch after fit.

01:34:55.000 | Okay, so that's that.

01:34:59.000 | So here's a call back.

01:35:02.000 | Right, which has.

01:35:04.000 | All the stuff.

01:35:08.000 | And so then we need a call back handler and that's going to be something which you just say here's all my callbacks.

01:35:16.000 | And basically it's just going to go through for each thing and say go through every call back.

01:35:22.000 | And call it.

01:35:24.000 | And keep track of.

01:35:27.000 | Whether we've received a false yet or not false means don't keep going anymore and then return it so we do that for begin fit after fit begin epoch begin validate after epoch begin batch after loss after backward after step.

01:35:43.000 | So here's an example of a little call back we could create.

01:35:47.000 | And it's one that's going to at the start of the fit.

01:35:52.000 | It'll set number of iterations to zero.

01:35:55.000 | And then after every step it'll say number of iterations plus equals one.

01:36:00.000 | And print that out.

01:36:02.000 | And if we get past 10 iterations then it'll tell the learner to stop.

01:36:09.000 | Because we have this little thing called do stop that gets checked at the end.

01:36:15.000 | So let's test it.

01:36:20.000 | And so it called fit and it only did 10 batches and this is actually a really handy call back because quite often you want to like.

01:36:28.000 | Just run a few batches to make sure things seem to be working you don't want to run a whole epoch so here's a quick way you can do something like that.

01:36:37.000 | This is basically what fast AI be one looks like right now.

01:36:43.000 | It does have a little bit of extra stuff that lets you pass back and different loss and different data but it's nearly exactly the same.

01:36:51.000 | But.

01:36:53.000 | I really like.

01:36:55.000 | Rewriting stuff because when I rewrite stuff it lets me kind of look and see what I've written and when I looked back at this.

01:37:02.000 | I saw.

01:37:10.000 | It's like it's it's.

01:37:12.000 | There's this object this is the CB is the call back handler.

01:37:17.000 | That's being passed everywhere.

01:37:19.000 | And that's a code smell that code smell says something should have that state.

01:37:25.000 | And specifically these.

01:37:27.000 | Three functions should be the methods of something.

01:37:33.000 | That has this state so after I kind of wrote this part of the lesson I suddenly realized oh fast AI is doing it the dumb way so let's fix it so and this is likely to appear in a future version of fast AI I created a new thing called runner.

01:37:49.000 | And so runner is a new class.

01:37:56.000 | Runner is a new class that contains the three things I just said one batch.

01:38:01.000 | All batches.

01:38:03.000 | And fit.

01:38:05.000 | Right and the runner.

01:38:09.000 | So here's.

01:38:11.000 | Is fit.

01:38:13.000 | Right it's incredibly simple.

01:38:15.000 | We're going to keep track of how many epochs we're doing we're going to keep track of the learner that we're running and remember the learner has no logic in it the stores for things.

01:38:26.000 | And then.

01:38:30.000 | We tell each of our callbacks.

01:38:32.000 | What runner they're currently working with and then we call begin fit and then we go through each epoch.

01:38:39.000 | Set the epoch we call begin epoch we call all batches and then with no grad we call begin validate and then we call all batches and then we call after epoch and then we call after fit.

01:38:52.000 | That's it now.

01:38:54.000 | This self.

01:38:56.000 | String might look a bit weird.

01:38:59.000 | But look at what we had before.

01:39:02.000 | Again horrible code smell is lots of duplicate code.

01:39:07.000 | Res equals true for call back blah blah blah blah blah blah begin a park.

01:39:12.000 | Res equals true for call back blah blah blah blah blah begin validate so that's bad right code duplication means cognitive overhead to understand what's going on lots of opportunities to accidentally have one or instead of an and lots of places you have to change.

01:39:29.000 | If you need to edit something.

01:39:31.000 | So basically I took that out and I factored it out into.

01:39:37.000 | Dunder call so done to call is the thing that we've seen it before it's the thing that lets you treat an object as if it was a function.

01:39:47.000 | So I could have called this lots of things I could have called it self dot run call back or whatever right but it's the thing that happens absolutely everywhere and so my kind of rule of thumb is if you do something lots of times.

01:40:00.000 | Make it small so done to call is the smallest possible way you can call something you don't have to give it a name at all when you call it so we say call the call back called after epoch it also makes sense right we're calling a call back so why not use done to call to call a call back so after epoch.

01:40:21.000 | I gotta go through all of my callbacks.

01:40:25.000 | Talk about this sorted in a moment and then the other thing I didn't like before is that all of my callbacks had to inherit from this call back super class because if they didn't then they would have been missing.

01:40:40.000 | And one of these methods and so then when it tried to call the method there would have been an exception and I don't like forcing people to have to inherit from something they should be able to do whatever they like so what we did here.

01:40:54.000 | So what we did here was we used get attribute which is the python thing which says look inside this object and try to find something of this name a G begin validate.

01:41:07.000 | And default to none if you can't find it right so tries to find that call back and there will be none if the call back doesn't exist and if you find it.

01:41:18.000 | Then you can call it right so this is a nice way to.

01:41:24.000 | Call any call back but when you implement a call back as you can see look how much easier our test call back is now right it's just super simple just just implement what you need and we inherit from a new call back class.

01:41:40.000 | But we don't have to anymore right the main reason why is that our call back class now has an underscore order which we can use to.

01:41:50.000 | Choose what order callbacks running we'll talk about that after we handle this question.

01:41:57.000 | What is the difference between hooks and pie torch and callbacks and fast ai.

01:42:04.000 | We're going to do hooks very shortly.

01:42:09.000 | If you think about it if I want to.

01:42:14.000 | Kind of add a call back after I calculate the forward pass of the second layer of my model there's no way for me to do that right because the point at which I do the forward pass.

01:42:29.000 | Looks like this.

01:42:31.000 | Self dot model.

01:42:33.000 | Or if I want to hook into the point at which I've just called the backward pass if my penultimate layer I can't do that either because the whole thing appears here is self lost a backward.

01:42:44.000 | So hawks pie torch hawks are callbacks that you can add to specific pie torch modules.

01:42:53.000 | And we're going to see them in very shortly.

01:42:57.000 | Might be next class we'll see how we go.

01:43:01.000 | Okay so.

01:43:06.000 | Very often you want to be able to inject behavior into something but the different things can influence each other for example transformations we're going to be seeing this when we do data data augmentation so quite often you'll need things to run in a particular order.

01:43:24.000 | So when I add this kind of injectable behavior like callbacks I like to just add something which is what order should it run in.

01:43:34.000 | You don't have to put this here you might have noticed that what I do when I call this.

01:43:40.000 | Is I.

01:43:42.000 | This currently does sorry actually when we look at transformations it won't require order this one does require an order so.

01:43:49.000 | Yeah okay so your callbacks need to be something that have an underscore order attribute in them and this way we can make sure that some things run after other things so for example you might have noticed that our.

01:44:04.000 | Our runner in the fit function never calls model dot eval never calls model dot train so like it literally doesn't do anything you know it just.

01:44:14.000 | Says these are the steps I have to run and the callbacks do the running.

01:44:19.000 | So I created a train eval call back.

01:44:23.000 | That at the beginning of an epoch calls model dot train and the beginning of validation calls model dot eval and I also added stuff to keep track of how many epochs has it done and this is quite nice it actually does it as a floating point not just as an end so you could be like 2.3 epochs in.

01:44:44.000 | It also keeps track of how many iterations do you want so now we have this thing keeping track of iterations test call back that should stop training after 10 iterations.

01:44:55.000 | Rather than keeping track of and it is itself it should just use the end it a.

01:45:02.000 | That was defined in this call back so what we can do is we can say all right well train eval call back has an order of 0 because it inherits.

01:45:13.000 | So what we can just do here is make sure that this is later underscore order.

01:45:18.000 | Equals one.

01:45:21.000 | And so that way we can now refer to stuff that's inside the train eval call back like an inner.

01:45:31.000 | Sorry actually we don't even need to do that because it's putting an inner inside self dot run.

01:45:37.000 | So we can just go self dot and it if we if our order if this ran before train eval call back that would be a problem because and it might not have been.

01:45:47.000 | Updated yet.

01:45:50.000 | So that's what the orders for.

01:45:54.000 | Another nice thing about runner.

01:46:01.000 | So a nice thing about class call back.

01:46:06.000 | Is that I have to find dunder get atra.

01:46:09.000 | And I have to find it to say return.

01:46:12.000 | Get atra self dot run comma K.

01:46:16.000 | An important thing to know about dunder get atra is that it is only called by Python if it can't find the attribute that you've asked for.

01:46:25.000 | So if something asks for self dot name well I have self dot name so it's never going to get to here.

01:46:31.000 | So if you get to here it means python look for this attribute and it couldn't find it.

01:46:36.000 | And so.

01:46:38.000 | Very very often the thing you actually want in the call back is actually inside the runner.

01:46:45.000 | Which restore away is self dot run so this means that in all of our callbacks let's look at one.

01:46:54.000 | You can basically just use self dot pretty much everything and it will grab what you want.

01:47:01.000 | Even though most of the stuff you want is inside the runner so you'll see this.

01:47:06.000 | Pattern in fast AI a lot is that when one object.

01:47:12.000 | Contains another object or composes another object we very often delegate.

01:47:17.000 | Get attribute to the other object so for example if you're looking at.

01:47:23.000 | A data set then I think we delegate to.

01:47:28.000 | X if you're looking at a.

01:47:31.000 | Stuff in the data box API will often delegate to stuff lower in the data box API and so forth.

01:47:38.000 | So I find this pretty handy.

01:47:42.000 | OK so we have a call back that as you see this very little to it one interesting thing you might notice is that a call back has a name property.

01:47:53.000 | And the name property.

01:47:56.000 | Works like this if you have a property called train eval call back.

01:48:00.000 | Then we've got a function called camel to snake this is called camel case means you got uppercase and lowercase letters like a camel.

01:48:08.000 | And snake case looks like this so camel to snake turns this into a snake.

01:48:13.000 | And then what we do here is we remove call back from the end.

01:48:20.000 | And that's its name so train eval call back has a name which is just train eval underscore and then in the runner.

01:48:28.000 | Any call back functions that you pass in.

01:48:32.000 | Which it uses to create new callbacks it actually assigns them to an attribute with that name so we now have something called.

01:48:43.000 | Runner dot train eval for example so we do this in the faster library when you say learned recorder we didn't actually add an attribute called recorder to learner it just automatically sets that because there's a learner call back.

01:49:01.000 | So.

01:49:03.000 | So let's see how to use this.

01:49:07.000 | As a question okay let's do that in a moment so.

01:49:12.000 | Let's use this to add metrics because it's no fun having a training loop where we can't actually see how we're going and part of the whole point of this is that our actual training loop is now.

01:49:22.000 | So incredibly tight and neat and easy but we actually want to do all the stuff we want to do so what if we create a little call back called average stats call back.

01:49:30.000 | Where we're going to stick into it a couple of objects to keep track of our loss and metrics one for training one for valid and at the start of an epoch will reset the statistics at the end of an epoch will print out the statistics.

01:49:47.000 | And after we've got the loss calculated.

01:49:51.000 | We will accumulate the statistics so then all we need is an object that has an accumulate method.

01:49:59.000 | So let's create a class that does that and here's our accumulate method.

01:50:05.000 | It's going to add up the total loss.

01:50:08.000 | And for each metric.

01:50:11.000 | It'll add up the total metrics.

01:50:14.000 | And then we'll give it a property called average stats that will go through all of those losses and metrics and return.

01:50:21.000 | The average and you might notice here I fixed the problem of having different batch sizes in the average we're actually adding lost times the size of the batch and count plus the size of the batch and metrics times the size of the batch and so then we're dividing here by the total.

01:50:40.000 | Batch size so this is going to keep track of our stats will add a dunder Repra so that it prints out those statistics in a nice way.

01:50:52.000 | And so now we can create a learner.

01:50:56.000 | And our average stats call back and when we call fit.

01:51:10.000 | Metrics and loss tracking to our minimal training loop.

01:51:17.000 | Runner dunder call exits early when the first call back returns true why is that.

01:51:29.000 | So one of the things I noticed was really annoying in the first way I wrote the call back handler was I had it so that.

01:51:41.000 | Something had to return something had to return true to mean keep going so basically false meant stop and that was really awkward because if you don't add a return in in python that it actually returns none and none is false and I thought oh if I forget to return something that should mean keep going that should be like the default so.

01:52:06.000 | The first thing to point out is that the basic lope now.

01:52:12.000 | Actually says if not rather than if right so if not begin a park so in other words if if your call back handler returns false then keep going and so that means that basically none of my callbacks.

01:52:29.000 | Need to return anything most of the time except for test call back which returns true so true means cancel means stop.

01:52:43.000 | So if one of my callbacks says stop.

01:52:49.000 | Then I mean I could I could certainly imagine an argument in either way that but the way I thought it if it says stop.

01:52:58.000 | Let's just stop right now you know why do we need to run the other callbacks so if it says stop then it returns stop says we don't want to go anymore and then we can depending on where you are so if it's after a park returns stop and it's actually going to stop the loop.

01:53:17.000 | Entirely.

01:53:19.000 | So that's why.

01:53:23.000 | Yeah, so this is a little awkward we had to like construct our average stats call back and then we had to pass that to run and then later on we can refer to stats valid stats average stats because remember average stats was where we grab this.

01:53:43.000 | So that's OK, but it's a little awkward so instead what I do is I create a accuracy call back function.

01:53:53.000 | So that is.

01:53:55.000 | The average stats call back constructor passing an accuracy.

01:54:01.000 | But with partial so partial returns is a function that returns a function.

01:54:07.000 | And so this is now a function which can create a call back and so I can pass this to CB funks and now I don't have to store it away because the runner.

01:54:21.000 | This is what we saw before the runner will go through each CB funks it will call that function to create the call back and then it will stick that call back inside the runner giving it this name as the attribute.

01:54:37.000 | So this way we can say.

01:54:43.000 | This is our call back function. This is our runner fit and now it's automatically available inside run dot average stats so so this is what faster IV one does except it puts them inside a winner because we don't have a runner concept.

01:55:00.000 | So I think that's pretty handy it's kind of like it looks a little bit awkward the first time you do it but you can kind of create a standard set of.

01:55:08.000 | Call back functions that you want to use for particular types of models and then you can just store them away in a list and you don't have to think about them again which is what you'll see will do lots of times.

01:55:21.000 | So. How like a lot of things in this part 2 of the course you can choose how deep to go on different things I think our approach to callbacks is super interesting and if you do too you might want to go deep here and really look into like.

01:55:40.000 | You know what kind of callbacks you can build and what things you can do with them that we haven't done yet but you know then a lot of these details around.

01:55:48.000 | Exactly how I do this if you're not as interested in the details of software engineering this might be something you care less about which is fine.

01:55:57.000 | The main thing that everybody should take away is.

01:56:01.000 | That that's our training loop.

01:56:04.000 | Okay. So you know the other stuff about like exactly how did we create our average stats call back and exactly what is done to call do a fairly minor details but you should recognize that the fit function.

01:56:22.000 | Stores how many epochs we're doing what learner we're working with.

01:56:27.000 | Calls each of the different callbacks at each time right and it and like I never remember which ones are at which place if you go to docs.fast.ai the callbacks documentation will show you personally I just always look at the source code because it's just so easy to see exactly what happens at each time and exactly what's available.

01:56:51.000 | At each time.

01:56:54.000 | So let's use this.

01:56:58.000 | And let's use this to do one cycle training.

01:57:03.000 | Because it's pretty hard when you have to have a constant learning rate all the time particularly because I was really wanting to show you.

01:57:13.000 | A deep dive which about to see using hooks a deep dive into how.

01:57:19.000 | The mechanics or kind of how the dynamics of training models looks like and what we'll learn is that the first batches everything if you can get the first batches working well then things will tend to be things are going to be good and this is how you can get super convergence.

01:57:37.000 | So if you want your first batches to be good it turns out that good annealing is critical.

01:57:44.000 | So let's do that right away let's set up good annealing because we have the mechanics we need because we have callbacks so we're inside of five and Neil.

01:57:54.000 | Get our data this is all the same as before here's something to create a learner with one line.

01:57:59.000 | So let's create a learner with that same little model we had before and lost function data and we'll create a runner.

01:58:08.000 | With a average stats call back this defaulted to a learning rate of point five maybe we could try it with learning rate of point three.

01:58:18.000 | Pretty handy being able to like quickly create things with different learning rates so let's create a function that's just going to be partial get model with a learning rate.

01:58:28.000 | And so now we can just call get model funk and pass a learning rate in and we'll immediately have something with a different learning rate.

01:58:36.000 | Yes tell me the question.

01:58:41.000 | So what is your typical debugging process.

01:58:46.000 | My debugging process is to use the debugger so if I got an exception while I was running a cell then I just go into the next cell and type percent debug.

01:58:58.000 | And that pops open the debugger if things aren't working the way I expected but it wasn't an exception then I'll just add set underscore trace somewhere around the point I care about.

01:59:09.000 | That's about it yeah I find that's.

01:59:14.000 | That works pretty well.

01:59:17.000 | Most of the time then it's just a case of looking at what's it what's the shape of everything and what is everything contain like a couple of couple of objects in the batch I normally find something's got names or zeros or whatever.

01:59:32.000 | Yeah it's really rare that using that debugger that I find debugging is that difficult if it is then it's just a case of stepping away and questioning your assumptions but with the help of a debugger.

01:59:49.000 | All of the states right there in front of you just one of the great things about pytorch is that it supports this kind of development.

02:00:01.000 | Okay.

02:00:03.000 | All right so.

02:00:06.000 | We're going to create a call back.

02:00:11.000 | That's going to do.

02:00:14.000 | Hyper parameter scheduling.

02:00:16.000 | And so for this notebook we're just going to do learning rate as a hyper parameter but it's in the last 12 months one of the really successful areas of research have been people pointing out that.

02:00:30.000 | You can you can and should schedule everything your dropout amount what kind of data augmentation you do weight decay.

02:00:40.000 | Learning rate momentum everything which makes sense right because the other thing that we've been learning about a lot about in the last 12 months is how as you train a model it kind of goes through this different phases of like that the.

02:00:56.000 | The kind of weight landscapes the sorry the lost function the lost landscapes of neural nets look very different at the start in the middle and at the end.

02:01:09.000 | And so it's very unlikely that you would want the same hyper parameters throughout so being able to schedule anything is super handy.

02:01:19.000 | So we'll create a parameter schedule a call back and you're just going to pass in a function.

02:01:25.000 | Right and a parameter schedule so we're going to be passing in lr cuz lr is what pytorch calls learning rate and then this function will be something which takes a single argument.

02:01:38.000 | Which is.

02:01:40.000 | Number of epochs divided by total epochs remember I told you that that train eval call back we added is going to set this to be a float so this will be the number of this will be like epoch number 2.35.

02:01:53.000 | Out of 6 so this will be a float of exactly how far through training are we and we'll pass that to some function that we're going to write and the result of that function will be used to set.

02:02:05.000 | The hyper parameter in this case learning rate.

02:02:09.000 | As you know from part one.

02:02:12.000 | You don't necessarily want to have the same value of a hyper parameter for all of your layers.

02:02:17.000 | So pytorch has something called.

02:02:19.000 | Parameter groups which we use an abstraction we call layer groups in fast AI but they're basically the same thing.

02:02:27.000 | And so a pytorch optimizer contains a number of parameter groups unless you explicitly create more than one it'll all be in one but anytime we do stuff with hyper parameters you have to loop through.

02:02:42.000 | Pg in self dot opt dot parameter groups.

02:02:45.000 | So then parameter group so learning rate for this parameter group this layer group.

02:02:51.000 | Is equal to the result of this function.

02:02:54.000 | And then every time we start a new batch.

02:02:58.000 | If we're training.

02:03:00.000 | And we'll run our schedule.

02:03:03.000 | Pretty hard to know if our schedule is working if we can't actually see what's happening to the learning rate as we go so let's create another call back called recorder.

02:03:12.000 | That at the start of fit fitting sets the allies and losses are raised to being empty.

02:03:19.000 | And then after each batch as long as you're training it depends the current.

02:03:25.000 | Learning rate and the current loss now there's actually lots of learning rates potentially because there's lots of layer groups so in fast AI we tend to use the final layer group as a learning rate we actually.

02:03:38.000 | Point out but you don't have to do it that way and then we'll add something to plot the learning rates and we'll add something to plot the losses.

02:03:45.000 | So hopefully this looks pretty familiar compared to the recorder in faster IV one so with that in place.

02:03:51.000 | We now need to create a function that takes.

02:03:56.000 | The percentage through the learning which we're going to call pause for position and returns the value of learning rate.

02:04:05.000 | And so let's create one for linear schedules.

02:04:09.000 | So what we want to be able to pass this.

02:04:12.000 | Is a starting learning rate and an ending learning rate so you might pass it 10 and one and it was started the learning rate of 10 and go down to one that would be ridiculously high but whatever.

02:04:27.000 | But we need a function that just takes position so this is a function that's going to return a function.

02:04:34.000 | So here's a function that takes a start learning rate and an end learning rate and a position.

02:04:41.000 | And returns the learning rate so to start plus position times difference.

02:04:47.000 | So to convert that function into one which only takes position.

02:04:54.000 | We do partial passing in that function and the start and the end we were given.

02:05:00.000 | So now this function just takes position because that's the only thing from inner that we haven't set.

02:05:10.000 | So that's going to work fine but it's inconvenient because we're going to create lots of different schedule is.

02:05:17.000 | And I don't want to have to write all this every time.

02:05:20.000 | So we can simplify the way that you can create these by using a decorator.

02:05:26.000 | Here's the version with a decorator with a decorator you create.

02:05:31.000 | Linear scheduler.

02:05:33.000 | In the natural way it's something that takes a start learning rate and end learning rate and a position and returns this.

02:05:41.000 | And then we add an annealer decorator and the annealer decorator is the thing that does all this in a partial nonsense.

02:05:49.000 | What's a decorator? A decorator is a function that returns a function.

02:05:56.000 | And what Python does is if it sees the name of a function here with an at sign before it that it takes this function.

02:06:04.000 | Passes it into this function and replaces the definition of this function with whatever this returns.

02:06:11.000 | So it's going to take this.

02:06:14.000 | It's going to pass it over here.

02:06:17.000 | And then it's going to say return inner where inner is.

02:06:22.000 | Partial as we described before.

02:06:26.000 | So let's see that.

02:06:29.000 | So now shed Lynn we wrote it as taking start and end and pause, but if I hit shift tab.

02:06:39.000 | This says it only takes start and end. Why is that? Because we've replaced this function.

02:06:46.000 | With this function.

02:06:48.000 | And this function just takes start and end.

02:06:51.000 | And this is where Jupiter is.

02:06:55.000 | Going to give you a lot more happy times and pretty much any idea because this kind of dynamic.

02:07:03.000 | Code generation. It's pretty hard for an idea to do that for you.

02:07:08.000 | Where else in Jupiter. It's actually running the code in an actual Python process so it knows exactly what shed Lynn.

02:07:15.000 | Means.

02:07:17.000 | So this is now created a function that takes start.

02:07:22.000 | And end.

02:07:23.000 | And returns a function.

02:07:25.000 | Which takes.

02:07:28.000 | Which is what we need.

02:07:30.000 | For our schedule.

02:07:33.000 | So let's try it.

02:07:34.000 | Let's say f equals shed Lynn one comma two so this is a schedule that starts at learning rate one ends at learning rate two and then we'll say hey what should that be 30% of the way through training.

02:07:47.000 | And again if I hit shift tab here.

02:07:51.000 | It knows that f is something that takes pause right so it's really nice in Jupiter you can you can take advantage of.

02:07:59.000 | Python's dynamic nature.

02:08:02.000 | And like.

02:08:03.000 | There's no point using a dynamic language if you're not taking advantage of his dynamic nature right so things like.

02:08:10.000 | Decorators are super convenient way to do this stuff.

02:08:14.000 | There are other languages like Julia that can do similar things with macros like it's this is not the only way to get this kind of nice.

02:08:23.000 | A very expressive ability but it's one good way to do it.

02:08:28.000 | So now we can just go ahead and define all of our different schedule is by passing it each is start and pause.

02:08:34.000 | So for example no schedule is something which.

02:08:38.000 | Always return start or cosine scheduling.

02:08:42.000 | Exponential scheduling.

02:08:48.000 | So.

02:08:50.000 | Let's define those.

02:08:52.000 | And then let's try to plot them and it doesn't work.

02:08:56.000 | Why doesn't it work.

02:08:58.000 | Because you can't plot PyTorch tenses.

02:09:02.000 | But it turns out the only reason you can't plot PyTorch tenses is because tenses don't have an end in attribute which tells.

02:09:10.000 | Matplotlib how many dimensions there are so watch this.

02:09:15.000 | Torch dot tensor dot end in equals a property that is the length of the shape.

02:09:22.000 | And now replaced the definition again using the dynamic features of Python replace the def replace or actually insert into the definition of tensor a new property called end in.

02:09:34.000 | And now we can plot tenses.

02:09:36.000 | So like the nice thing about Python is you never have to be like oh this isn't supported because you can change everything you can insert things you can replace things whatever so.

02:09:49.000 | Here we've now got a nice print out of our four different schedule is.

02:09:56.000 | Which isn't really enough because if you want to do one cycle scheduling then in fact you know most of the time nowadays you want some kind of warm up and some kind of cool down or if you're doing something like SGDR you've got like multiple cool downs.

02:10:13.000 | So we really need to be able to paste some of these schedule is together.

02:10:18.000 | So let's create another function called combined schedule is.

02:10:23.000 | And it's going to look like this.

02:10:25.000 | We're going to pass in.

02:10:28.000 | We're going to pass in the kind of the phases we want so phase one will be a cosine schedule from a learning rate of point three to point six phase two will be a learning rate as cosine schedule with a learning rate going from point six to point two.

02:10:42.000 | And phase one will take up 30% of our batches and phase two will take up 70%.

02:10:48.000 | So that's what we're going to pass in how long is each phase and what's the schedule in each phase.

02:10:54.000 | So.

02:10:57.000 | Here's how we do that I don't think I need to go through the code it's there's nothing interesting about it.

02:11:04.000 | But what we do once we have that is that we can then plot that schedule and you can kind of see why we're very fond of these.

02:11:15.000 | Cosine one cycle schedule so I don't think this has ever been published anywhere but it's what fast AI uses by default nowadays.

02:11:25.000 | It's you kind of get a nice gentle warm up at the start and this is the time when things are just super sensitive and fall apart really quickly.

02:11:33.000 | But it doesn't take long as you'll see in next week's lesson when we do a deep dive into into stuff using hooks it doesn't take long for it to get into a decent part of the lost landscape and so you can quite quickly increase the learning rate.

02:11:48.000 | And then something that people have and we'll start looking at papers next week for this something that people have realized in the last.

02:11:55.000 | 4 months or so although Leslie Smith really kind of showed us this 2 years ago but it's only been the last 4 months or so that people have really understood this in the wider academic literature.

02:12:06.000 | You need to train at a high learning rate for a long time and so with this kind of coach cosine schedule we keep it up high for a long time.

02:12:16.000 | But then you also need to fine tune at a very low learning rate for a long time so this has all of the kind of nice features that we want so cosine one cycle schedules are terrific and we now can build them from scratch.

02:12:32.000 | So let's try training like this so with let's create a list of call back functions that has a recorder in it an average stats call back with accuracy in it and a parameter scheduler that schedules the learning rate using this schedule.

02:12:48.000 | And then fit.

02:12:51.000 | That's looking pretty good we're getting up towards 94% pretty quickly and we can now go plot lr and it's the shape that we hope for and we can even say plot loss.

02:13:05.000 | We now have.

02:13:25.000 | We still haven't looked at convolutions really will do that next week and a lot more.

02:13:35.000 | But you kind of have the ability now to hopefully think of lots of things that you might want to try and and try them out.

02:13:46.000 | So next week we're going to be starting with confidence.

02:13:56.000 | We're going to be kind of and we're going to be finally using a GPU because once we because once we start creating confidence of this size it starts taking a little bit too long.

02:14:08.000 | But just to read ahead a little bit how what's it going to take to put stuff on the CPU this is the entirety of the call back right so we've now got the mechanics we need to do things unbelievably quickly right.

02:14:24.000 | And then we'll be able to oh and also we'll be wanting to add some transformations this is the entirety of what it takes to do batch wise transformations.

02:14:34.000 | Without call back.

02:14:37.000 | As we discussed though we can't.

02:14:41.000 | Add callbacks between layers so we will add callbacks between layers initially manually and then using pytorch hooks and that way we're going to be able to plot and see exactly what's going on inside our models as they train and we'll find ways to train them.

02:15:03.000 | Much much more nicely so that by the end of next by the end of the next notebook will be up over 98% accuracy.

02:15:13.000 | And that's going to be super cool.

02:15:15.000 | And then we're going to do a deep dive into batch norm data blocks API optimizers and transforms and at that point I think we'll have basically all the mechanics we need to go into some more advanced architectures and training methods and see how we did some of the.

02:15:39.000 | Cool stuff that we did in part one so I'll see you next week.

Lesson 9 (2019) - How to train your model

Chapters