DOC PREVIEW
CMU CS 10701 - Support Vector Machines

This preview shows page 1-2-19-20 out of 20 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

©2005-2007 Carlos Guestrin1Support Vector MachinesMachine Learning – 10701/15781Carlos GuestrinCarnegie Mellon UniversityFebruary 21st, 2007©2005-2007 Carlos Guestrin2Linear classifiers – Which line is better?Data:Example i:w.x = ∑jw(j)x(j)©2005-2007 Carlos Guestrin3Pick the one with the largest margin!w.x = ∑jw(j)x(j)w.x+ b = 0©2005-2007 Carlos Guestrin4Maximize the marginw.x+ b = 0©2005-2007 Carlos Guestrin5But there are a many planes…w.x+ b = 0©2005-2007 Carlos Guestrin6w.x+ b = 0Review: Normal to a plane©2005-2007 Carlos Guestrin7Normalized margin – Canonical hyperplanesw.x+ b = +1w.x+ b = -1w.x+ b = 0margin 2γx-x+©2005-2007 Carlos Guestrin8Normalized margin – Canonical hyperplanesw.x+ b = +1w.x+ b = -1w.x+ b = 0margin 2γx-x+©2005-2007 Carlos Guestrin9Margin maximization using canonical hyperplanesw.x+ b = +1w.x+ b = -1w.x+ b = 0margin 2γ©2005-2007 Carlos Guestrin10Support vector machines (SVMs)w.x+ b = +1w.x+ b = -1w.x+ b = 0margin 2γ Solve efficiently by quadratic programming (QP) Well-studied solution algorithms Hyperplane defined by support vectors©2005-2007 Carlos Guestrin11Announcements Third homework out later today This one is shorter!!!! :) Due on Monday March 5th  No late days allowed so we can give solutions before midterm©2005-2007 Carlos Guestrin12What if the data is not linearly separable?Use features of features of features of features….©2005-2007 Carlos Guestrin13What if the data is still not linearly separable? Minimize w.w and number of training mistakes Tradeoff two criteria? Tradeoff #(mistakes) and w.w 0/1 loss Slack penalty C Not QP anymore Also doesn’t distinguish near misses and really bad mistakes©2005-2007 Carlos Guestrin14Slack variables – Hinge loss If margin ≥ 1, don’t care If margin < 1, pay linear penalty©2005-2007 Carlos Guestrin15Side note: What’s the difference between SVMs and logistic regression?SVM:Logistic regression:Log loss:©2005-2007 Carlos Guestrin16What about multiple classes?©2005-2007 Carlos Guestrin17One against AllLearn 3 classifiers:©2005-2007 Carlos Guestrin18Learn 1 classifier: Multiclass SVMSimultaneously learn 3 sets of weights©2005-2007 Carlos Guestrin19Learn 1 classifier: Multiclass SVM©2005-2007 Carlos Guestrin20What you need to know Maximizing margin Derivation of SVM formulation Slack variables and hinge loss Relationship between SVMs and logistic regression 0/1 loss Hinge loss Log loss Tackling multiple class One against All Multiclass


View Full Document

CMU CS 10701 - Support Vector Machines

Documents in this Course
lecture

lecture

12 pages

lecture

lecture

17 pages

HMMs

HMMs

40 pages

lecture

lecture

15 pages

lecture

lecture

20 pages

Notes

Notes

10 pages

Notes

Notes

15 pages

Lecture

Lecture

22 pages

Lecture

Lecture

13 pages

Lecture

Lecture

24 pages

Lecture9

Lecture9

38 pages

lecture

lecture

26 pages

lecture

lecture

13 pages

Lecture

Lecture

5 pages

lecture

lecture

18 pages

lecture

lecture

22 pages

Boosting

Boosting

11 pages

lecture

lecture

16 pages

lecture

lecture

20 pages

Lecture

Lecture

20 pages

Lecture

Lecture

39 pages

Lecture

Lecture

14 pages

Lecture

Lecture

18 pages

Lecture

Lecture

13 pages

Exam

Exam

10 pages

Lecture

Lecture

27 pages

Lecture

Lecture

15 pages

Lecture

Lecture

24 pages

Lecture

Lecture

16 pages

Lecture

Lecture

23 pages

Lecture6

Lecture6

28 pages

Notes

Notes

34 pages

lecture

lecture

15 pages

Midterm

Midterm

11 pages

lecture

lecture

11 pages

lecture

lecture

23 pages

Boosting

Boosting

35 pages

Lecture

Lecture

49 pages

Lecture

Lecture

22 pages

Lecture

Lecture

16 pages

Lecture

Lecture

18 pages

Lecture

Lecture

35 pages

lecture

lecture

22 pages

lecture

lecture

24 pages

Midterm

Midterm

17 pages

exam

exam

15 pages

Lecture12

Lecture12

32 pages

lecture

lecture

19 pages

Lecture

Lecture

32 pages

boosting

boosting

11 pages

pca-mdps

pca-mdps

56 pages

bns

bns

45 pages

mdps

mdps

42 pages

svms

svms

10 pages

Notes

Notes

12 pages

lecture

lecture

42 pages

lecture

lecture

29 pages

lecture

lecture

15 pages

Lecture

Lecture

12 pages

Lecture

Lecture

24 pages

Lecture

Lecture

22 pages

Midterm

Midterm

5 pages

mdps-rl

mdps-rl

26 pages

Load more
Download Support Vector Machines
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Support Vector Machines and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Support Vector Machines 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?