Suppose you are given the following binary classification training data, where each input example has three features and output label takes a value good or bad.

Now suppose we want to learn a classifier using kernelized perceptron algorithm. start from the following dual weights:

show how the dual weights change after processing examples in the same order. and do it separately for the following kernels:

1) Linear kernel:

b) Polynomial kernel with degree 3:

note that x*x' stands for dot product between two inputs x and x'

71 = (0,1,0), y1 = good 71 = (0,1,0), y1 = good