(Solved) : Answer Consider Sequence 2 Dimensional Data Points 71 X2 Xm Corresponding Labels Y 1 Y 2 Q26227472 . . . .

Answer

Consider a sequence of 2-dimensional data points, 71,x2,…,xmand their corresponding labels y(1),y(2), ,y(n). Recall theperceptron algorithm updates the parameters whenever y(i)メh(z(i);where h(z(i). θ) = sign(θ . (i) + b). Assume that the points arelinearly separable, and that both θ and b are initialized to zero.Let αǐ denote the number of times x(i) is misclassified duringtraining. (a) (1pt) Derive the final decision boundary for theperceptron in terms of ai, and yf”) (b) (1pt) Show that theshortest signed distance from the boundary to the origin is equalto (c) (2pts) The following table shows a dataset and the number oftimes each point is