[ketchers]

I would be curious on how to calculate - or estimate - the average number of iterations for convergence - as well as the probability - perhaps these are really the same question in disguise. It is a very simple procedure, but there is enough random elements to it so that it leaves the realm of what I am familiar with calculating:

As I understand it ...

1) choose N random points in the unit square
2) choose a random line

This gives the target

3) start with w(0) = [0;0]
4) run algorithm where in computing w(n+1) a random selection from the mis-classified points is used. (perhaps the random choice here is not-relevant)


A pointer to where a similar calculation is made would be fine. Thanks!