Question: Support Vector Machines We have seen that in p = 2 dimensions, a linear decision boundary takes the form 0 + 1 x 1 +

Support Vector Machines
We have seen that in p=2 dimensions, a linear decision boundary takes the form 0+1x1+2x2=0. We now investigate a non-linear decision boundary.
(a)(0.5 Point) Sketch the curve (1+x1)2+(2-x2)2=4.
(b)(0.5 Point) On your sketch, indicate the set of points for which (1+x1)2+(2-x2)2>4 and the set of points for which (1+x1)2+(2-x2)24
(c)(1 Point) Suppose that a classifier assigns an observation to the blue class if (1+x1)2+(2-x2)2>4, and to the red class otherwise. To what class are the following observations classified? (0,0),(-1,1),(2,2),(3,8).
(d)(1 Point) Argue that while the decision boundary in (c) is not linear in terms of x1 and x2, it is linear in terms of x1,x2,x12, and x22.
2. Provide and explain one case where you would prefer One versus One approach to One vs All for multi-class classification. Provide one example and explain where you would prefer One vs All.
Consider the following optimization problem for Support Vector Classifier given in ISLP book Section 9.2.2. This classifier can be used to learn a linear decision boundary between two classes.
mamize0,1dots,p,lon0,lon1,dots,lonp,MM
subject toj=1pj2=1,
yi(0+1xi1+2xi2+dots+pxip)M(1-loni)
loni0,i=1nloniC.
(a) Explain how the variables loni and C are related.
(b) Explain why the following sentence is true or false: "As the value of C increases, the bias of the classifier decreases and the variance increases"
(c) Write down the optimization problem if we want to change the linear decision boundary to a quadratic decision boundary.
(d) How would you change the support vector classifier such that it can fit arbitrary non-linear decision boundary? (Hint: Read Section 9.3 ISLP)
 Support Vector Machines We have seen that in p=2 dimensions, a

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!