We initialize the parameters to all zero values and run the linear perceptron algorithm through these points in
a particular order until convergence. The number of mistakes made on each point are shown in the table
below. (These points correspond to the data point in the plot above)
(3)
2 puntos posibles (calificados, resultados ocultos)
Suppose that we now find the linear separator that maximizes the margin instead of running the perceptron
algorithm.
What are the parameters \theta _(0) and \theta \theta _(0) accurate to at least 3 decimal places.\theta _(0)=\theta as a vector, enclosed in square brackets, and components separated by commas, e.g. type [ 0,1 ] for
[[0,1]]^(T).\theta =