-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Is this method relevant for binary classification? #1
Comments
This method is not specified to multi-class problems. In a binary case, there will be only 1 adversarial class, which leads this method to a form similar to IG, except that IG requires a straightline path and a starting reference point, this AGI method is still able to automatically find a path. |
Thank you for your answer, that is what I thought but I wasn't sure. Anyway thank you for your work, I managed to get some pretty amazing results with this method that I could not get with classical IG. One last question, is it normal that on the following lines the Lines 89 to 90 in 4b28c8b
According to the algorithm below, I would expect something like There could be an issue when the gradient is zero, but it could be solved by clipping the norm to some small value: delta = epsilon * (data_grad_adv / torch.clamp(grad_lab_norm, min=1e-8)).sign() |
Yes! You're correct. But since we only take the sign, it shouldn't cause any differences. Your suggestion should also work. |
Those adversarial gradients seem quite promising to get rid of this arbitrary baseline.
However, in the case of binary classification, would this method be relevant? There would be only one adversarial example, not multiple ones like in a multi-class problem. What are your thoughts about that?
The text was updated successfully, but these errors were encountered: