Perceptron learning on separable data
alignment with the true normal

Perceptron Mistake Bound: Margin, Radius and Weight Vector Convergence (2D)

Train a perceptron on linearly separable points and watch its weight vector turn toward the true separator after every mistake. The Novikoff theorem says the number of mistakes can never exceed (R/gamma)^2, where R is the data radius and gamma the margin. Change the margin, radius, number of points and separator angle, with checks of the proof inequalities, rotation and scaling invariance built in. A Blender-built pegboard.

Made with 🟠 Blender