Support Vector Machines - The Auton Lab
Support Vector Machines - The Auton Lab
Support Vector Machines - The Auton Lab
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Maximize<br />
QP with Quintic basis functions<br />
We must do R 2 /2 dot products R R to get this<br />
matrix ready.<br />
∑αk<br />
+ ∑∑αkαlQ<br />
where Q ( ( ). ( ))<br />
kl<br />
kl<br />
= yk<br />
yl<br />
Φ xk<br />
Φ xl<br />
In 100-d, each k = 1dot product k = 1now l=<br />
1 needs 103<br />
<strong>The</strong> use of Maximum Margin<br />
operations instead of 75 million<br />
magically makes this not a<br />
problem R<br />
But there are still worrying things lurking away.<br />
Subject to these<br />
What are they? 0 ≤ α k<br />
≤ C ∀k<br />
∑ α k<br />
y k<br />
= 0<br />
constraints:<br />
•<strong>The</strong> fear of overfitting kwith = 1 this enormous<br />
number of terms<br />
<strong>The</strong>n define:<br />
•<strong>The</strong> evaluation phase (doing a set of<br />
predictions on a test set) will be very<br />
expensive (why?)<br />
w<br />
=<br />
k s.t.<br />
∑<br />
α k<br />
α<br />
y k k<br />
> 0<br />
Φ ( x<br />
wb<br />
⋅= Φ ( yx<br />
) =<br />
K<br />
(1 −∑<br />
εα<br />
k<br />
y<br />
K<br />
) k<br />
Φ−<br />
(<br />
x<br />
k<br />
)<br />
K<br />
. ⋅wΦ<br />
k s.t. α k > 0<br />
where<br />
=<br />
K∑=<br />
α<br />
arg k<br />
y k<br />
( xmax<br />
k<br />
⋅ x + 1)<br />
α<br />
k s.t. α k > 0<br />
k<br />
k<br />
Only Sm operations (S=#support vectors)<br />
k<br />
)<br />
( x )<br />
K<br />
5<br />
Because each w. φ(x) (see below)<br />
needs 75 million operations. What<br />
can be done?<br />
<strong>The</strong>n classify with:<br />
f(x,w,b) = sign(w. φ(x) -b)<br />
Copyright © 2001, 2003, Andrew W. Moore <strong>Support</strong> <strong>Vector</strong> <strong>Machines</strong>: Slide 57<br />
Maximize<br />
QP with Quintic basis functions<br />
We must do R 2 /2 dot products R R to get this<br />
matrix ready.<br />
∑αk<br />
+ ∑∑αkαlQ<br />
where Q ( ( ). ( ))<br />
kl<br />
kl<br />
= yk<br />
yl<br />
Φ xk<br />
Φ xl<br />
In 100-d, each k = 1dot product k = 1now l=<br />
1 needs 103<br />
<strong>The</strong> use of Maximum Margin<br />
operations instead of 75 million<br />
magically makes this not a<br />
problem R<br />
But there are still worrying things lurking away.<br />
Subject to these<br />
What are they? 0 ≤ α k<br />
≤ C ∀k<br />
∑ α k<br />
y k<br />
= 0<br />
constraints:<br />
•<strong>The</strong> fear of overfitting kwith = 1 this enormous<br />
number of terms<br />
<strong>The</strong>n define:<br />
•<strong>The</strong> evaluation phase (doing a set of<br />
predictions on a test set) will be very<br />
expensive (why?)<br />
wb<br />
w<br />
⋅<br />
=<br />
k s.t.<br />
∑<br />
α k<br />
α<br />
y k k<br />
> 0<br />
Φ ( x<br />
= Φ ( yx<br />
) = (1 −∑<br />
εα<br />
) Φ−<br />
(<br />
x ) . ⋅wΦ<br />
k<br />
)<br />
Because each w. φ(x) (see below)<br />
needs 75 million operations. What<br />
can be done?<br />
k<br />
y k k<br />
K k s.t. α k > 0K<br />
K K<br />
5 <strong>The</strong>n When classify you see this with: many callout bubbles on<br />
where<br />
=<br />
K∑=<br />
α<br />
arg k<br />
y k<br />
( xmax<br />
k<br />
⋅ x + 1)<br />
α<br />
a slide it’s time to wrap the author in a<br />
k s.t. α k > 0<br />
k<br />
blanket, gently take him away and murmur<br />
k<br />
f(x,w,b) “someone’s = been sign(w. at the PowerPoint φ(x) -b) for too<br />
long.”<br />
Copyright © 2001, 2003, Andrew W. Moore <strong>Support</strong> <strong>Vector</strong> <strong>Machines</strong>: Slide 58<br />
Only Sm operations (S=#support vectors)<br />
( x )<br />
29