The concepts of separation/margin, violation, and diameter all change accordingly with this new confusion set.
we say that a dataset D is greedily separable in representation Φ if and only if D, Φ, C g (D) is linearly separable, and we say ( return (x, y, y) ⊲ success (z = y), no violation We now express early update for greedy search (Algorithm 5) in terms of violation-fixing perceptron.