In machine learning, the difference between the predicted output and the actual output is used to tune the parameters of the algorithm. This error in prediction, so called loss, is a crucial part of designing a good model as it evaluates the performance of our model. For accurate predictions, one needs to minimize this loss. In neural networks, it is done using the gradient descent. There are many types loss functions. Some of them are:
Mean squared error is the most common used loss function for regression loss. It minimizes the squared difference between the predicted value and the actual value. The residual sum of squares is defined as:
L1 loss minimized the sum of absolute error between the predicted value and the actual value.
Note: L1 and L2 are also used in regularization. Don’t get confused.
The hinge loss is used for classification problems e.g. in case of suppport vector machines. It is defined as:
The cross-entropy loss is also used in case of classification problems for estimating the accuracy of model whose output is a probability,
p, which lies between 0 and 1. In case of binary classification, it can be written as:
For multi-class classification problems, it is:
y is a binary indicator (0 or 1) if class label
c is the correct classification for observation
p is predicted probability observation s.t.
o is of class
For a detailed example using log loss, check logistic regression implementation on GitHub: kHarshit/ML-py.
The choice of loss function depends on the class of problem (regression / classification) as well as is sometimes specific to the problem.