Least Squares Support Vector Machine

Least-squares support-vector machines (LS-SVM) for statistics and in statistical modeling, are least-squares versions of support-vector machines (SVM), which are a set of related supervised learning methods that analyze data and recognize patterns, and which are used for classification and regression analysis. In this version one finds the solution by solving a set of linear equations instead of a convex quadratic programming (QP) problem for classical SVMs. Least-squares SVM classifiers were proposed by Johan Suykens and Joos Vandewalle. LS-SVMs are a class of kernel-based learning methods.

From support-vector machine to least-squares support-vector machine

Given a training set $\_^N$ with input data $x_i \in \mathbb^n$ and corresponding binary class labels $y_i \in \$, the SVM classifier, according to Vapnik's original formulation, satisfies the following conditions:

: $\begin w^T \phi (x_i ) + b \ge 1, & \text \quad y_i = +1, \\ w^T \phi (x_i ) + b \le - 1, & \text \quad y_i = -1, \end$

which is equivalent to

: y_i \left \right\ge 1,\quad i = 1, \ldots, N,

where $\phi(x)$ is the nonlinear map from original space to the high- or infinite-dimensional space.

Inseparable data

In case such a separating hyperplane does not exist, we introduce so-called slack variables $\xi_i$ such that

: \begin
y_i \left \right\ge 1 - \xi _i , & i = 1, \ldots, N, \\
\xi _i \ge 0, & i = 1, \ldots, N.
\end

According to the structural risk minimization principle, the risk bound is minimized by the following minimization problem:

: $\min J_1 (w,\xi )=\fracw^T w + c\sum\limits_^N \xi_i ,$

: \text \begin
y_i \left \right\ge 1 - \xi _i , & i = 1, \ldots, N, \\
\xi _i \ge 0, & i = 1, \ldots ,N ,
\end

To solve this problem, we could construct the Lagrangian function:

:$L_1(w,b,\xi,\alpha,\beta)=\fracw^T w + c\sum\limits_^N - \sum\limits_^N \alpha_i \left\ - \sum\limits_^N \beta_i \xi_i,$

where $\alpha_i \ge 0,\ \beta _i \ge 0\ (i = 1, \ldots, N)$ are the Lagrangian multipliers. The optimal point will be in the saddle point of the Lagrangian function, and then we obtain

: $\begin \frac = 0\quad \to \quad w = \sum\limits_^N \alpha _i y_i \phi (x_i ) ,\\ \frac = 0\quad \to \quad \sum\limits_^N \alpha _i y_i = 0 ,\\ \frac = 0\quad \to \quad 0 \le \alpha _i +\beta_i \le c,\;i = 1, \ldots ,N . \end$

By substituting $w$ by its expression in the Lagrangian formed from the appropriate objective and constraints, we will get the following quadratic programming problem:

: $\max Q_1(\alpha) = -\frac\sum\limits_^N + \sum\limits_^N \alpha_i,$

where $K(x_i ,x_j ) = \left\langle \phi (x_i ), \phi (x_j) \right\rangle$ is called the kernel function. Solving this QP problem subject to constraints in (8), we will get the hyperplane in the high-dimensional space and hence the classifier in the original space.

Least-squares SVM formulation

The least-squares version of the SVM classifier is obtained by reformulating the minimization problem as

: $\min J_2(w,b,e) = \frac w^T w + \frac\sum\limits_^N e_i^2,$

subject to the equality constraints

: y_i \left \right= 1 - e_ ,\quad i = 1, \ldots ,N .

The least-squares SVM (LS-SVM) classifier formulation above implicitly corresponds to a regression interpretation with binary targets $y_i = \pm 1$.

Using $y_i^2 = 1$, we have

: $\sum\limits_^N e_i^2 = \sum\limits_^N (y_i e_i)^2 = \sum\limits_^N e_i^2 = \sum\limits_^N \left( y_i - (w^T \phi(x_i) + b) \right)^2,$

with $e_i = y_i - (w^T \phi(x_i) + b).$ Notice, that this error would also make sense for least-squares data fitting, so that the same end results holds for the regression case.

Hence the LS-SVM classifier formulation is equivalent to

: $J_2(w,b,e) = \mu E_W + \zeta E_D$

with $E_W = \frac w^T w$ and $E_D = \frac \sum\limits_^N e_i^2 = \frac \sum\limits_^N \left(y_i - (w^T \phi(x_i) + b) \right)^2.$

Both $\mu$ and $\zeta$ should be considered as hyperparameters to tune the amount of regularization versus the sum squared error. The solution does only depend on the ratio $\gamma = \zeta / \mu$, therefore the original formulation uses only $\gamma$ as tuning parameter. We use both $\mu$ and $\zeta$ as parameters in order to provide a Bayesian interpretation to LS-SVM.

The solution of LS-SVM regressor will be obtained after we construct the Lagrangian function:

: $\begin L_2 (w,b,e,\alpha )\; = J_2 (w,e) - \sum\limits_^N \alpha _i \left\ ,\\ \quad \quad \quad \quad \quad \; = \fracw^T w + \frac \sum\limits_^N e_i^2 - \sum\limits_^N \alpha _i \left\ , \end$

where $\alpha_i \in \mathbb$ are the Lagrange multipliers. The conditions for optimality are

: $\begin \frac = 0\quad \to \quad w = \sum\limits_^N \alpha _i \phi (x_i ) , \\ \frac = 0\quad \to \quad \sum\limits_^N \alpha _i = 0 ,\\ \frac = 0\quad \to \quad \alpha _i = \gamma e_i ,\;i = 1, \ldots ,N ,\\ \frac = 0\quad \to \quad y_i = w^T \phi (x_i ) + b + e_i ,\,i = 1, \ldots ,N . \end$

Elimination of $w$ and $e$ will yield a linear system instead of a quadratic programming problem:

: \left \begin
0 & 1_N^T \\
1_N & \Omega + \gamma ^ I_N
\end \right\left \begin
b \\
\alpha
\end \right= \left \begin
0 \\
Y
\end \right,

with Y = _1 , \ldots ,y_N T, 1_N = , \ldots ,1T and \alpha = alpha _1 , \ldots ,\alpha _N T. Here, $I_N$ is an $N \times N$ identity matrix, and $\Omega \in \mathbb^$ is the kernel matrix defined by $\Omega _ = \phi (x_i )^T \phi (x_j ) = K(x_i ,x_j )$.

Kernel function ''K''

For the kernel function ''K''(•, •) one typically has the following choices:
* Linear kernel : $K(x,x_i ) = x_i^T x,$
* Polynomial kernel of degree $d$: $K(x,x_i ) = \left( \right)^d ,$
* Radial basis function RBF kernel : $K(x,x_i ) = \exp \left( \right),$
* MLP kernel : $K(x,x_i ) = \tanh \left( \right),$

where $d$, $c$, $\sigma$, $k$ and $\theta$ are constants. Notice that the Mercer condition holds for all $c, \sigma \in \mathbb^+$ and $d \in N$ values in the polynomial and RBF case, but not for all possible choices of $k$ and $\theta$ in the MLP case. The scale parameters $c$, $\sigma$ and $k$ determine the scaling of the inputs in the polynomial, RBF and MLP kernel function. This scaling is related to the bandwidth of the kernel in statistics, where it is shown that the bandwidth is an important parameter of the generalization behavior of a kernel method.

Bayesian interpretation for LS-SVM

A Bayesian interpretation of the SVM has been proposed by Smola et al. They showed that the use of different kernels in SVM can be regarded as defining different prior probability distributions on the functional space, as P \propto \exp \left( \right). Here $\beta>0$ is a constant and $\hat$ is the regularization operator corresponding to the selected kernel.

A general Bayesian evidence framework was developed by MacKay,MacKay, D. J. C. The evidence framework applied to classification networks. Neural Computation, 4(5): 720–736, Sep. 1992. and MacKay has used it to the problem of regression, forward neural network and classification network. Provided data set $D$, a model $\mathbb$ with parameter vector $w$ and a so-called hyperparameter or regularization parameter $\lambda$, Bayesian inference is constructed with 3 levels of inference:
* In level 1, for a given value of $\lambda$, the first level of inference infers the posterior distribution of $w$ by Bayesian rule
::$p(w, D,\lambda ,\mathbb) \propto p(D, w,\mathbb)p(w, \lambda ,\mathbb).$
* The second level of inference determines the value of $\lambda$, by maximizing
::$p(\lambda , D,\mathbb) \propto p(D, \lambda ,\mathbb)p(\lambda , \mathbb).$
* The third level of inference in the evidence framework ranks different models by examining their posterior probabilities
::$p(\mathbb, D) \propto p(D, \mathbb)p(\mathbb).$

We can see that Bayesian evidence framework is a unified theory for learning the model and model selection.
Kwok used the Bayesian evidence framework to interpret the formulation of SVM and model selection. And he also applied Bayesian evidence framework to support vector regression.

Now, given the data points $\ _^N$ and the hyperparameters $\mu$ and $\zeta$ of the model $\mathbb$, the model parameters $w$ and $b$ are estimated by maximizing the posterior $p(w,b, D,\log \mu ,\log \zeta ,\mathbb)$. Applying Bayes’ rule, we obtain

:$p(w,b, D,\log \mu ,\log \zeta ,\mathbb) = \frac,$

where $p(D, \log \mu ,\log \zeta ,\mathbb)$ is a normalizing constant such the integral over all possible $w$ and $b$ is equal to 1.
We assume $w$ and $b$ are independent of the hyperparameter $\zeta$, and are conditional independent, i.e., we assume
:$p(w,b, \log \mu ,\log \zeta ,\mathbb) = p(w, \log \mu ,\mathbb)p(b, \log \sigma _b ,\mathbb).$

When $\sigma _b \to \infty$, the distribution of $b$ will approximate a uniform distribution. Furthermore, we assume $w$ and $b$ are Gaussian distribution, so we obtain the a priori distribution of $w$ and $b$ with $\sigma _b \to \infty$ to be

: $\begin p(w,b, \log \mu ,) = \left( \right)^ \exp \left( \right)\frac\exp \left( \right) \\ \quad \quad \quad \quad \quad \quad \quad \propto \left( \right)^ \exp \left( \right) \end .$

Here $n_f$ is the dimensionality of the feature space, same as the dimensionality of $w$.

The probability of $p(D, w,b,\log \mu ,\log \zeta ,\mathbb)$ is assumed to depend only on $w,b,\zeta$ and $\mathbb$. We assume that the data points are independently identically distributed (i.i.d.), so that:

: $p(D, w,b,\log \zeta ,\mathbb) = \prod\limits_^N .$

In order to obtain the least square cost function, it is assumed that the probability of a data point is proportional to:

: $p(x_i ,y_i , w,b,\log \zeta ,\mathbb) \propto p(e_i , w,b,\log \zeta ,\mathbb) .$

A Gaussian distribution is taken for the errors $e_i = y_i - (w^T \phi (x_i ) + b)$ as:

: $p(e_i , w,b,\log \zeta ,\mathbb) = \sqrt \exp \left( \right) .$

It is assumed that the $w$ and $b$ are determined in such a way that the class centers $\hat m_ -$ and $\hat m_ +$ are mapped onto the target -1 and +1, respectively. The projections $w^T \phi (x) + b$ of the class elements $\phi(x)$ follow a multivariate Gaussian distribution, which have variance $1/ \zeta$.

Combining the preceding expressions, and neglecting all constants, Bayes’ rule becomes

: $p(w,b, D,\log \mu ,\log \zeta ,\mathbb) \propto \exp ( - \fracw^T w - \frac\sum\limits_^N ) = \exp ( - J_2 (w,b)) .$

The maximum posterior density estimates $w_$ and $b_$ are then obtained by minimizing the negative logarithm of (26), so we arrive (10).

References

Bibliography

* J. A. K. Suykens, T. Van Gestel, J. De Brabanter, B. De Moor, J. Vandewalle, Least Squares Support Vector Machines, World Scientific Pub. Co., Singapore, 2002.
* Suykens J. A. K., Vandewalle J., Least squares support vector machine classifiers, ''Neural Processing Letters'', vol. 9, no. 3, Jun. 1999, pp. 293–300.
* Vladimir Vapnik. ''The Nature of Statistical Learning Theory''. Springer-Verlag, 1995. {{ISBN, 0-387-98780-0
* MacKay, D. J. C., Probable networks and plausible predictions—A review of practical Bayesian methods for supervised neural networks. ''Network: Computation in Neural Systems'', vol. 6, 1995, pp. 469–505.

External links

www.esat.kuleuven.be/sista/lssvmlab/
"Least squares support vector machine Lab (LS-SVMlab) toolbox contains Matlab/C implementations for a number of LS-SVM algorithms".

www.kernel-machines.org
"Support Vector Machines and Kernel based methods (Smola & Schölkopf)".

www.gaussianprocess.org
"Gaussian Processes: Data modeling using Gaussian Process priors over functions for regression and classification (MacKay, Williams)".

www.support-vector.net
"Support Vector Machines and kernel based methods (Cristianini)".


Contains a least-squares SVM implementation for large-scale datasets.

Support vector machines
Classification algorithms
Statistical classification
Least squares