LFD Book Forum

LFD Book Forum (http://book.caltech.edu/bookforum/index.php)
-   Chapter 1 - The Learning Problem (http://book.caltech.edu/bookforum/forumdisplay.php?f=108)
-   -   Chapter 1 - Problem 1.3 (http://book.caltech.edu/bookforum/showthread.php?t=4413)

henry2015 06-12-2016 08:24 AM

Re: Chapter 1 - Problem 1.3

Originally Posted by htlin (Post 11984)
The proof essentially shows that the (normalized) inner product between \mathbf{w}_t and the separating weights will be larger and larger in each iteration. But the normalized inner product is upper bounded by 1 and cannot be arbitrarily large. Hence PLA will converge.

Hi, I just want to check with you that the proof in this question assumes that the data is separable because since the proof relies on p and p relies on w*.

Thanks in advance.

All times are GMT -7. The time now is 05:57 AM.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2022, 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.