Skip to content
nonconvexcard

The soft-margin SVM is regularised hinge-loss minimisation

ProofIntermediate⏱ 30 minClassical MLsvmhinge lossequivalenceregularisation

Problem

Prove that eliminating the slack variables turns the soft-margin primal into

min⁡w,b 12∥w∥22+C∑i[1−yi(⟨w,xi⟩+b)]+,\min_{w,b}\ \frac12\|w\|_2^2 + C\sum_i\big[1-y_i(\langle w,x_i\rangle+b)\big]_+ ,

and compare the hinge loss with the logistic and squared losses as surrogates for the zero-one loss.

Write a complete argument. Every inequality you use should be one you could state precisely.

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
SolvedProblemFieldTypeDifficultyTime
The geometric marginClassical MLProofFoundation15 min
Solve a two-point SVM by handClassical MLNumericalBeginner30 min
Why AdamW differs from Adam with L2SGDProofIntermediate30 min
From moment growth to a tail boundHigh-Dim ProbabilityProofAdvanced1 hour
The three regimes of a training pointClassical MLProofAdvanced30 min