# Kernelized perceptron algorithm weights update

I'm asked to find the maximum margin decision surface separating positive from negative samples by inspection. The positive examples are (1,1) and (-1,-1), the negative ones are (1,-1) and (-1,1). The feature transformation is $$\phi(x)=[1,x_1,x_2,x_1x_2]$$. The solution should be $$w=(0,0,0,1)^T$$.

On Alex Smola's slides, there are two weight perceptron algorithms, the weight update of the first one (slide 36/56):

if $$y_i(w\cdot\phi(x_i)+b)\leq0$$ then

$$w'=w+y_i\phi(x_i)$$

the second one instead (slide 43/56):

if $$y_if(x_i)\leq0$$ then

$$f(\cdot)\leftarrow f(\cdot)+y_ik(x_i,\cdot)+y_i$$

My understanding is that the first algorithm is simply the perceptron algorithm after applying some mapping function on the features while the second one is the updated perceptron algorithm after the kernel trick. Which one should I apply for the above exercise?

Considering the second algorithm, since the classifier is linear combination of inner products $$f(x)=\sum\limits_{i \in I} y_ik(x_i,x)+b$$ what is being updated after each step if the weights are no longer in the equation?