Winnow (algorithm) is within the scope of WikiProject Robotics, which aims to build a comprehensive and detailed guide to Robotics on Wikipedia. If you would like to participate, you can choose to edit this article, or visit the project page (Talk), where you can join the project and see a list of open tasks.
If an example is correctly classified, do nothing.
If an example is predicted to be 1 but the correct result was 0, all of the weights involved in the mistake are set to zero (demotion step).
If an example is predicted to be 0 but the correct result was 1, all of the weights involved in the mistake are multiplied by (promotion step).
Step 2 moves weights to zero, and neither of the other steps changes any weight that is zero. Because of that, I fear that this will too easily migrate towards an all-zero weights vector.
So, either explain why that will not happen, or adjust the description. —Preceding unsigned comment added by 220.127.116.11 (talk) 11:30, 19 April 2011 (UTC)
That is indeed the original (Winnow1) algorithm. Roughly, any feature that is implicated in a false positive should thereafter be ignored. I think the weights cannot all go to zero if the data is linearly separable: there will always be some instance that on the other side of the current hyperplane. And if the data is not linearly separable, all bets are off, just as with most linear classifiers. —johndburger 18:09, 6 October 2011 (UTC)