[go: up one dir, main page]
Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Stepsize for PGD attacks #685

Open
Changgun-Choi opened this issue May 9, 2022 · 1 comment
Open

Stepsize for PGD attacks #685

Changgun-Choi opened this issue May 9, 2022 · 1 comment
Labels
question

Comments

@Changgun-Choi
Copy link

Hello,
Q.1
is it possible to give list of epsilon for LinfPGD attacks? I wanted to test how a number of steps affect the result in terms of PGD attacks.
Q. 2
I would like to know how we could decide on stepsize which is abs_stepsize? I read the documents but seems like no explanation about it. Is there a strategy for deciding on stepsize?

My code:

eps = [0, 0.1/255, 0.3/255, 1/255, 4/255]
stepsize = [i/4 for i in eps]
steps= args.steps
attack = LinfPGD(rel_stepsize=0.033, abs_stepsize=stepsize, steps=steps, random_start=True)
@zimmerrol
Copy link
Member

Hi. Sadly, I don't fully understand your first question. Regarding your second question: please refer to the literature for this - a common choice is to choose the step size such that the equation n_steps * step_size = epsilon * k for k>1 is satisfied. I believe, Madry et al. first proposed this relation with something like k=2.5.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
question
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@zimmerrol @Changgun-Choi