# Question: Consider the problem of separating N data points into positive

Consider the problem of separating N data points into positive and negative examples using a linear separator. Clearly, this can always be done for N = 2 points on a line of dimension d = 1, regardless of how the points are labelled or where they are located (unless the points are in the same place).

a. Show that it can always be done for N = 3 points on a plane of dimension d = 2, unless they are collinear.

b. Show that it cannot always be done for N 4 points on a plane of dimension d = 2.

c. Show that it can always be done for N = 4 points in a space of dimension d = 3, unless they are coplanar.

d. Show that it cannot always be done for N = 5 points in a space of dimension d = 3.

e. The ambitious student may wish to prove that N points in general position (but not N + 1 are linearly separable in a space of dimension N — 1. From this it follows that the VC dimension of linear half spaces in dimension N — 1 is N.

a. Show that it can always be done for N = 3 points on a plane of dimension d = 2, unless they are collinear.

b. Show that it cannot always be done for N 4 points on a plane of dimension d = 2.

c. Show that it can always be done for N = 4 points in a space of dimension d = 3, unless they are coplanar.

d. Show that it cannot always be done for N = 5 points in a space of dimension d = 3.

e. The ambitious student may wish to prove that N points in general position (but not N + 1 are linearly separable in a space of dimension N — 1. From this it follows that the VC dimension of linear half spaces in dimension N — 1 is N.

**View Solution:**## Answer to relevant Questions

Defined a proper policy for an MDP as one that is guaranteed to reach a terminal state, show that it is possible for a passive ADP agent to learn a transition model for which its policy π is improper even if π is ...Write out the parameter update equations for TD learning with U (x, y) = θ0 + θ1x + θ2y + θ3 √ (x - xg) 2 + (y - y g) 2.Using DCG notation, write a grammar for a language that is just like Є1, except that it enforces agreement between the subject and verb of a sentence and thus does not generate “I smells the wumpus.”Draw a discourse parse tree for the story about John going to a fancy restaurant, use to the two grammar rules for Segment giving the proper Coherence Relation for each node. (You needn’t show the parse for individual ...An experiment to investigate the survival time in hours of an electronic component consists of placing the parts in a test cell and running them for 100 hours under elevated temperature conditions. (This is called an ...Post your question