Perceptron learning with random coordinate descentLi, Ling (2005) Perceptron learning with random coordinate descent. Technical Report. California Institute of Technology, Pasadena, USA. [CaltechCSTR:2005.006] Full text available as:
AbstractA perceptron is a linear threshold classifier that separates examples with a hyperplane. It is perhaps the simplest learning model that is used standalone. In this paper, we propose a family of random coordinate descent algorithms for perceptron learning on binary classification problems. Unlike most perceptron learning algorithms which require smooth cost functions, our algorithms directly minimize the training error, and usually achieve the lowest training error compared with other algorithms. The algorithms are also computational efficient. Such advantages make them favorable for both standalone use and ensemble learning, on problems that are not linearly separable. Experiments show that our algorithms work very well with AdaBoost, and achieve the lowest test errors for half of the datasets.
Archive Staff Only: edit this record |
