Any clues as to the following would be appreciated.

For inseparable data the Perceptron algorithm will go into an infinite loop.

Assuming the training examples are distinct, consider the modification of

a normalised kernel k to

(x; z) =k(x; z) + a.k(x; z);g

where a > 0 and

(x; z) =g

1 if x = z;

0 otherwise:

Show we can find a such that.a = y for the label vector y, whereKisK

the kernel matrix of the modied kernel. Hence, argue that the trainingk

set is separable in the feature space defined by the kenel mapping phi(x).