Solve a two-point SVM by hand

NumericalBeginner⏱ 30 minClassical MLsvmworked exampledualmargin

Theory: Support Vector Machines — Complete Derivation →

Problem

Let $x_1 = (0,0)$ with $y_1=-1$ and $x_2 = (2,0)$ with $y_2=+1$ . Solve the hard-margin SVM completely: find $\alpha^\star$ , $w^\star$ , $b^\star$ , the margin, and verify the KKT conditions.

Compute the requested quantities and say what they mean. A number without an interpretation is not an answer.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems

Problem	Field	Type	Difficulty	Time
The geometric margin	Classical ML	Proof	Foundation	15 min
The soft-margin SVM is regularised hinge-loss minimisation	Classical ML	Proof	Intermediate	30 min
Rademacher complexity of a norm-bounded linear class	Learning Theory	Proof	Advanced	30 min
The three regimes of a training point	Classical ML	Proof	Advanced	30 min
Derive the hard-margin SVM dual abyss	Classical ML	Proof	Graduate	3 hours