Sparse Kernel Machines

1 / 39

# Sparse Kernel Machines - PowerPoint PPT Presentation

Sparse Kernel Machines. Introduction. Kernel function k(xn,xm) must be evaluated for all pairs of training points Advantageous (computationally) to look at kernel algorithms that have sparse solutions new predictions depend only on kernel function evaluated at a few training points

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Sparse Kernel Machines' - joey

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Sparse Kernel Machines

Introduction
• Kernel function k(xn,xm) must be evaluated for all pairs of training points
• Advantageous (computationally) to look at kernel algorithms that have sparse solutions
• new predictions depend only on kernel function evaluated at a few training points
• possible solution: support vector machines (SVM)
Maximum Margin Classifiers (1)
• Setup:
• y(x) = w’φ(x) + b, φ(x) = feature-space transformation

Training data comprises

• N input data vectors x1,...,xN
• N target vectors t1,...,tNtn∈{-1,1}
• new samples classified according to sign of y(x)
• assume linearly separable data for the moment
• y(x)>0 for points of class +1 (i.e. tn = +1)
• y(x)<0 for points having tn = -1
• therefore,tny(xn) > 0 for all training points
Maximum Margin Classifiers (2)
• There may be many solutions to separate the data

SVM tries to minimize the generalization error by introducing the concept of a margin i.e. smallest distance between the decision boundary and any of the samples

• Decision boundary is chosen to be that for which the margin is maximized
• decision boundary thus only dependent on points closest to it.

tny(xn) > 0 for all n

• The distance of xn to the decision surface is then
• tny(xn)
• w = tn(wTφ(xn) + b)
• w
• ● Optimize w and b to maximize this distance => solve
• (7.2)
• (7.3)
• ● Quite hard to solve => need to get around it

the parameter ν, which replaces C, can beinterpreted as both an upper bound on the fraction of margin errors (points for whichξn > 0 and hence which lie on the wrong side of the margin boundary and which mayor may not be misclassified) and a lower bound on the fraction of support vectors.