![]() |
Positive rays, Positive Intervals, Convex sets and the growth function
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: https://dl.dropboxusercontent.com/u/...ositiveray.png If this is possible (the rotation), then wouldn't the growth function for linearly separable data with perceptrons be limited to ![]() |
Re: Positive rays, Positive Intervals, Convex sets and the growth function
Quote:
Stay safe. |
All times are GMT -7. The time now is 11:38 AM. |
Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.