Please use this identifier to cite or link to this item:
|Title:||The relaxed online maximum margin algorithm|
|Keywords:||Large margin classifiers|
Support vector machines
|Citation:||Li, Y., Long, P.M. (2002). The relaxed online maximum margin algorithm. Machine Learning 46 (1-3) : 361-387. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1012435301888|
|Abstract:||We describe a new incremental algorithm for training linear threshold functions: the Relaxed Online Maximum Margin Algorithm, or ROMMA. ROMMA can be viewed as an approximation to the algorithm that repeatedly chooses the hyperplane that classifies previously seen examples correctly with the maximum margin. It is known that such a maximum-margin hypothesis can be computed by minimizing the length of the weight vector subject to a number of linear constraints. ROMMA works by maintaining a relatively simple relaxation of these constraints that can be efficiently updated. We prove a mistake bound for ROMMA that is the same as that proved for the perception algorithm. Our analysis implies that the maximum-margin algorithm also satisfies this mistake bound; this is the first worst-case performance guarantee for this algorithm. We describe some experiments using ROMMA and a variant that updates its hypothesis more aggressively as batch algorithms to recognize handwritten digits. The computational complexity and simplicity of these algorithms is similar to that of perceptron algorithm, but their generalization is much better. We show that a batch algorithm based on aggressive ROMMA converges to the fixed threshold SVM hypothesis.|
|Source Title:||Machine Learning|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2018
WEB OF SCIENCETM
checked on May 7, 2018
checked on May 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.