In the book of Witten and Frank on Data Mining algorithms, I read:
"If boosting succeeds in reducing the error on fresh test data, it often does so in a spectacular way. One very surprising finding is that performing more boosting iterations can reduce the error on new data long after the error of the combined classifier on the training data has dropped to zero. Researchers were puzzled by this result because it seems to contradict Occam’s razor, which declares that of two hypotheses that explain the empirical evidence equally well the simpler one is to be preferred. Performing more boosting iterations without reducing training error does not explain the training data any better, and it certainly adds complexity to the combined classifier. Fortunately, the contradiction can be resolved by considering the classifier’s confidence in its predictions."
If I understand correctly, boosting can reduce the test error after the training error has dropped to zero. Does it mean that the classifier does overfit? Can you clear me this point?