A Simple Algorithm for Maximum Margin Classification, Revisited
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 6 Jul 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Hardness of High-Dimensional Linear Classificationcited by 1
- 2026Hardness of High-Dimensional Linear Classification19 Mar 2026