1. no

Are you sure that L is bounded between 0 and 1? $\max(0, 1 – (-1)(+1))=2$

• You’re right. It was a typo. It’s a K>0. Thank you, even if I don’t see your name that I could have written.

2. no

The minimization in the update rule is unaffected by $C$. Why are they there? Your explanation of it is not consistent with the update rule. You can also take the $\xi$ out of the argmin.

• The minimization is subject to the second inequality. In my explanation xi=0, therefore L=0. When xi>0, the update rule has to find the minimum w(t+1) that satisfies the argmin (+ C*Xi) and L(w(t+1)) <= Xi.

This site uses Akismet to reduce spam. Learn how your comment data is processed.