The perceptron: mistake-driven learning and its bound
How the perceptron learns a linear classifier from its mistakes alone, and why on separable data it stops within (R/γ)² mistakes.
Part of Linear classifiers.
Read next
- Maximum margin: the hard-margin SVM's widest street
How a hard-margin support vector machine (SVM) picks the separating line with the widest margin, 2/‖w‖, and why only its support vectors decide it.