Statistical learning theory

Introduction

The goal of learning is prediction. Learning falls into many categories, including supervised learning, unsupervised learning, online learning, and reinforcement learning. From the perspective of statistical learning theory, supervised learning is best understood.^[3] Supervised learning involves learning from a training set of data. Every point in the training is an input-output pair, where the input maps to an output. The learning problem consists of inferring the function that maps between the input and the output in a predictive fashion, such that the learned function can be used to predict output from future input.

Depending of the type of output, supervised learning problems are either problems of regression or problems of classification. If the output takes a continuous range of values, it is a regression problem. Using Ohm's Law as an example, a regression could be performed with voltage as input and current as output. The regression would find the functional relationship between voltage and current to be $\frac{1}{R}$ , such that

I = \frac{1}{R} V

Classification problems are those for which the output will be an element from a discrete set of labels. Classification is very common for machine learning applications. In facial recognition, for instance, a picture of a person's face would be the input, and the output label would be that person's name. The input would be represented by a large multidimensional vector whose elements represent pixels in the picture.

After learning a function based on the training set data, that function is validated on a test set of data, data that did not appear in the training set.

Formal Description

Take $X$ to be the vector space of all possible inputs, and $Y$ to be the vector space of all possible outputs. Statistical learning theory takes the perspective that there is some unknown probability distribution over the product space $Z = X \otimes Y$ , i.e. there exists some unknown $p(z) = p(\vec{x},y)$ . The training set is made up of $n$ samples from this probability distribution, and is notated

S = \{(\vec{x}_1,y_1), \dots ,(\vec{x}_n,y_n)\} = \{\vec{z}_1, \dots ,\vec{z}_n\}

Every $\vec{x}_i$ is an input vector from the training data, and $y_i$ is the output that corresponds to it.

In this formalism, the inference problem consists of finding a function $f: X \mapsto Y$ such that $f(\vec{x}) \sim y$ . Let $\mathcal{H}$ be a space of functions $f: X \mapsto Y$ called the hypothesis space. The hypothesis space is the space of functions the algorithm will search through. Let $V(f(\vec{x}),y)$ be the loss functional, a metric for the difference between the predicted value $f(\vec{x})$ and the actual value $y$ . The expected risk is defined to be

I[f] = \displaystyle \int_{X \otimes Y} V(f(\vec{x}),y) p(\vec{x},y) d\vec{x} dy

The target function, the best possible function $f$ that can be chosen, is given by the $f$ that satisfies

\inf_{f \in \mathcal{H}} I[f]

Because the probability distribution $p(\vec{x},y)$ is unknown, a proxy measure for the expected risk must be used. This measure is based on the training set, a sample from this unknown probability distribution. It is called the empirical risk

I_S[f] = \frac{1}{n} \displaystyle \sum_{i=1}^n V( f(\vec{x}_i),y_i)

A learning algorithm that chooses the function $f_S$ that minimizes the empirical risk is called empirical risk minimization.

Loss Functions

The choice of loss function is a determining factor on the function $f_S$ that will be chosen by the learning algorithm. The loss function also affects the convergence rate for an algorithm. It is important for the loss function to be convex.^[4]

Different loss functions are used depending on whether the problem is one of regression or one of classification.

Regression

The most common loss function for regression is the square loss function. This familiar loss function is used in ordinary least squares regression. The form is:

V(f(\vec{x}),y) = (y - f(\vec{x}))^2

The absolute value loss is also sometimes used:

V(f(\vec{x}),y) = |y - f(\vec{x})|

Classification

Main article: Statistical classification

In some sense the 0-1 indicator function is the most natural loss function for classification. It takes the value 0 if the predicted output is the same as the actual output, and it takes the value 1 if the predicted output is different from the actual output. For binary classification with $Y = \{-1, 1\}$ , this is:

V(f(\vec{x},y)) = \theta(- y f(\vec{x}))

where $\theta$ is the Heaviside step function.

Regularization

This image represents an example of overfitting in machine learning. The red dots represent training set data. The green line represents the true functional relationship, while the blue line shows the learned function, which has fallen victim to overfitting.

In machine learning problems, a major problem that arises is that of overfitting. Because learning is a prediction problem, the goal is not to find a function that most closely fits the (previously observed) data, but to find one that will most accurately predict output from future input. Empirical risk minimization runs this risk of overfitting: finding a function that matches the data exactly but does not predict future output well.

Overfitting is symptomatic of unstable solutions; a small perturbation in the training set data would cause a large variation in the learned function. It can be shown that if the stability for the solution can be guaranteed, generalization and consistency are guaranteed as well.^[5]^[6] Regularization can solve the overfitting problem and give the problem stability.

Regularization can be accomplished by restricting the hypothesis space $\mathcal{H}$ . A common example would be restricting $\mathcal{H}$ to linear functions: this can be seen as a reduction to the standard problem of linear regression. $\mathcal{H}$ could also be restricted to polynomial of degree $p$ , exponentials, or bounded functions on L1. Restriction of the hypothesis space avoids overfitting because the form of the potential functions are limited, and so does not allow for the choice of a function that gives empirical risk arbitrarily close to zero.

One example of regularization is Tikhonov regularization. This consists of minimizing

\frac{1}{n} \displaystyle \sum_{i=1}^n V(f(\vec{x}_i,y_i)) + \gamma \|f\|_{\mathcal{H}}^2

where $\gamma$ is a fixed and positive parameter, the regularization parameter. Tikhonov regularization ensures existence, uniqueness, and stability of the solution.^[7]

References

↑ Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar (2012) Foundations of Machine Learning, The MIT Press ISBN 9780262018258.
↑ Gagan Sidhu, Brian Caffo. Exploiting pitcher decision-making using Reinforcement Learning. Annals of Applied Statistics
↑ Tomaso Poggio, Lorenzo Rosasco, et al. Statistical Learning Theory and Applications, 2012, Class 1
↑ Rosasco, L., Vito, E.D., Caponnetto, A., Fiana, M., and Verri A. 2004. Neural computation Vol 16, pp 1063-1076
↑ Vapnik, V.N. and Chervonenkis, A.Y. 1971. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications Vol 16, pp 264-280.
↑ Mukherjee, S., Niyogi, P. Poggio, T., and Rifkin, R. 2006. Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization. Advances in Computational Mathematics. Vol 25, pp 161-193.
↑ Tomaso Poggio, Lorenzo Rosasco, et al. Statistical Learning Theory and Applications, 2012, Class 2

This article is issued from Wikipedia - version of the Tuesday, December 29, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.