The geometric margin
ProofFoundation⏱ 15 minClassical MLsvmmargingeometrydistance
Problem
Derive the distance from a point to the hyperplane , and explain why the objective is invariant under while the numerator alone is not.
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| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| Solve a two-point SVM by hand | Classical ML | Numerical | 30 min | ||
| The geometry of l1 versus l2 constraints | High-Dim Statistics | Proof | 30 min | ||
| The soft-margin SVM is regularised hinge-loss minimisation | Classical ML | Proof | 30 min | ||
| Rademacher complexity of a norm-bounded linear class | Learning Theory | Proof | 30 min | ||
| The three regimes of a training point | Classical ML | Proof | 30 min |