Open xwxahu opened 4 years ago
Thank you very much for your reply! But I still troubled in the problem of reward. In the codes of ND problem, the reward is defined as - |GCC| / (N*N). What does it mean? For example: given a graph with 10 nodes and its |GCC| is 8: if we remove a critical node A, the |GCC| decreases to 5, than the action of removing A will get reward - 0.05 if we further remove a non-critical node B, the |GCC| is stay in 5, and the action of removing B will also get reward - 0.05. It seems that removing a non-critical node can also get higher reward. Would you like to explain it? Again thanks for your answers for the former probelms!
Thank you, that's a very important question! Here our goal is to learn a node removal sequence that could minimize the ANC value, thus in your case, A and B are different when measured as critical/non-critical from the local view point, they may contribute the same to the calculation of ANC value, as a result, they are given the same reward in our setting. Keep in mind, the reward is defined according your learning objective.
I got it! Thanks very much for your assistance.
Hello! I read the FINDER recently and there are two questions puzzled me.