# Learning curve (machine learning)

In machine learning, a learning curve (or training curve) plots the optimal value of a model's loss function for a training set against this loss function evaluated on a validation data set with same parameters as produced the optimal function. It is a tool to find out how much a machine model benefits from adding more training data and whether the estimator suffers more from a variance error or a bias error. If both the validation score and the training score converge to a value that is too low with increasing size of the training set, it will not benefit much from more training data.

The machine learning curve is useful for many purposes including comparing different algorithms, choosing model parameters during design, adjusting optimization to improve convergence, and determining the amount of data used for training.

In the machine learning domain, there are two implications of learning curves differing in the x-axis of the curves, with experience of the model graphed either as the number of training examples used for learning or the number of iterations used in training the model.

## Formal definition

One model of a machine learning is producing a function, f(x), which given some information, x, predicts some variable, y, from training data $X_{\text{train}}$ and $Y_{\text{train}}$ . It is distinct from mathematical optimization because $f$ should predict well for $x$ outside of $X_{\text{train}}$ .

We often constrain the possible functions to a parameterized family of functions, $\{f_{\theta }(x):\theta \in \Theta \}$ , so that our function is more generalizable or so that the function has certain properties such as those that make finding a good $f$ easier, or because we have some a priori reason to think that these properties are true.: 172

Given that it is not possible to produce a function that perfectly fits out data, it is then necessary to produce a loss function $L(f_{\theta }(X),Y')$ to measure how good our prediction is. We then define an optimization process which finds a $\theta$ which minimizes $L(f_{\theta }(X_{,}Y))$ referred to as $\theta ^{*}(X,Y)$ .

### Training curve for amount of data

Then if our training data is $\{x_{1},x_{2},\dots ,x_{n}\},\{y_{1},y_{2},\dots y_{n}\}$ and our validation data is $\{x_{1}',x_{2}',\dots x_{m}'\},\{y_{1}',y_{2}',\dots y_{m}'\}$ a learning curve is the plot of the two curves

1. $i\mapsto L(f_{\theta ^{*}(X_{i},Y_{i})}(X_{i}),Y_{i})$ 2. $i\mapsto L(f_{\theta ^{*}(X_{i},Y_{i})}(X_{i}'),Y_{i}')$ where $X_{i}=\{x_{1},x_{2},\dots x_{i}\}$ ### Training curve for number of iterations

Many optimization processes are iterative, repeating the same step until the process converges to an optimal value. Gradient descent is one such algorithm. If you define $\theta _{i}^{*}$ as the approximation of the optimal $\theta$ after $i$ steps, a learning curve is the plot of

1. $i\mapsto L(f_{\theta _{i}^{*}(X,Y)}(X),Y)$ 2. $i\mapsto L(f_{\theta _{i}^{*}(X,Y)}(X'),Y')$ 