Hinge loss

In machine learning, the hinge loss is a loss function used for training classifiers. The hinge loss is used for "maximum-margin" classification, most notably for support vector machines (SVMs).

For an intended output and a classifier score , the hinge loss of the prediction is defined as

:$\ell(y) = \max(0, 1-t \cdot y)$

Note that $y$ should be the "raw" output of the classifier's decision function, not the predicted class label. For instance, in linear SVMs, $y = \mathbf \cdot \mathbf + b$, where $(\mathbf,b)$ are the parameters of the hyperplane and $\mathbf$ is the input variable(s).

When and have the same sign (meaning predicts the right class) and $, y, \ge 1$, the hinge loss $\ell(y) = 0$. When they have opposite signs, $\ell(y)$ increases linearly with , and similarly if $, y, < 1$, even if it has the same sign (correct prediction, but not by enough margin).

Extensions

While binary SVMs are commonly extended to multiclass classification in a one-vs.-all or one-vs.-one fashion,
it is also possible to extend the hinge loss itself for such an end. Several different variations of multiclass hinge loss have been proposed. For example, Crammer and Singer
defined it for a linear classifier as

:$\ell(y) = \max(0, 1 + \max_ \mathbf_y \mathbf - \mathbf_t \mathbf)$

Where $t$ the target label, $\mathbf_t$ and $\mathbf_y$ the model parameters.

Weston and Watkins provided a similar definition, but with a sum rather than a max:

:$\ell(y) = \sum_ \max(0, 1 + \mathbf_y \mathbf - \mathbf_t \mathbf)$

In structured prediction, the hinge loss can be further extended to structured output spaces. Structured SVMs with margin rescaling use the following variant, where denotes the SVM's parameters, the SVM's predictions, the joint feature function, and the Hamming loss:

:$\begin \ell(\mathbf) & = \max(0, \Delta(\mathbf, \mathbf) + \langle \mathbf, \phi(\mathbf, \mathbf) \rangle - \langle \mathbf, \phi(\mathbf, \mathbf) \rangle) \\ & = \max(0, \max_ \left( \Delta(\mathbf, \mathbf) + \langle \mathbf, \phi(\mathbf, \mathbf) \rangle \right) - \langle \mathbf, \phi(\mathbf, \mathbf) \rangle) \end$

Optimization

The hinge loss is a convex function, so many of the usual convex optimizers used in machine learning can work with it. It is not differentiable, but has a subgradient with respect to model parameters of a linear SVM with score function $y = \mathbf \cdot \mathbf$ that is given by

:$\frac = \begin -t \cdot x_i & \text t \cdot y < 1 \\ 0 & \text \end$

However, since the derivative of the hinge loss at $ty = 1$ is undefined, smoothed versions may be preferred for optimization, such as Rennie and Srebro's

:$\ell(y) = \begin \frac - ty & \text ~~ ty \le 0, \\ \frac (1 - ty)^2 & \text ~~ 0 < ty < 1, \\ 0 & \text ~~ 1 \le ty \end$

or the quadratically smoothed

:$\ell_\gamma(y) = \begin \frac \max(0, 1 - ty)^2 & \text ~~ ty \ge 1 - \gamma \\ 1 - \frac - ty & \text \end$

suggested by Zhang. The modified Huber loss $L$ is a special case of this loss function with $\gamma = 2$, specifically $L(t,y) = 4 \ell_2(y)$.

See also

*

References

{{Reflist

Loss functions
Support vector machines