1. Tubelator AI
  2. >
  3. Videos
  4. >
  5. People & Blogs
  6. >
  7. Lecture 23 NOC

Lecture 23 NOC

Available In Following Subtitles
English
Variant 1
Posted on:
tubelator logo

Instantly generate YouTube summary, transcript and subtitles!

chrome-icon Install Tubelator On Chrome

Video Summary & Chapters

No chapters for this video generated yet.

Video Transcript

0:16
Suppose I have some data which is not linearly separable right so that is the problem that
0:21
we had with perceptrons right so what happens if the data is not linearly separable perceptrons
0:26
do not converge so can we tweak our objective function that we have here to make sure that
0:32
we can handle non-linearly separable data is that right way of saying it.
0:45
to say non-linearly separable data was my question yeah linearly inseparable data right
0:52
so you have to be careful where you put the not the negation there right so what we do
0:57
in this case yeah somebody had the suggestion yeah so how will you do this right so there
1:12
are many ways there are many choices you can make right let me not play around with it
1:16
there are many choices you could make but there is one particular choice which is seems
1:21
to yield a very nice optimization formulation okay.
1:24
So what is the choice I am going to say that I would really like to maximize the margin
1:32
right and I would like to get as many data points correct as possible right so if you
1:39
think about it so there are a couple of things if this is the margin that I want right so
1:47
So what are the problems here well these data points are within the margin right, so I have
1:54
some data points that are within the margin so I like to minimize such cases there are
2:00
some data points that are within the margin and erroneous right I would like to minimize
2:07
such cases as well right.
2:10
If you think about it if I try to get this correct right there is a gap here and there
2:16
seems to be a gap here between the points if I try to get this correct and moved my
2:21
classification surface below then the margin would have been reduced even further right
2:25
so it is okay to get this wrong but then what about this guy is he within the margin or
2:33
outside the person within right so the margin for that class is defined on the other side
2:44
right. So the margin for that class is this side so anything to this side and X is within
2:54
the margin does it make sense right this will be yi times this right so this will actually
3:05
be negative so it is within the margin we want things to be greater than 1 yi times
3:11
f of X we want it to be greater than 1 right greater than or equal to 1 this is going to
3:16
be negative so obviously this is within the margin right make sense right so essentially
3:23
what I want to do is minimize these distances so you can see the distances I am not yet
3:48
so these distances I would like to minimize that make sense right.
3:55
So this is a certain small distance inside the margin right this is a large distance
4:00
inside the margin is a very large distance inside the margin likewise I can mark each
4:05
one of these and I want to minimize these so let us it is not terms as ?1 to ?5 and
4:21
I want to minimize those right essentially so if I minimize the sum of these deviations
4:27
I make along with my original along with my original objective function right I can handle
4:35
why do not I minimize the minimum here again that would minimize the maximum would essentially
4:51
mean that I will try to get as many things correct as possible so in this case I do not
4:56
mind getting something wrong as long as the overall deviation is not does not exceed a
5:04
certain limit see that the difference between minimizing the maximum and minimizing a sum
5:11
is that I might as well give up all of the sum to a single data point it might be something
5:17
that is very hard to classify right I might have one single outlier somewhere here right
5:24
let us draw this data might be perfectly separable and I might have an outlier there okay.
5:33
So now if I just say okay minimize the sum of the things it is fine right but if I say
5:38
minimize the max okay then it is going to actually give me a some hyper plane somewhere
5:44
there okay.
5:51
But like I said many different formulations are possible this one actually yields a very
5:56
nice computation that is one of the reasons people use this okay.
6:06
So what I am going to do is so I am going to say that this has to be that we had already
6:29
right I am going to introduce a slack variable so it does not have to be greater than M it
6:42
can be some fraction lesser also right M is what I would really like but I allow it to
6:50
have a slack right ideally I would want most of these ? is to be ? is to be 0 right I want
shape-icon

Download extension to view full transcript.

chrome-icon Install Tubelator On Chrome