A Simple Algorithm for Maximum Margin Classification, Revisited

2015/07/06 by Sariel Har-Peled, Har-Peled, Sariel
Computer Science · #Algorithms and Data Compression #Machine Learning and Algorithms #Machine Learning and Data Classification #cs.LG

paper · pdf · doi:10.48550/arxiv.1507.01563

arxiv created 2015/07/06 · arxiv updated 2015/07/07

Abstract

In this note, we revisit the algorithm of Har-Peled et. al. [HRZ07] for computing a linear maximum margin classifier. Our presentation is self contained, and the algorithm itself is slightly simpler than the original algorithm. The algorithm itself is a simple Perceptron like iterative algorithm. For more details and background, the reader is referred to the original paper.

Related

• Optimal Minimal Margin Maximization with Boosting
• The Perceptron with Dynamic Margin
• The Role of Weight Shrinking in Large Margin Perceptron Learning
• On the Consistency of Max-Margin Losses
• Margins, Shrinkage, and Boosting