Hi.

In the lecture about perceptron we talked about the unrealizable case. We said that the previous analysis about the number of mistakes is no longer correct, and we bound the number of mistakes as a function of the total hinge loss.

The question is - what is the algorithm for the unrealizable case? the scribes only bound the number of mistakes, but if we run perceptron without modifications, there will be infinite mistakes.

So - what is the algorithm in the unrealizable case?

Unrealizable perceptron