Regularized Winnow Methods

In theory, the Winnow multiplicative update has certain advantages over the Perceptron additive update when there are many irrelevant attributes. Recently, there has been much effort on enhancing the Perceptron algorithm by using regularization, leading to a class of linear classification methods called support vector machines. Similarly, it is also possible to apply the regularization idea to the Winnow algorithm, which gives methods we call regularized Winnows. We show that the resulting methods compare with the basic Winnows in a similar way that a support vector machine compares with the Perceptron. We investigate algorithmic issues and learning properties of the derived methods. Some experimental results will also be provided to illustrate different methods.

• Type: Conference
• Year: 2000
• Where: NIPS
• Authors: Tong Zhang
• Keywords: NIPS 2000, NIPS 2007, Perceptron Additive Update, Support Vector Machine, Winnow Multiplicative Update