We study the binary classification problem with hinge loss. We consider classifiers that are linear combinations of base functions. Instead of an penalty, which is used by the support vector machine, we put an penalty on the coefficients. Under certain conditions on the base functions, hinge loss with this complexity penalty is shown to lead to an oracle inequality involving both model complexity and margin.
"Classifiers of support vector machine type with \ell1 complexity regularization." Bernoulli 12 (6) 1045 - 1076, dec 2006. https://doi.org/10.3150/bj/1165269150