![]() |
|
#1
|
|||
|
|||
![]()
Hello,
From what I understood in lecture 5 as the discussion progresses from positive rays to positive intervals to convex sets, the idea is to put an upper bound on all possible dichotomies. As convex sets, with an upper bound of ![]() Due to the political unrest in my country (Venezuela), I've not been able to get started with lecture 6 at this time, so I don't know if what I'm about to ask is addressed later on. I imagine rotating a perceptron to the point where the boundary line is horizontal and all points fall above or bellow this boundary line: ![]() If this is possible (the rotation), then wouldn't the growth function for linearly separable data with perceptrons be limited to ![]() |
#2
|
||||
|
||||
![]() Quote:
Stay safe.
__________________
Where everyone thinks alike, no one thinks very much |
![]() |
Thread Tools | |
Display Modes | |
|
|