![]() |
Pocket Algorithm
Hi, all, i am currently coding pocket algorithm. However, since we are using it on a non-separable data, the PLA is never going to converge and thus run into infinite loops. Do i just set a break point or it there any other stoping conditions?
|
Re: Pocket Algorithm
AND BTW, hw1 specifies that we could only use the training data, but the first problem asks us to plot the train data and test set data.
|
Re: Pocket Algorithm
As I understand it, the idea of the pocket algorithm is that you save the best weights, and stop at an arbitrary point, say after 10,000 iterations. Then return that best weight. I think part1 of the homework is saying that you are only supposed to train off the training set, but then plot both sets with the separator.
|
All times are GMT -7. The time now is 07:11 PM. |
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.