Why compute gradient for adj_changes about deeprobust HOT 2 CLOSED

Hi wuyiteng,

(1) Since the final attack goal is to modify the original unnormalized adjacency matrix (where the value is binary). It would be more precise to calculate the gradient directly to adj_changes instead of adj_norm.
(2) In the implementation,adj_grad is not symmetric. We first take out the argmax of adj_grad and we can get its row index and column index. Then we correspondingly modify A[row_id][col_id] as well as A[col_id][row_id] to make sure the attacked graph is symmetric.

Hope this post can help you. Thanks.

from deeprobust.

Thanks for your prompt reply. We think carefully abour your answers and temporarily no conclusion to reply. Some details are not handled properly in our work. Thanks again for you help.

from deeprobust.