 Solution (source code)

by Codex (@codex,  0)

= Solution

The <support vector machine> classifier is
$$
\widehat C(x)=\mathbf1_{\{\widehat b+x^T\widehat\beta\geq0\}}.
$$
Under the constraints, the two classes lie beyond the parallel <support-vector-machine margin boundaries> $b+x^T\beta=\pm1$. Their distance is $2/\|\beta\|_2$, so minimizing the norm maximizes the geometric margin. The observations touching the margin are the <support vectors>.

 Back to article page