Is any classifier not subject to fooling as in here?
I agree that the question is related to the other one as commented by Philip. But I guess it is not completely a duplication as pointed out by hisairnessag3. What I wanted to ask is that any classifiers inherently do not subject (or less prone) to attack. I have a feeling that non-linear classifiers should be less susceptible to attack. Btw, any benchmark on say, simple K-nearest neighbor classifiers is available?