Vapnik’s radius–margin bound
Theorem taught in Support vector machines, part of Statistical learning
Vapnik’s radius–margin bound
| Type | Theorem |
| Taught in | Support vector machines |
| Part | Statistical learning |
For points in a fixed ball of diameter D in \mathbb{R}^p, let h be the largest number that can be shattered by affine separators while every labelling has full geometric margin at least \rho>0. The classical radius–margin bound is
h\le\min\Bigl\{\Bigl\lfloor\frac{D^2}{\rho^2}\Bigr\rfloor,\, p+1\Bigr\}.
Used in
- Taught in Support vector machines, where the derivation and examples are.
- All 10 questions on Support vector machines
See also
Linear separators and the margin · Signed distance · Hard-margin primal · Hard-margin dual · Soft-margin primal · Kernel · Distance to a hyperplane · Why maximise the margin?