2008/05/18 by C. Panagiotakopoulos, Constantinos Panagiotakopoulos, Panagiotakopoulos, Constantinos +2
Computer Science · #FOS: Computer and information sciences #Image Retrieval and Classification Techniques #Machine Learning (cs.LG) #Neural Networks and Applications #cs.LG
paper · pdf · doi:10.48550/arxiv.0805.2752
18 pages
arxiv created 2008/05/18 · openalex publication_date 2008/05/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (despite its) sharing the same update rule with the Perceptron, is shown in an incremental setting to converge in a finite number of updates to solutions possessing any desirable fraction of the maximum margin. Experiments comparing the Margitron with decomposition SVMs on tasks involving linear kernels and 2-norm soft margin are also reported.